Title :
A scalable dual mode arithmetic unit for public key cryptosystems
Author :
Crowe, Francis ; Daly, Alan ; Marnane, William
Author_Institution :
Dept. of Electr. & Electron. Eng., Univ. Coll. Cork, Ireland
Abstract :
Elliptic curve cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the sizes of these systems is increasing as security requirements become more demanding due to cryptanalytic advances. At current security levels of 80 bits, the corresponding key sizes for ECC and RSA are J60 and 1,024 bits respectively. Although the ECC key size is attractive for embedded applications, the popularity of RSA means that it will remain in legacy applications for the foreseeable future. This paper proposes a dual mode arithmetic unit capable of supporting the underlying field operations performed by both the ECC and RSA public key schemes. A hardware optimized version of the Montgomery algorithm is employed to perform modular multiplication efficiently. The disparity in key sizes is addressed by combining the dual processors to operate in parallel for ECC or in a pipelined series for RSA.
Keywords :
digital arithmetic; embedded systems; field programmable gate arrays; parallel processing; public key cryptography; Montgomery algorithm; RSA; dual processors; elliptic curve cryptosystems; embedded applications; key size disparity; legacy applications; parallel processing; pipeline processing; public key cryptosystems; scalable dual mode arithmetic; security level; security requirements; Arithmetic; Elliptic curve cryptography; Field programmable gate arrays; Hardware; Information security; Logic devices; National security; Power system security; Public key; Public key cryptography;
Conference_Titel :
Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on
Print_ISBN :
0-7695-2315-3
DOI :
10.1109/ITCC.2005.33