A fast software implementation for arithmetic operations in GF(2n)

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

Volumn 1163, Issue , 1996, Pages 65-76

  De Win, Erik ^a   Bosselaers, Antoon ^a   Vandenberghe, Servaas ^a   De Gersem, Peter ^a   Vandewalle, Joos ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; SECURITY OF DATA; TABLE LOOKUP;

ARITHMETIC OPERATIONS; COMPUTER MEMORY; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEMS; FIELD OPERATION; IRREDUCIBLE TRINOMIAL; OPTIMAL NORMAL BASIS; SOFTWARE IMPLEMENTATION;

CRYPTOGRAPHY;

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

References (15)

1. 2i55," IEEE Journal on Selected Areas in Communications, Vol. 11, no. 5 (June 1993), pp. 804-813.
2. nd)," IEEE Transactions on Computers, Vol. 42, no. 8 (1993), pp. 1010-1015.
3. [DD95] E. De Win and P. De Gersem, Studie en implementatie van arithmetische bewerkingen in GF(2nd), Master Thesis K. U. Leuven, 1995. (in Dutch).
4. [HMV92] G. Harper, A. Menezes and S. Vanstone, "Public-key cryptosystems with very small key lengths," Advances in Cryptology, Proc. Eurocrypt'92, LNCS 658, R. A. Rueppel, Ed., Springer-Verlag, 1993, pp. 163-173.
5. [K87] N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, Vol. 48, no. 177 (1987), pp. 203-209.
6. [LM95] R. Lercier and F. Morain, "Counting the number of points on elliptic curves over finite fields: strategies and performances," Advances in Cryptology, Proc. Eurocrypt'95, LNCS 921, L. C. Guillou and J. J. Quisquater, Eds., Springer-Verlag, 1995, pp. 79-94.
7. [LN83] R. Lidl and H. Niederreiter, Finite fields, Addison-Wesley, Reading, Mass., 1983.
8. [M93] A. Menezes, Elliptic curve public key cryptosystems, Kluwer Academic Publishers, 1993.
9. [M85] V. S. Miller, "Use of elliptic curves in cryptography," Advances in Cryptology, Proc. Crypto'85, LNCS 218, H. C. Williams, Ed., Springer-Verlag, 1985, pp. 417-426.
10. [MOVW88] R. Mullin, I. Onyszchuk, S. Vanstone and R. Wilson, "Optimal normal bases in GF(p)," Discrete Applied Mathematics, Vol. 22 (1988/89), pp. 149-161.
11. [MV96] A. Menezes and S. Vanstone, "Standard for RSA, Diffie-Hellman and related public key cryptography," Working draft of IEEE PI363 Standard, Elliptic Curve Systems, February 15, 1996.
12. [PH78] S. Pohlig and M. Heilman, "An improved algorithm for computing logarithms over GF(p) and its cryptographic significance," IEEE Transactions on Information Theory, Vol. 24 (1978), pp. 106-110.
13. [S85] R. Schoof, "Elliptic curves over finite fields and the computation of square roots mod p," Mathematics of Computation, Vol. 44 (1985), pp. 483-494.
14. [SOOS95] R. Schroeppel, H. Orman, S. O'Malley and O. Spatscheck, "Fast key exchange with elliptic curve systems," Advances in Cryptology, Proc. Crypto'95, LNCS 963, D. Coppersmith, Ed., Springer-Verlag, 1995, pp. 43-56.
15. [V96] S. Vandenberghe, Snelle basisbewerkingen voor publieke sleutelsystemen gebaseerd op elliptische curuen over GF(2nd), Master Thesis K. U. Leuven, 1995. (in Dutch).