User: Guest  Login
Title:

Multiplierless Design of Very Large Constant Multiplications in Cryptography

Document type:
Magazinartikel
Author(s):
Aksoy, Levent and Basu Roy, Debapriya and Imran, Malik and Karl, Patrick and Pagliarini, Samuel
Abstract:
This brief addresses the problem of implementing very large constant multiplications by a single variable under the shift-adds architecture using a minimum number of adders/subtractors. Due to the intrinsic complexity of the problem, we introduce an approximate algorithm, called TÕLL, which partitions the very large constants into smaller ones. To reduce the number of operations, TÕLL incorporates graph-based and common subexpression elimination methods proposed for the shift-adds design...     »
Keywords:
very large constant multiplication, shift-adds design, graph-based algorithms, common subexpression elimination, delay-aware optimization, cryptography
Dewey Decimal Classification:
620 Ingenieurwissenschaften
Journal title:
Transactions on Circuits and Systems II: Express Briefs
Year:
2022
Year / month:
2022-07
Quarter:
3. Quartal
Month:
Jul
Reviewed:
ja
Language:
en
Fulltext / DOI:
doi:10.1109/TCSII.2022.3191662
WWW:
https://ieeexplore.ieee.org/document/9832417
Publisher:
IEEE
 BibTeX