Reconfigurable modular arithmetic logic unit for high-performance public-key cryptosystems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3985 LNCS, Issue , 2006, Pages 347-357

  Sakiyama, K ^a   Mentens, N ^a   Batina, L ^a   Preneel, B ^a   Verbauwhede, I ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Elliptic Curve Cryptography (ECC); FPGA implementation; Public Key Cryptography (PKC); Reconfigurable architecture; RSA

Indexed keywords

COMPUTER HARDWARE; FIELD PROGRAMMABLE GATE ARRAYS; FLIP FLOP CIRCUITS; PUBLIC KEY CRYPTOGRAPHY;

CARRY-SAVE ADDERS (CSA); ELLIPTIC CURVE CRYPTOGRAPHY (ECC); FPGA IMPLEMENTATION; RECONFIGURABLE ARCHITECTURE;

DIGITAL ARITHMETIC;

EID: 33749071674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11802839_43     Document Type: Conference Paper

References (12)

1. L. Batina, G. Bruin-Muurling, and S.B. Örs. Flexible hardware design for RSA and elliptic curve cryptosystems. In T. Okamoto, editor, In Topics in Cryptology - CT-RSA - The Cryptographers' Track at the RSA Conference, volume 2964 of Lecture Notes in Computer Science, pages 250-263. Springer-Verlag, 2004.
2. L. Batina and G. Muurling. Montgomery in Practice: How to Do It More Efficiently in Hardware. In B. Preneel, editor, In Topics in Cryptology - CT-RSA - The Cryptographers ' Track at the RSA Conference, number 2271 in Lecture Notes in Computer Science, pages 40-52, San Jose, USA, February 18-22 2002. Springer-Verlag.
3. F. Crowe, A. Daly, and W. Marnane. A Scalable Dual Mode Arithmetic Unit for Public Key Cryptosystems, In Proc. IEEE International Conference Conference on Information Technology - ITCC'05, pages 568-573, Las Vegas, 2005.
4. W. Diffie and M.E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, 1976.
5. N. Koblitz. Elliptic curve cryptosystem. Math. Comp., 48:203-209, 1987.
6. P. Kocher, J. Jaffe, and B. Jun. Introduction to differential power analysis and related attacks, http://vwv.cryptography.com/dpa/technical, 1998.
7. C. McIvor, M. McLoone, J. McCanny, A. Daly, and W. Marnane. Fast Montgomery Modular Multiplication and RSA Cryptographic Processor Architectures, In Proceedings of 37th Annual Asilomar Conference on Signals, Systems and Computers, pages 379-384, November 2003.
8. A.J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
9. V. Miller. Uses of elliptic curves in cryptography. In H. C. Williams, editor, Advances in Cryptology: Proceedings of CRYPTO'85, number 218 in Lecture Notes in Computer Science, pages 417-426. Springer-Verlag, 1985.
10. J.-J. Quisquater and G. Couvreur. Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters, 18:905-907, October 1982.
11. R.L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key Cryptosystems. Communications of the ACM, 21(2):120-126, 1978.
12. A.F. Tenca and Ç.K. Koç. A scalable architecture for Montgomery multiplication. In Ç.K. Koç and C. Paar, editors, Proceedings of 1st International Workshop on Cryptographic Hardware and Embedded Systems (CHES), number 1717 in Lecture Notes in Computer Science, pages 94-108, Worcester, Massachusetts, USA, August 12-13 1999. Springer-Verlag.