Reconfigurable processor for public-key cryptography

IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation

Volumn 2005, Issue , 2005, Pages 110-115

  Smyth, Neil ^a   McLoone, Maire ^a   McCanny, John V ^a  

^a QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; INTEGER PROGRAMMING; NUMERICAL METHODS; PUBLIC POLICY;

CLASSICAL EXPONENTIATION; DIFFIE-HELLMAN PUBLIC-KEY CRYPTOGRAPHY; EXPONENTIATION; MODULAR EXPONENTIATION; MONTGOMERY MULTIPLICATION;

CRYPTOGRAPHY;

EID: 33846994342     PISSN: 15206130     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIPS.2005.1579848     Document Type: Conference Paper

References (14)

1. R. P. Brent, "Recent Progress and Prospects for Integer Factorisation Algorithms", Computing and Combinatorics, 2000, pp.3-22.
2. RSA Laboratories Crypto FAQ, "What is the discrete logarithm problem?", Section 2.3.7, http://www.rsasecurity.com/rsalabs, 2005.
3. W. Diffie and M. Hellman. "New directions in cryptography", IEEE Transactions on Information Theory, 22(6):644-654, Nov. 1976.
4. J. Großschädl, "Instruction Set Extension for Long Integer Modulo Arithmetic on RISC-Based Smart Cards", IEEE Computer Society, SBAC-PAD, 2002.
5. C. McIvor, M. McLoone, J.V. McCanny, "Modified Montgomery modular multiplication and RSA exponentiation techniques", Computers and Digital Techniques, IEE Proc.- Volume 151, Issue 6, 18 Nov. 2004 Page(s):402-408.
6. A.J. Menezes, P.C. van Oorschot and S.A. Vanstone, "Handbook of Applied Cryptography", CRC Press 1997.
7. T. Slum and C. Paar, "High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware", IEEE Transactions on Computers, Vol. 50, No. 7, July 2001.
8. A. F. Tenca, C. K. Koç, "A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm", IEEE Transactions on Computers, Vol. 52, No. 9, September 2003.
9. Hee-Kwan Son; Sang-Geun Oh , "Design and implementation of scalable low-power montgomery multiplier", Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings. IEEE International Conference on 11-13 Oct. 2004 pp:524-531.
10. R.L. Rivest, A. Shamir, L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM, 21(2), pp 120-126, February 1978.
11. OpenSSL, http://www.openssl.org/, April 2005.
12. RSAEuro, ftp://ftp.funet.fi/pub/crypt/cryptography/asymmetric/rsa/, April 2005.
13. G. Hachez, J-J. Quisquater, "Montgomery Exponentiation with no Final Subtraction: Improved Results", in Proceedings of Cryptographic Hardware and Embedded Systems, vol. 1965 of LNCS, pp. 293-301, Springer-Verlag, 2000.
14. A.J. Elbirt, C. Paar, "Towards an FPGA Architecture Optimised for Public-Key Algorithms", SPIE Symposium on Voice, Video and Communications, September 1999.