An adaptable and scalable asymmetric Cryptographic processor

Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

Volumn , Issue , 2006, Pages 341-346

  Smyth, Neil ^a   McLoone, Máire ^a   McCanny, John V ^a  

^a QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; POLYNOMIALS; PROGRAM PROCESSORS; SCALABILITY;

FIELD ARITHMETIC; MODULAR EXPONENTIATION; PUBLIC-KEY PROCESSOR;

CRYPTOGRAPHY;

EID: 34547423255     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASAP.2006.8     Document Type: Conference Paper

References (18)

1. N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol. 48, pp. 203209, 1987.
2. V. Miller, "Use of elliptic curves in cryptography," CRYPTO 85, 1985.
3. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, vol. 44, no. 170, pp. 519-521, 1985.
4. P. Barrett, Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor, in Advances In Cryptology CRYPTO 86 (LNCS 263) (A. M. Odlyzko, ed.), pp. 311323, 1987.
5. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996. http://www.cacr.math.uwaterloo.ca/hac/.
6. N. Smyth, M. McLoone and J. McCanny, "Reconfigurable Processor for Public-Key Cryptography", SIPS 2005, Proceedings, IEEE International Conference on 2-4 November 2005, pp. 110-115.
7. B. S. Kaliski Jr., T he Montgomery inverse and its applications, IEEE Transactions on Computers, 44(8), pp. 10641065, Aug 1995.
8. PKCS #1: RSA Cryptography Standard, www.rsasecurity.com/rsalabs/pkcs/ pkcs-1/, March 2006.
9. D. Knuth. The Art of Computer Programming, Volume 2: Seminumerical
10. Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89684-2. Section 4.5.4: Factoring into Primes, pp. 379417.
11. Discrete logarithm, Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/Discrete_logarithm, March 2006.
12. W. Diffie and M. E. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory, vol. IT-22, Nov. 1976, pp. 644-654.
13. M. Rosing, Implementing Elliptic Curve Cryptography, K. Antonsen, Ed. Manning Publications Co., 1999.
14. A. Karatsuba and Y. Ofman, "Multiplication of Many-Digital Numbers by Automatic Computers," Doklady Akad. Nauk SSSR 145, 293-294, 1962. Translation in Physics-Doklady 7, 595-596, 1963.
15. A. F. Tenca and C. K. Koç, A Scalable Architecture for Modular Multiplication Based on Montgomerys Algorithm, IEEE Transactions on Computers, Vol. 52, No. 9, September 2003.
16. Hee-Kwan Son and 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.
17. A. Satoh and K. Takano, "A Scalable Dual-Field Elliptic Curve Cryptographic Processor," IEEE Trans. Computers, vol. 52, pp. 449-460, 2003.
18. J. Goodman and A. P. Chandrakasan, "An energy efficient reconfigurable public-key cryptography processor architecture," In Proceedings of 2nd International Workshop on Cryptographic Hardware and Embedded Systems (CHES), number 1965 in Lecture Notes in Computer Science, pages 174-191, Worcester, Massachusetts, USA, August 17-18 2000. Springer-Verlag.