Operand Folding Hardware Multipliers - Mines Saint-Étienne Access content directly
Book Sections Year : 2012

Operand Folding Hardware Multipliers

Abstract

This paper describes a new accumulate-and-add multiplication algorithm. The method partitions one of the operands and re-combines the results of computations done with each of the partitions. The resulting design turns-out to be both compact and fast. When the operands' bit-length m is 1024, the new algorithm requires only 0.194m + 56 additions (on average), this is about half the number of additions required by the classical accumulate-and-add multiplication algorithm (m/2).

Dates and versions

emse-00742764 , version 1 (17-10-2012)

Identifiers

Cite

Byungchun Chung, Amir Pasha Mirbaha, David Naccache, Sandra Marcello, Karim Sabeg. Operand Folding Hardware Multipliers. David Naccache. Cryptography and Security: From Theory to Applications:Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday, 6805, Springer, pp.319-328, 2012, LNCS - Lecture Notes in Computer Science, 978-3-642-28367-3. ⟨10.1007/978-3-642-28368-0_21⟩. ⟨emse-00742764⟩
216 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More