Instruction set extension for fast elliptic curve cryptography over binary finite fields GF(2m)

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

Volumn 2003-January, Issue , 2003, Pages 455-468

  Großschädl, Johann ^a   Kamendje, Guy Armand ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

GENERAL PURPOSE COMPUTERS; GEOMETRY; POLYNOMIALS; PUBLIC KEY CRYPTOGRAPHY; REDUCED INSTRUCTION SET COMPUTING; SMART CARDS;

BINARY FINITE FIELDS; ELLIPTIC CURVE CRYPTOGRAPHY; GENERAL PURPOSE PROCESSORS; INSTRUCTION SET EXTENSION; MULTIPLE PRECISION ARITHMETIC; POLYNOMIAL ARITHMETIC; SINGLE-PRECISION MULTIPLICATION; SOFTWARE IMPLEMENTATION;

MULTIPLYING CIRCUITS;

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

References (28)

1. American National Standards Institute (ANSI). X9.62-1998, Public key cryptography for the financial services industry: The elliptic curve digital signature algorithm (ECDSA), Jan. 1999.
2. I. F. Blake, G. Seroussi, and N. P. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999.
3. Certicom Corporation. The elliptic curve cryptosystem for smart cards. White Paper, available for download at http://www.certicom.com/resources/download/ECC-SC.pdf, Apr. 1998.
4. P. G. Comba. Exponentiation cryptosystems on the IBM PC. IBM Systems Journal, 29(4):526-538, Oct. 1990.
5. m) on digital signal processors. In Proceedings of the 22nd IEEE Int. Conference on Acoustics, Speech, and Signal Processing (ICASSP '97), pp. 631-634. IEEE, 1997.
6. A. M. Fiskiran and R. B. Lee. Workload characterization of elliptic curve cryptography and other network security algorithms for constrained environments. In Proceedings of the 5th Annual IEEE Workshop on Workload Characterization (WWC-5), pp. 127-137. IEEE, 2002.
7. J. R. Goodman. Energy Scalable Reconfigurable Cryptographic Hardware for Portable Applications. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 2000.
8. J. R. Goodman and A. P. Chandrakasan. An energy efficient reconfigurable public-key cryptography processor architecture. In Cryptographic Hardware and Embedded Systems-CHES 2000, pp. 175-190. Springer Verlag, 2000.
9. J. Großschädl. Instruction set extension for long integer modulo arithmetic on RISC-based smart cards. In Proceedings of the 14th Int. Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2002), pp. 13-19. IEEE Computer Society Press, 2002.
10. J. Großschädl. A unified radix-4 partial product generator for integers and binary polynomials. In Proceedings of the 35th IEEE Int. Symposium on Circuits and Systems (ISCAS 2002), pp. 567-570, IEEE, 2002.
11. N. Gura, H. Eberle, and S. Chang Shantz. Generic implementations of elliptic curve cryptography using partial reduction. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS 2002), pp. 108-116. ACM Press, 2002.
12. Y. Han, P.-C. Leong, P.-C. Tan, and J. Zhang. Fast algorithms for elliptic curve cryptosystems over binary finite field. In Advances in Cryptology-ASIACRYPT '99, pp. 75-85. Springer Verlag, 1999.
13. D. R. Hankerson, J. C. Lopez Hernandez, and A. J. Menezes. Software implementation of elliptic curve cryptography over binary fields. In Cryptographic Hardware and Embedded Systems-CHES 2000, pp. 1-24. Springer Verlag, 2000.
14. M. A. Hasan. Look-up table-based large finite field multiplication in memory constrained cryptosystems. IEEE Transactions on Computers, 49(7):749-758, July 2000.
15. Infineon Technologies AG. SLE 66CL160S short product information. Available for download at http://www. inf ineon. com, Dec. 2001.
16. D. E. Knuth. Seminumerical Algorithms, vol. 2 of The Art of Computer Programming. Addison-Wesley, 1998.
17. Ç. K. Koç and T. Acar. Montgomery multiplication in GF(2∗). Designs, Codes and Cryptography, 14(1):57-69, Apr. 1998.
18. R. Lidl and H. Niederreiter. Finite Fields. Cambridge University Press, 1996.
19. m) without precomputation. In Cryptographic Hardware and Embedded Systems-CHES '99, pp. 316-327. Springer Verlag, 1999.
20. J. C. Lopez Hernandez and R. Dahab. High-speed software multiplication in D. In Progress in Cryptology-INDOCRYPT 2000, pp. 203-212. Springer Verlag, 2000.
21. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
22. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, Apr. 1985.
23. P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243-264, Jan. 1987.
24. E. M. Nahum, S. W. O'Malley, H. K. Orman, and R. C. Schroeppel. Towards high performance cryptographic software. In Proceedings of the 3rd IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems (HPCS '95), pp. 69-72. IEEE, 1995.
25. National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). Federal Information Processing Standards (FIPS) Publication 186-2, Feb. 2000.
26. m). In Cryptographic Hardware and Embedded Systems-CHES 2000, pp. 277-292. Springer Verlag, 2000.
27. R. C. Schroeppel, H. K. Orman, S. W. O'Malley, and O. Spatscheck. Fast key exchange with elliptic curve systems. In Advances in Cryptology-CRYPTO '95, pp. 43-56. Springer Verlag, 1995.
28. N. P. Smart. A comparison of different finite fields for elliptic curve cryptosystems. Computers and Mathematics with Applications, 42(1-2):91-100, July 2001.