Elliptic curve cryptography on a palm os device

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

Volumn 2119, Issue , 2001, Pages 502-513

  Weimerskirch, André ^a   Paar, Christof ^a   Shantz, Sheueling Chang ^b  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

Binary fields; Elliptic curves; Koblitz curves; Palm OS

Indexed keywords

BINS; CRYPTOGRAPHY; GEOMETRY; MOBILE DEVICES; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

BINARY FIELDS; COMMERCIAL APPLICATIONS; COMMERCIAL TRANSACTIONS; DIFFIE-HELLMAN KEY EXCHANGE; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY; KOBLITZ CURVES; PERSONAL DIGITAL ASSISTANTS (PDA);

PERSONAL DIGITAL ASSISTANTS;

EID: 84958764449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47719-5_39     Document Type: Conference Paper

References (20)

1. I. Blake, G. Seroussi and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press, Cambridge, 1999.
2. M. Brown, D. Cheung, D. Hankerson, J. L. Hernandez, M. Kirkup, and A. M enezes. PGP in Constrained Wireless Devices. Proceedings of the 9th USENIX Security Symposium, 2000.
3. N. Daswani and D. Boneh. Experimenting with Electronic Commerce on the Palm Pilot. Financial Cryptography’99, LNCS 1648, Springer-Verlag, 1-16, 1999.
4. D. Hankerson, J. L. Hernandez and A. Menezes. Software Implementation of Elliptic Curve Cryptography Over Binary Fields. Cryptographic Hardware and Embedded Systems, CHES 2000, LNCS 1965, Springer-Verlag, 1-24, 2000.
5. IEEE P1363, Standard Specifications for Public-Key Cryptography, 2000.
6. N. Koblitz. CM-curves with good cryptographic properties. Advances in Cryptology–CRYPTO’91, LNCS 576, Springer-Verlag, 279-287, 1992.
7. D. E. Knuth. Seminumerical Algorithms. Addision-Wesley, 1981.
8. K. Koyama and Y. Tsuruoka. Speeding up elliptic curve cryptosystems by using a signed binary window method. Advances in Cryptology–Crypto’92, LNCS 740, Springer-Verlag, 345-357, 1993.
9. C. Lim and P. Lee. More flexible exponentiation with precomputation. Advances in Cryptology-Crypto’94, LNCS 839, Springer-Verlag, 95-107, 1994.
10. J. López and R. Dahab. Improved Algorithms for Elliptic Curve Arithmetic in GF(2n). Selected Areas in Crytography-SAC’98, LNCS 1556, Springer-Verlag, 201-212, 1999.
11. J. López and R. Dahab. Fast multiplication on Elliptic Curves over GF(2n) without Precomputation, Cryptographic Hardware and Embedded Systems-CHES’99, LNCS 1717, Springer-Verlag, 316-327, 1999.
12. J. López and R. Dahab. High-Speed Software Multiplication in IF2m, IC Technical Reports, IC-00-09, Institute of Computing, University of Campinas, May 2000, Available from http://www. dcc. unicamp. br/ic-main/publications-e.html.
13. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
14. F. Morain and J. Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Informatique théorique et Applications, 24, 531-544, 1990.
15. Motorola. M68000 8-/16-/32-Bit Microprocessors User’s Manual, Ninth Edition.
16. National Institute of Standards and Technolgy. Recommended Elliptic Curves for Federal Government Use, May 1999, available from http://csrc. nist. gov/encryption.
17. R. Schroeppel, H. Orman, S. O’Malley and O. Spatscheck. Fast Key Exchange with Elliptic Curve Systems. Advances in Cryptology-Crypto’95, LNCS 963, Springer-Verlag, 43-56, 1995.
18. S. Shantz. From Euclid’s GCD to Montgomery Multiplication to the Great Divide, preprint, 2000.
19. J. A. Solinas. Efficient Arithmetic on Koblitz Curves. Designs, Codes and Cryptography, 19(2/3), 195-249, 2000.
20. M. Wiener and R. Zuccherato. Faster attacks on elliptic curve cryptosystems. Selected Areas in Cryptography, LNCS 1556, Springer-Verlag, 190-200, 1999.