A method of solution of the problem of taking the discrete logarithm on an elliptic curve by division of points by two

Cybernetics and Systems Analysis

Volumn 37, Issue 6, 2001, Pages 820-823

  Bessalov, A V ^a  

^a Military Institute of Telecommunication and Information Technology   (Ukraine)

Author keywords

Abelian group of points; Discrete logarithm problem; Elliptic curve; Taking logarithms by division by t vo

Indexed keywords

EID: 33747020591     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1023/A:1014525713965     Document Type: Article

References (7)

1. Current Public-Key Cryptographic Systems, in: A Certicom Whitepaper, Certicom (1997), pp. 1-16.
2. J. M. Pollard, "Monte Carlo methods for index computation (mod p)," Math. Comput, 32, 918-924 (1978).
3. IEEE P1363 Standard. Part 6: Elliptic Curve Systems (Draft 5), pp. 1-48 (1995).
4. R. C. Mullin, I. M. Onyszchuk, and S. A. Vanstone, "Optimal Normal Bases in GF(p")" Discr. Appl. Math., 22, 149-161 (1988).
5. A. V. Bessalov, A. B. Telizhenko, and S. V. Gudzenko, "Operations in a finite field GF(2") for complex systems of cryptographic codes," Izv. Vyssh. Uchebn. Zaved., Radioelektr., No. 7, 32-37 (2000).
6. D. Shanks, "Class number, a theory of factorizations, and genera," in: Proc. Symposia in Pure Mathematics (1971), pp. 415-440.
7. D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addispn-Wesley, Reading (1981).