Reconfigurable modular arithmetic logic unit supporting high-performance RSA and ECC over GF( p)

References

• Andres , M , Mathew , S , Harris , D , Krishnamurthy , R and Hsu , S . 27–29 June 2005 . “An improved unified scalable radix-2 Montgomery multiplier” . In Proceedings of 14th IEEE Symposium on Computer Arithmetic (ARITH-17) , 27–29 June , 172 – 178 . MA, , USA : Cape Cod .
   Google Scholar
• Batina , L , Muurling , G and Örs , SB . 23–27 February 2004 . “Flexible hardware design for RSA and elliptic curve cryptosystems” . In Topics in Cryptology -- CT-RSA -- The Cryptographers' Track at the RSA Conference , Edited by: Okamoto , T . 23–27 February , Berlin, , Germany : Springer-Verlag . number 2964n in Lecture Notes in Computer Science, San Francisco, CA, USA
   Google Scholar
• Blake , I , Seroussi , G and Smart , NP . 1999 . “Elliptic Curves in Cryptography , Cambridge : Cambridge University Press . London Mathematical Society Lecture Note Series 265
   Google Scholar
• Diffie , W and Hellman , ME . 1976 . “New directions in cryptography” . IEEE Trans. Infor. Theory , 22 : 644 – 654 .
   Web of Science ®Google Scholar
• IEEE P1363. 2000 . Standard Specifications for Public Key Cryptography . http://grouper.ieee.org/groups1363/
   Google Scholar
• Koblitz , N . 1987 . “Elliptic curve cryptosystem” . Math. Comp. , 48 : 203 – 209 .
   Web of Science ®Google Scholar
• Koblitz , N . 1994 . A Course in Number Theory and Cryptography, volume 114 of Graduate Text in Mathematics”, , 2nd ed. , Berlin, , Germany : Springer-Verlag .
   Google Scholar
• Kocher , P , Jaffe , J and Jun , B . 1998 . “Introduction to differential power analysis and related attacks” . url: http://www.cryptography.com/dpa/technical
   Google Scholar
• Lenstra , A and Verheul , E . 2000 . “Selecting cryptographic key sizes” . In Proceedings of Third International Workshop on Practice and Theory in Public Key Cryptography (PKC 2000) , Edited by: Imai , H and Zhengnumber , Y . 446 – 465 . Berlin : Springer-Verlag . 1751 in Lecture Notes in Computer Science
   Google Scholar
• McIvor , C , McLoone , M , McCanny , J , Daly , A and Marnane , W . November 2003 . “Fast montgomery modular multiplication and RSA cryptographic processor architectures” . In Proceedings of 37th Annual Asilomar Conference on Signals, Systems and Computers , November , 379 – 384 . CA, , USA : Monterey .
   Google Scholar
• Menezes , AJ . 1993 . “Elliptic Curve Public Key Cryptosystems” , Norwel, MA, , USA : Springer-Verlag .
   Google Scholar
• Miller , V . 1985 . “Uses of elliptic curves in cryptography” . In Advances in Cryptology: Proceedings of CRYPTO'85 , Edited by: Williams , HC . 417 – 426 . Berlin : Springer-Verlag . number 218 in Lecture Notes in Computer Science
   Google Scholar
• Quisquater , J-J and Couvreur , C . 1982 . “Fast decipherment algorithm for RSA public-key cryptosystem” . Elect. Lett. , 18 : 905 – 907 .
   Google Scholar
• Rivest , RL , Shamir , A and Adleman , L . 1978 . “A method for obtaining digital signatures and public-key cryptosystems” . Communicat. of the ACM , 21 : 120 – 126 .
   Web of Science ®Google Scholar
• Tenca , AF and Koç , Ç.K . 2003 . “A scalable architecture for modular multiplication based on Montgomery’s algorithm” . IEEE Trans. Comput. , 52 : 1215 – 1221 .
   Web of Science ®Google Scholar