Elliptic curve cryptosystems and their implementation

Journal of Cryptology

Volumn 6, Issue 4, 1993, Pages 209-224

  Menezes, Alfred J ^a   Vanstone, Scott A ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Elliptic curve cryptosystems; Implementation; Public key cryptography

Indexed keywords

ANALYSIS; COMPUTER SYSTEMS; MATHEMATICAL MODELS;

ELLIPTIC CURVE CRYPTOSYSTEMS; IMPLEMENTATION; PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 0027663154     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/BF00203817     Document Type: Article

References (30)

1. Arithmetic operations in GF(2m)
2. An implementation for a fast public-key cryptosystem
3. Improved digital signature scheme based on discrete exponentiation
4. Low complexity normal bases
5. Fast evaluation of logarithms in fields of characteristic two
6. Discrete logarithms in GF(p)
7. New directions in cryptography
8. A public key cryptosystem and a signature scheme based on discrete logarithms
9. A subexponential-time algorithm for computing discrete logarithms over GF(p2)
10. On using RSA with low exponent in a public key network
11. Elliptic curve cryptosystems
12. Constructing elliptic curve cryptosystems in characteristic 2
13. Elliptic curve implementation of zero-knowledge blobs
14. CM-curves with good cryptographic properties
15. Isomorphism classes of elliptic curves over finite fields of characteristic 2
16. 2mCounting points on elliptic curves over F
17. Uses of elliptic curves in cryptography
18. Speeding the Pollard and elliptic curve methods of factorization
19. (pnOptimal normal bases in GF)
20. Discrete logarithms and their cryptographic significance
21. An improved algorithm for computing logarithms over GF(p) and its crptographic significance
22. Efficient identification and signatures for smart cards
23. Elliptic curves over finite fields and the computation of square roots mod p