DocumentCode
2012689
Title
Montgomery modular multiplication architecture for public key cryptosystems
Author
McLoone, Máire ; McIvor, Ciaran ; McCanny, John V.
Author_Institution
Inst. of Electron., Commun. & Inf. Technol., Queen´´s Univ., Belfast, UK
fYear
2004
fDate
13-15 Oct. 2004
Firstpage
349
Lastpage
354
Abstract
This paper describes a novel hardware architecture of the coarsely integrated hybrid scanning (CIHS) algorithm which performs Montgomery modular multiplication. The CIHS algorithm integrates the multiplication and reduction steps involved in modular multiplication. When implemented on a Virtex XC2VP50 device, the architecture can perform 128-bit modular multiplication at a data-rate of 160 Mbit/s and 256-bit modular multiplication at 216 Mbit/s. To the authors´ knowledge, these are the first performance figures for a hardware CIHS algorithm architecture to be reported in the literature. A methodology for generating Montgomery multiplication test vectors is also described.
Keywords
digital arithmetic; field programmable gate arrays; public key cryptography; 128 bit; 160 Mbit/s; 216 Mbit/s; 256 bit; CIHS algorithm; Montgomery modular multiplication architecture; Montgomery multiplication test vectors; Virtex XC2VP50 device; coarsely integrated hybrid scanning algorithm; hardware architecture; public key cryptosystems; reduction steps; Computer architecture; Digital signatures; Elliptic curve cryptography; Hardware; Information technology; Public key cryptography; Security; Software algorithms; Testing; Transport protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Systems, 2004. SIPS 2004. IEEE Workshop on
Print_ISBN
0-7803-8504-7
Type
conf
DOI
10.1109/SIPS.2004.1363075
Filename
1363075
Link To Document