A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m)

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

Volumn 1965, Issue , 2000, Pages 277-292

  Savaş, Erkay ^a   Tenca, Alexandre F ^a   Koç, Çetin K ^a  

^a Oregon State University   (United States)

Author keywords

Binary extension fields; Hardware implementation; Montgomery multiplication; Multiplication; Prime fields; Scalability

Indexed keywords

COMPUTER ARCHITECTURE; CRYPTOGRAPHY; HARDWARE; SCALABILITY;

BINARY EXTENSION FIELDS; HARDWARE IMPLEMENTATIONS; MONTGOMERY MULTIPLICATION; MULTIPLICATION; PRIME FIELD;

EMBEDDED SYSTEMS;

EID: 68549115194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (21)

1. G. B. Agnew, R. C. Mullin, and S. A. Vanstone. An implementation of elliptic curve cryptosystems over F2155. IEEE Journal on Selected Areas in Communications, 11(5):804-813, June 1993.
2. A. Bernal and A. Guyot. Design of a modular multiplier based on Montgomery's algorithm. In 13th Conference on Design of Circuits and Integrated Systems, pages 680-685, Madrid, Spain, November 17-20 1998.
3. W. Di_e and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, November 1976.
4. S. E. Eldridge and C. D. Walter. Hardware implementation of Montgomery's modular multiplication algorithm. IEEE Transactions on Computers, 42(6):693-699, June 1993.
5. Steve Furber. ARM System Architecture. Addison-Wesley, Reading, MA, 1997.
6. B. S. Kaliski Jr. The Montgomery inverse and its applications. IEEE Transactions on Computers, 44(8):1064-1065, August 1995.
7. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203-209, January 1987.
8. Ç. K. Koç. High-Speed RSA Implementation. Technical Report TR 201, RSA Laboratories, 73 pages, November 1994.
9. Ç. K. Koç and T. Acar. Montgomery multiplication in GF(2k). Designs, Codes and Cryptography, 14(1):57-69, April 1998.
10. Ç. K. Koç, T. Acar, and B. S. Kaliski Jr. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3):26-33, June 1996.
11. P. Kornerup. High-radix modular multiplication for cryptosystems. In E. Swartzlander, Jr., M. J. Irwin, and G. Jullien, editors, Proceedings, 11th Symposium on Computer Arithmetic, pages 277-283, Windsor, Ontario, June 29-July 2 1993. IEEE Computer Society Press, Los Alamitos, CA.
12. A. J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston, MA, 1993.
13. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, April 1985.
14. D. Naccache and D. M'Raïhi. Cryptographic smart cards. IEEE Micro, 16(3):14-24, June 1996.
15. National Institute for Standards and Technology. Digital Signature Standard (DSS). FIPS PUB 186-2, January 2000.
16. H. Orup. Simplifying quotient determination in high-radix modular multiplication. In S. Knowles and W. H. McAllister, editors, Proceedings, 12th Symposium on Computer Arithmetic, pages 193-199, Bath, England, July 19-21 1995. IEEE Computer Society Press, Los Alamitos, CA.
17. J.-J. Quisquater and C. Couvreur. Fast decipherment algorithm for RSA publickey cryptosystem. Electronics Letters, 18(21):905-907, October 1982.
18. A. Royo, J. Moran, and J. C. Lopez. Design and implementation of a coprocessor for cryptography applications. In European Design and Test Conference, pages 213-217, Paris, France, March 17-20 1997.
19. E. Savaş and Ç. K. Koç. The Montgomery modular inverse-revisited. IEEE Transactions on Computers, 49(8), July 2000. To appear.
20. A. F. Tenca and Ç. K. Koç. A scalable architecture for Montgomery multiplication. In Ç. K. Koç and C. Paar, editors, Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science, No. 1717, pages 94-108. Springer, Berlin, Germany, 1999.
21. C. D. Walter. Space/Time trade-offs for higher radix modular multiplication using repeated addition. IEEE Transactions on Computers, 46(2):139-141, February 1997.