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

International Journal of Electronics

Volumn 94, Issue 5, 2007, Pages 501-514

  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 cryptosystem; Reconfigurable architecture; RSA

Indexed keywords

ADDERS; CMOS INTEGRATED CIRCUITS; COMPUTER ARCHITECTURE; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); FLIP FLOP CIRCUITS; PUBLIC KEY CRYPTOGRAPHY;

ARITHMETIC LOGIC UNIT; CARRY-SAVE ADDERS (CSAS); ELLIPTIC CURVE CRYPTOGRAPHY (ECC); RECONFIGURABLE ARCHITECTURE;

DIGITAL ARITHMETIC;

EID: 34547372186     PISSN: 00207217     EISSN: 13623060     Source Type: Journal    
DOI: 10.1080/00207210701293264     Document Type: Conference Paper

References (15)

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