Skip to Main content Skip to Navigation
Book sections

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).
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/emse-00742764
Contributor : Hélène Le Bouder <>
Submitted on : Wednesday, October 17, 2012 - 11:03:00 AM
Last modification on : Tuesday, September 22, 2020 - 3:47:16 AM

Links full text

Identifiers

Relations

Citation

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⟩

Share

Metrics

Record views

515