Scalable and unified hardware to compute montgomery inverse in GF(p) and GF(2n)

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

Volumn 2523, Issue , 2003, Pages 484-499

  Gutub, Adnan Abdul Aziz ^b   Tenca, Alexandre F ^a   Savaş, Erkay ^c   Koç, Çetin K ^a  

^a Oregon State University   (United States)

^b KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

^c SABANCI UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; CRYPTOGRAPHY; DESIGN; EMBEDDED SYSTEMS; HARDWARE;

CRYPTOGRAPHIC APPLICATIONS; FINITE FIELDS; INVERSE ALGORITHM; MONTGOMERY; MULTI-BITS; PRACTICAL SOLUTIONS; RECONFIGURABLE DESIGNS; UNIFIED ARCHITECTURE;

RECONFIGURABLE HARDWARE;

EID: 35248856053     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (19)

1. E. E. Savas and C. K. Koç. The Montgomery Modular Inverse - Revisited. IEEE Trans. on Computers, 49(7): 763-766, July 2000.
2. T. Kobayashi and H. Monta. Fast Modular Inversion Algorithm to Match Any Operation Unit. IEICE Trans. Fundamentals, E82-A(5):733-740, May 1999.
3. B. S. Kaliski. The Montgomery Inverse and its Applications. IEEE Trans, on Computers, 44(8): 1064-1065, Aug. 1995.
4. E. Savas, A. F. Tenca, and C. K. Koç. A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2). In Cryptographic Hardware and Embedded Systems, Lecture notes in Computer Science. Springer, Berlin, Germany, 2000.
5. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press: New York, 1999.
6. M. D. Ercegovac, T. Lang, and J. H. Moreno. Introduction to Digital System. John Wiley & Sons, Inc., New York, 1999.
7. P. Montgomery. Modular Multiplication without Trail Division. Mathematics of Computation, 44(170): 519-521, April 1985.
8. N. Takagi. Modular Inversion Hardware with a Redundant Binary Representation. IEICE Trans, on Information and Systems, E76-D(8): 863-869, Aug. 1993.
9. m). IEE Proceedings: Computers and Digital Techniques, 145(4): 272-278, July 1998.
10. m). Proceedings of the 7th IEEE International Conference on VLSI Design, Calcutta, India, January 5-8 1994.
11. Mentor Graphics Co., ASIC Design Kit, http://www.mentor.com/partners/hep/ AsicDesign Kit/dsheet/ami05data book.html
12. M. A. Hasan. Efficient Computation of Multiplicative Inverses for Cryptographic Applications. Proceeding of the 15th IEEE Symposium on Computer Arithmetic, June 2001.
13. m). IEEE Trans, on Computers, 38(10):1383-1386,Oct. 1989.
14. A. A.-A. Gutub, A. F. Tenca, and C. K. Koç. Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation. ISVLSI 2002: IEEE Computer Society Annual Symposium on VLSI, Pittsburgh, Pennsylvania, April 25-26 2002.
15. J. R. Michener and S. D. Mohan. Clothing the E-Emperor. IEEE Compute, 34(9):116-118, Sep. 2001.
16. J. Goodman and A. P. Chandrakasan. An Energy-Efficient Reconfigurable Public-Key Cryptogrphy Processor. IEEE Journal of Solid-State Circuits, 36(11):1808-1820, Nov. 2001.
17. D. Knuth. The Art of Computer Programming - Seminumerical Algorithms, 2nd ed. Vol. 2, Reading, MA: Addison-Wesley, 1981.
18. A. A.-A. Gutub and A. F. Tenca. A Scalable VLSI Architecture for Montgomery Inversion in GF(p). Submitted for publication in March 2002 to IEEE Trans, on VLSI.
19. n), Ph.D. thesis, Oregon State University, 2002.