On the implementation of elliptic curve cryptosystems

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

Volumn 435 LNCS, Issue , 1990, Pages 186-192

  Bender, Andreas ^a   Castagnoli, Guy ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ALGEBRAIC GROUP; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEMS; GROUP OPERATIONS; PRACTICAL USE; PRIME FACTORS;

CRYPTOGRAPHY;

EID: 84957375980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/0-387-34805-0_18     Document Type: Conference Paper

References (9)

1. Grosswald, Emil. Topics from the Theory of Numbers. Birkhaeuser Boston 1984.
2. Hartshorne, Robin. Algebraic Geometry. Springer New York 1983.
3. Husemoeller, Dale. Elliptic Curves. Springer New York 1987.
4. Kaliski Burton S. Jr., “A Pseudo-Random Bit Generator Based on Elliptic Logarithms”. Advances in Cryptography: Proceedings of CRYPTO’ 86. Andrew M. Odlyzko, Ed. Springer 1987. pp. 84-100.
5. Koblitz, Neal. A Course in Number Theory and Cryptography. Springer New York 1987.
6. Lidl, Rudolf; Niederreiter, Harald. Finite Fields. Addison-Wesley Massachusetts 1983.
7. Massey, James L.“Logarithms in Finite Cyclic Groups-Cryptographic Issues”. Proc. 4th Benelux Symposion on Information Theory, Leuven, Belgium. May 1983, pp.17-25.
8. Miller, Victor. “Use of Elliptic Curves in Cryptography”. Advances in Cryptography: Proceedings of CRYPTO’ 85. H.C. Williams, Ed. Springer 1986. pp. 417-426.
9. Schoof, Rene. “Elliptic Curves over Finite Fields and the Computation of Square Roots mod p”. Mathematics of Computation, vol.44 (1985), pp. 483-494.