Efficient implementation of elliptic curve cryptosystems on the TI MSP430x33x family of microcontrollers

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

Volumn 1992, Issue , 2001, Pages 365-382

  Guajardo, Jorge ^a   Blümel, Rainer ^b   Krieger, Uwe ^b   Paar, Christof ^a  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

^b cv Cryptovision Gmbh   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; COSTS; EMBEDDED SYSTEMS; GEOMETRY; MICROCONTROLLERS;

ACCEPTABLE PERFORMANCE; EFFICIENT IMPLEMENTATION; ELLIPTIC CURVE CRYPTOSYSTEMS; ELLIPTIC CURVE SYSTEM; EXPONENTIATIONS; GENERALIZED MERSENNE PRIME; POINT ADDITIONS; SCALAR POINT MULTIPLICATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84937438994     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44586-2_27     Document Type: Conference Paper

References (34)

1. ANSI X9.62-1-xxxx. Public Key Cryptography for the Financial Services Industry: the Ellip tic Curve Digital Signature Algorithm (ECDSA) (Revised). Technical report, American Bankers Association, October 1999.
2. ANSI X9.62-1999. The Elliptic Curve Digital Signature Algorithm. Technical report, ANSI, 1999.
3. D. V. Bailey and C. Paar. Optimal Extension Fields for Fast Arithmetic in Public- Key Algorithms. In H. Krawczyk, editor, Advances in Cryptology — CRYPTO’98, volume LNCS 1462, pages 472–485, Berlin, Germany, 1998. Springer-Verlag.
4. D. V. Bailey and C. Paar. Inversion in Optimal Extension Fields. In A. Odlyzko, G. Walsh, and H. Williams, editors, Conference on The Mathematics of Public Key Cryptography, The Fields Institute for Research in the Mathematical Sciences, Toronto, Canada, June 1999.
5. P. Barrett. Implementingthe Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. In A. M. Odlyzko, editor, Advances in Cryptology – CRYPTO’86, volume LNCS 263, pages 311–323, Berlin, Germany, August 1986. Springer-Verlag.
6. G. Borriello and R. Want. Embedded computation meets the world wide web. Communications of the ACM, 43(5):59–66, May 2000.
7. Ç. K. Koç, T. Acar, and B. Kaliski. Analyzingand ComparingMon tgomery Multiplication Algorithms. IEEE Micro, pages 26–33, June 1996.
8. D.V. Chudnovsky and G.V. Chudnovsky. Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Advances in Applied Mathematics, 7:385–434, 1986.
9. Jae Wook Chung, Sang Gyoo Sim, and Pil Joong Lee. Fast Implementation of Elliptic Curve Defined over GF(pm) on CalmRISC with MAC2424 Coprocessor. In Çetin K. Koç and Christof Paar, editors, Workshop on Cryptographic Hardware and Embedded Systems — CHES 2000, pages 57–70, Berlin, 2000. Springer-Verlag.
10. Henry Cohen, Atsuko Miyaji, and Takatoshi Ono. Efficient Elliptic Curve Exponentiation UsingMixed Coordinates. In Kazuo Ohta and Dingyi Pei, editors, Advances in Cryptology — ASIACRYPT’98, volume LNCS 1514, pages 51–65, Berlin, 1998. Springer-Verlag.
11. S. R. Dussé and B. S. Kaliski. A Cryptographic Library for the Motorola DSP56000. In I. B. Damgård, editor, Advances in Cryptology — EUROCRYPT’90, volume LNCS 473, pages 230–244, Berlin, Germany, May 1990. Springer-Verlag.
12. D. Estrin, R. Govindan, and J. Heidemann. Embeddingthe Internet. Communications of the ACM, 43(5):39–41, May 2000.
13. D. M. Gordon. A survey of fast exponentiation methods. Journal of Algorithms, 27:129–146, 1998.
14. J. Guajardo and C. Paar. Efficient Algorithms for Elliptic Curve Cryptosystems. In B. Kaliski, editor, Advances in Cryptology — CRYPTO’97, volume LNCS 1294, pages 342–356, Berlin, Germany, August 1997. Springer-Verlag.
15. R. Harley, D. Doligez, D. de Rauglaudre, and X. Leroy. http://cristal.inria.fr/%7Eharley/ecdl7/.
16. Toshio Hasegawa, Junko Nakajima, and Mitsuru Matsui. A Practical Implementation of Elliptic Curve Cryptosystems over GF(p) on a 16-bit Microcomputer. In Hideki Imai and YuliangZheng, editors, First International Workshop on Practice and Theory in Public Key Cryptography — PKC’98, volume LNCS 1431, pages 182–194, Berlin, 1998. Springer-Verlag.
17. K. Itoh, M. Takenaka, N. Torii, S. Temma, and Y. Kurihara. Fast Implemenation of Public-Key Cryptography on a DSP TMS320C6201. In Çetin K. Koç and Christof Paar, editors, Proceedings of the First Workshop on Cryptographic Hardware and Embedded Systems — CHES’99, volume LNCS 1717, pages 61–72, Berlin, Germany, August 1999. Springer-Verlag.
18. T. Itoh and S. Tsujii. A fast algorithm for computing multiplicative inverses in GF(2m) usingnormal bases. Information and Computation, 78:171–177, 1988.
19. D. E. Knuth. The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Addison-Wesley, Reading, Massachusetts, USA, 2nd edition, 1981.
20. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203–209, 1987.
21. Arjen Lenstra and Eric Verheul. Selectingcryptog raphic key sizes. In Hideki Imai and YuliangZheng, editors, Third International Workshop on Practice and Theory in Public Key Cryptography — PKC 2000, volume LNCS 1751, Berlin, 2000. Springer-Verlag.
22. Chae Hoon Lim and Hyo Sun Hwang. Fast Implementation of Elliptic Curve Arithmetic in GF(pn). In Hideki Imai and YuliangZheng, editors, Third International Workshop on Practice and Theory in Public Key Cryptography — PKC 2000, volume LNCS 1751, pages 405–421, Berlin, 2000. Springer-Verlag.
23. A. J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston, Massachusetts, USA, 1993.
24. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, Florida, USA, 1997.
25. V. Miller. Uses of elliptic curves in cryptography. In H. C. Williams, editor, Advances in Cryptology — CRYPTO’85, volume LNCS 218, pages 417–426, Berlin, Germany, 1986. Springer-Verlag.
26. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519–521, April 1985.
27. U.S. Department of Commerce/National Institute of Standard and Technology. Digital Signature Standard (DSS), January 27 2000.
28. National Institute of Standard and Technology. Recommended elliptic curves for federal government use. available at http://csrc.nist.gov/encryption, May 1999.
29. IEEE P1363 Standard Specifications for Public Key Cryptography, November 1999. Last Preliminary Draft.
30. R. Schroeppel, H. Orman, S. O’Malley, and O. Spatscheck. Fast key exchange with elliptic curve systems. In D. Coppersmith, editor, Advances in Cryptology — CRYPTO’95, volume LNCS 963, pages 43–56, Berlin, Germany, 1995. Springer- Verlag.
31. Standards for Efficient Cryptography Group. SEC2: Recommended Elliptic Curve Domain Parameters. Workingdraft, version 0.7, September 2000.
32. Texas Instruments, Inc., Dallas, Texas 75265 USA. MSP430C33x, MSP430P337A Mixed Signal Microcontrollers, October 1999 (Revised June 2000).
33. Texas Instruments, Inc., Dallas, Texas 75265 USA. MSP430x3xx Family – User’s Guide, July 2000.
34. A. Woodbury, D. V. Bailey, and C. Paar. Elliptic curve cryptography on smart cards without coprocessors. In IFIP CARDIS 2000, Fourth Smart Card Research and Advanced Application Conference, Bristol, UK, September 20–22 2000. Kluwer.