Efficient algorithms for elliptic curve cryptosystems

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

Volumn 1294, Issue , 1997, Pages 342-356

  Guajardo, Jorge ^a   Paar, Christof ^a  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; CURVE FITTING; GEOMETRY; TABLE LOOKUP;

COMPUTATIONAL ADVANTAGES; EFFICIENT IMPLEMENTATION; ELLIPTIC CURVE CRYPTOSYSTEMS; ELLIPTIC CURVE SYSTEM; KARATSUBA-OFMAN ALGORITHM; NUMBER OF INVERSIONS; SLIDING WINDOW METHODS; SOFTWARE IMPLEMENTATION;

ALGORITHMS;

EID: 84958670390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052247     Document Type: Conference Paper

References (22)

1. D. Beauregard. Efficient algorithms for implementing elliptic curve public-key schemes. Master's thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, MA, May 1996.
2. H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin, 1993.
3. R.J. Fateman. Polynomial multiplication, powers and asymptotic analysis: Some comments. SIAM J. Comput., 7(3):196-21, September 1974.
4. J. Guajardo. Efficient algorithms for elliptic curve cryptosystems. Master's thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, MA, May 1997.
5. G. Harper, A. Menezes, and S. Vanstone. Public-key cryptosystems with very small key lengths. In Advances in Cryptology — EUROCRYPT '92, pages 163-173, May 1992.
6. T. Itoh and S. Tsujii. A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Information and Computation, 78:171-177, 1988.
7. D.E. Knuth. The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Addison-Wesley, Reading, Massachusetts, 2nd edition, 1981.
8. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203-209, 1987.
9. N. Koblitz. Constructing elliptic curve cryptosystems in characteristic 2. In Advances in Cryptology — CRYPTO '90, pages 156-167. Springer-Verlag, Berlin, 1991.
10. C. K. Koc. Analysis of sliding window techniques for exponentiation. Computers and Mathematics with Applications, 30(10):17-24, November 1995.
11. J. Koeller, A. Menezes, M. Qu, and S. Vanstone. Elliptic Curve Systems. Draft 8, IEEE P1363 Standard for RSA, Diffie-Hellman and Related Public-Key Cryptography, May 1996. working document.
12. R. Lidl and H. Niederreiter. Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications. Addison-Wesley, Reading, Massachusetts, 1983.
13. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, Florida, 1997.
14. A. J. Menezes, S. A. Vanstone, and R. J. Zuccherato. Counting points on elliptic curves over F2".. Mathematics of Computation, 60(201):407-420, January 1993.
15. A.J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
16. V. Miller. Uses of elliptic curves in cryptography. In Advances in Cryptology — CRYPTO '85, pages 417-426. Springer-Verlag, Berlin, 1986.
17. C Paar. Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields. PhD thesis, (Engl, transl.), Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1994.
18. C Paar. Some remarks on efficient inversion in finite fields. In 1995 IEEE International Symposium on Information Theory, page 58, Whistler, B.C. Canada, September 17-22 1995.
19. C. Paar. A new architecture for a parallel finite field multiplier with low complexity based on composite fields. IEEE Transactions on Computers, 45(7):856-861, July 1996.
20. C. Paar and P. Soria-Rodriguez. Fast arithmetic architectures for public-key algorithms over galois fields OF((2n)m), In Advances in Cryptology — EUROCRYPT '97, pages 363-378, 1997.
21. R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck. Fast key exchange with elliptic curve systems. Advances in Cryptology, Crypto 95, pages 43-56, 1995.
22. E. De Win, A. Bosselaers, S. Vandenberghe, P. De Gersem, and J. Vandewalle. A fast software implementation for arithmetic operations in GF(2n). In Asiacrypt '96. Springer Lecture Notes in Computer Science, 1996.