DocumentCode
3473066
Title
Four Hardware Implementations for the M-ary Modular Exponentiation
Author
Nedjah, Nadia ; Mourelle, Ld.M.
fYear
2006
fDate
10-12 April 2006
Firstpage
210
Lastpage
215
Abstract
Modular exponentiation is a cornerstone operation to several public-key cryptosystems. It is performed using successive modular multiplications. Clearly, one needs to reduce the total number of modular multiplication required. In this paper, we propose four hardware implementations for computing modular exponentiations using the m-ary method. During this step, the first implementation pre-computes all powers while the second computes only those that are necessary. The main difference between the first two implementations resides in the pre-processing step. However, the first implementation requires less hardware area than the second. The last two do require any pre-processing of the exponent. One of these two implementations is hardware only and the second uses the co-design methodology. We compare these two implementations using the performance factor, which takes into account both space and time requirements
Keywords
digital arithmetic; public key cryptography; codesign methodology; exponent preprocessing; hardware implementation; m-ary modular exponentiation; modular multiplication; performance factor; public key cryptosystem; Computer architecture; Counting circuits; Elliptic curve cryptography; Elliptic curves; Hardware; Multiplexing; Partitioning algorithms; Power generation; Public key cryptography; Registers;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: New Generations, 2006. ITNG 2006. Third International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
0-7695-2497-4
Type
conf
DOI
10.1109/ITNG.2006.65
Filename
1611595
Link To Document