×

Operand folding hardware multipliers. (English) Zbl 1301.68023

Naccache, David (ed.), Cryptography and security: From theory to applications. Essays dedicated to Jean-Jacques Quisquater on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-28367-3/pbk). Lecture Notes in Computer Science 6805, 319-328 (2012).
Summary: 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 (\(\frac{m}2\)).
For the entire collection see [Zbl 1233.94004].

MSC:

68M07 Mathematical problems of computer architecture
PDFBibTeX XMLCite
Full Text: DOI