Architectures for unified field inversion with applications in elliptic curve cryptography

Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems

Volumn 3, Issue , 2002, Pages 1155-1158

  Savag, Erlcay ^a   Kog, Çetin K ^b  

^a SABANCI UNIVERSITY   (Turkey)

^b OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT IMPLEMENTATION; ELLIPTIC CURVE CRYPTOGRAPHY; FIELD INVERSION; HARDWARE ARCHITECTURE; INVERSE ALGORITHM; INVERSION ALGORITHM; MONTGOMERY; MULTI-WORD; PRIME FIELD; PROPOSED ARCHITECTURES; UNIFIED ARCHITECTURE;

CRYPTOGRAPHY;

ALGORITHMS;

EID: 70449505670     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICECS.2002.1046457     Document Type: Conference Paper

References (12)

1. J.-J. Quisquater and C. Couvreur, "Fast decipherment algorithm for RSA public-key cryptosystem," Electronics Letters, vol.18, no.21, pp. 905-907, Oct. 1982.
2. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Transactions on Infomation Theory, vol. 22, pp. 644-654, Nov. 1976.
3. National Institute for Standards and Technology, "Digital signature standard (DSS)," Federal Register, vol.56, pp. 169, Aug. 1991.
4. N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol.48, no.177, pp. 203-209, Jan. 1987.
5. A. J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, Boston, MA, 1993.
6. B. S. Kaliski Jr., "The Montgomery inverse and its applications," IEEE Transactions on Computers, vol.44, no.8, pp. 1064-1065, Aug. 1995.
7. R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck, "Fast key exchange with elliptic curve systems," in Advances in Cryptology - CRYPT0 95, D. Coppersmith, Editor,Lecture Notes in Computer Science, No.973, pp. 43-56, Springer, Berlin, Germany, 1995.
8. T. Kobayashi and H. Morita, "Fast modular inversion algorithm to match any operand unit," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E82-A, no.5, pp. 733-740, May 1999.
9. E. Savaş and Ç. K. Koç, "The Montgomery modular inverse - revisited," IEEE Transactions on Computers, vol.49, no.7, pp. 763-766, July 2000.
10. M. A. Hasan, "Efficient computation of multiplicative inverses for cryptographic applications," Technical Report CORR 200143, Centre for Applied Cryptographic Research, University of Waterloo, Canada, 2001.
11. E. Savş, A. F. Tenca, and Ç. K. Koç, "A scalable and unified multiplier architecture for finite fields GF(p) and GF(Zm)," in Cryptographic Hardware and Embedded Systems - CHES 6000, Ç. K. Koq and C. Paar, Editors, Lecture Notes in Computer Science No. 1965, pp. 281-296, Springer, Berlin, Germany, 2000.
12. J. López and R. Dahab, "Fast multiplication on elliptic curves over GF(2m) without precomputation," in Cryptographic Hardware and Embedded Systems, Ç. K. Kos and C. Paar, Editors, Lecture Notes in Computer Science, No.1717, pp. 316-325, Springer, Berlin, Germany, 1999