Reference : Realizing Arbitrary-Precision Modular Multiplication with a Fixed-Precision Multiplie...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/2766
Realizing Arbitrary-Precision Modular Multiplication with a Fixed-Precision Multiplier Datapath
English
Großschädl, Johann mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Savas, Erkay [Sabanci University, Turkey]
Yumbul, Kazim [Gebze Institute of Technology, Turkey]
Dec-2009
Proceedings of the 5th International Conference on Reconfigurable Computing and FPGAs (RECONFIG 2009)
Prasanna, Viktor K.
Torres, Lionel
Cumplido, René
IEEE Computer Society
261-266
Yes
International
978-0-7695-3917-1
5th International Conference on Reconfigurable Computing and FPGAs (RECONFIG 2009)
December 9-11, 2009
Cancun
Mexico
[en] Applied cryptography ; Montgomery multiplication ; Bit-serial multiplier datapath ; Scalability ; Performance evaluation
[en] Within the context of cryptographic hardware, the term scalability refers to the ability to process operands of any size, regardless of the precision of the underlying datapath or registers. In this paper we present a simple yet effective technique for increasing the scalability of a fixed-precision Montgomery multiplier. Our idea is to extend the datapath of a Montgomery multiplier in such a way that it can also perform an ordinary multiplication of two n-bit operands (without modular reduction), yielding a 2n-bit result. This conventional (n*n->2n)-bit multiplication is then used as a "sub-routine" to realize arbitrary-precision Montgomery multiplication according to standard software algorithms such as Coarsely Integrated Operand Scanning (CIOS). We show that performing a 2n-bit modular multiplication on an n-bit multiplier can be done in 5n clock cycles, whereby we assume that the n-bit modular multiplication takes n cycles. Extending a Montgomery multiplier for this extra functionality requires just some minor modifications of the datapath and entails a slight increase in silicon area.
http://hdl.handle.net/10993/2766
10.1109/ReConFig.2009.83
http://www.computer.org/csdl/proceedings/reconfig/2009/3917/00/3917a261-abs.html

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
RECONFIG2009.pdfAuthor postprint154.65 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.