An identification scheme based on the elliptic curve discrete logarithm problem

Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

Volumn 2, Issue , 2000, Pages 624-625

  Popescu, C ^a  

^a UNIVERSITY OF ORADEA   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ELLIPTIC CURVE; ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEMS; IDENTIFICATION SCHEME; INTERACTIVE IDENTIFICATION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 37749025473     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPC.2000.843508     Document Type: Conference Paper

References (15)

1. T. Beth. Efficient zero knowledge identification scheme for smart cards. Proceedings of Eurocrypt '88 LNCS, Springer-Verlag, 330:77-86, 1988.
2. U. Feige, A. Fiat, and A. Shamir. Zero knowledge proofs of identity. Proceedings of STOC, pages 210-217, 1987.
3. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. Proceedings of CRYPTO '86 LNCS, Springer-Verlag, 263:186-194, 1987.
4. G. Frey and H. Ruck. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation, 67:353-356, 1998.
5. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proofs. SIAM J. Comput., 18(1):186-208, 1989.
6. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203-209, 1987.
7. N. Koblitz. Cm-curves with good cryptographic properties. Proceedings of Crypto'91, 1992.
8. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, 39:1639-1646, 1993.
9. V. Miller. Uses of elliptic curves in cryptography. Proceedings of Crypto'85, LNCS, Springer-Verlag, 218:417-426, 1986.
10. K. Ohta and T. Okamoto. A modification of the fiat-shamir scheme. Proceedings of Crypto'88, LNCS, Springer-Verlag, 403:232-243, 1990.
11. S. Pohling and M. Hellman. An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106-110, 1978.
12. J. Pollard. Monte carlo methods for index computation mod p. Mathematics of Computation, 32:918-924, 1978.
13. C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.
14. I. Semaev. Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Mathematics of Computation, 67:353-356, 1998.
15. N. Smart. The discrete logarithms problem on elliptic curves of trace one. preprint, 1997.