Instruction set extensions for fast arithmetic in 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 3156, Issue , 2004, Pages 133-147

  Groschädl, Johann ^a   Savaş, Erkay ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b SABANCI UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; CURVE FITTING; EMBEDDED SYSTEMS; GEOMETRY; HARDWARE; PUBLIC KEY CRYPTOGRAPHY; RECONFIGURABLE HARDWARE;

APPLICATION SPECIFIC; ARITHMETIC OPERATIONS; CUSTOM INSTRUCTION; INSTRUCTION SET EXTENSION; PUBLIC KEY CRYPTOSYSTEMS; RISC ARCHITECTURE; SCALAR MULTIPLICATION; SOFTWARE IMPLEMENTATION;

REDUCED INSTRUCTION SET COMPUTING;

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

References (27)

1. American National Standards Institute. X9.62-1998, Public key cryptography for the financial services industry: The elliptic curve digital signature algorithm, 1999.
2. M. K. Brown et al. Software implementation of the NIST elliptic curves over prime fields. In Topics in Cryptology -CT-RSA 2001, LNCS 2020, pp. 250-265. Springer Verlag, 2001.
3. H. Cohen, A. Miyaji, and T. Ono. Efficient elliptic curve exponentiation using mixed coordinates. In Advances in Cryptology -ASIACRYPT '98, LNCS 1514, pp. 51-65. Springer Verlag, 1998.
4. P. G. Comba. Exponentiation cryptosystems on the IBM PC. IBM Systems Journal, 29(4):526-538, Oct. 1990.
5. J.-F. Dhem. Design of an efficient public-key cryptographic library for RISC-based smart cards. Ph.D. Thesis, Université Catholique de Louvain, Belgium, 1998.
6. J. Groβschädl and G.-A. Kamendje. Architectural enhancements for Montgomery multiplication on embedded RISC processors. In Applied Cryptography and Network Security -ACNS 2003, LNCS 2846, pp. 418-434. Springer Verlag, 2003.
7. m). In Proceedings of the 14th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP 2003), pp. 455-468. IEEE Computer Society Press, 2003.
8. D. Hankerson, J. López Hernandez, and A. J. Menezes. Software implementation of elliptic curve cryptography over binary fields. In Cryptographic Hardware and Embedded Systems -CHES 2000, LNCS 1965, pp. 1-24. Springer Verlag, 2000.
9. k). Designs, Codes and Cryptography, 14(1):57-69, Apr. 1998.
10. Ç. K. Koç, T. Acar, and B. S. Kaliski. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3):26-33, June 1996.
11. R. B. Lee. Accelerating multimedia with enhanced microprocessors. IEEE Micro, 15(2):22-32, Apr. 1995.
12. m) without precomputation. In Cryptographic Hardware and Embedded Systems, LNCS 1717, pp. 316-327. Springer Verlag, 1999.
13. 2m. In Progress in Cryptology -INDOCRYPT 2000, LNCS 1977, pp. 203-212. Springer Verlag, 2000.
14. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
15. MIPS Technologies, Inc. MIPS32 4Km Processor Core Datasheet. Available for download at http://www.mips.com/publications/index.html, Sept. 2001.
16. MIPS Technologies, Inc. MIPS32 Architecture for Programmers. Available for download at http://www.mips.com/publications/index.html, Mar. 2001.
17. MIPS Technologies, Inc. SmartMIPS Architecture Smart Card Extensions. Product brief, available for download at http://www.mips.com, Feb. 2001.
18. MIPS Technologies, Inc. 64-bit architecture speeds RSA by 4x. White Paper, available for download at http://www.mips.com, June 2002.
19. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, Apr. 1985.
20. E. M. Nahum et al. 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.
21. National Institute of Standards and Technology. Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186-2, 2000.
22. The Open SystemC Initiative (OSCI). SystemC Version 2.0 User's Guide, 2002.
23. B. J. Phillips and N. Burgess. Implementing 1,024-bit RSA exponentiation on a 32-bit processor core. In Proceedings of the 12th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP 2000), pp. 127-137. IEEE Computer Society Press, 2000.
24. m). In Cryptographic Hardware and Embedded Systems -CHES 2000, LNCS 1965, pp. 277-292. Springer Verlag, 2000.
25. R. Schroeppel et al. Fast key exchange with elliptic curve systems. In Advances in Cryptology -CRYPTO '95, LNCS 963, pp. 43-56. Springer Verlag, 1995.
26. J. A. Solinas. Generalized Mersenne numbers. Technical Report CORR-99-39, University of Waterloo, Canada, 1999.
27. STMicroelectronics. ST22 SmartJ Platform Smartcard ICs. Available online at http://www.st.com/stonline/products/families/smartcard/insc9901.htm.