A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields

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

Volumn 877 LNCS, Issue , 1994, Pages 28-40

  Adleman, Leonard M ^a   DeMarrais, Jonathan ^a   Huang, Ming Deh ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY;

CRYPTOGRAPHIC SYSTEMS; DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; ELLIPTIC CURVE; EXPECTED TIME; HYPER-ELLIPTIC CURVES; RATIONAL POINTS; SUB-EXPONENTIAL ALGORITHMS;

GEOMETRY;

EID: 84929727140     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58691-1_39     Document Type: Conference Paper

References (14)

1. Berlekamp, E.R., Factoring Polynomials over Large Finite Fields, Math. Comp. 24 (1970), 713-715.
2. Cantor, D., Computing in the Jacobian of a Hyperelliptic Curve, Math. Comp., Num. 177, 1987, pp. 95-101
3. Hartshorne, R., Algebraic Geometry, Springer-Verlag, New York, 1977.
4. Iliopoulos, C., Worst case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith Normal forms of an integer matrix, SIAM J. Comput., 18, 1989, pp. 658-669
5. Jacobson, N., Basic Algebra I, W. H. Freeman and company, 1974
6. Kannan, R. and Bachem A., Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput., 8, 1979, pp. 499-507
7. Koblitz, N., Elliptic curve cryptosystems, Math. Comp., 1987.
8. Koblitz, N., Hyperelliptic Cryptosystems, J. Cryptography 1, 1989, pp. 139-150.
9. Lenstra H. W., Algorithms in Algebraic Number Theory, Preliminary version, May 20 1991.
10. Lovorn R., Rigorous, subexponenial algorithms for discrete logarithms over finite fields, PhD Thesis, University of Georgia, May 1992
11. Mumford, D., Tata Lectures on Theta II, Birkhäuser, Boston, 1984.
12. Miller, V., The use of elliptic curves in cryptography. Advances in Cryptography, Ed. H.C. Williams, Springer-Verlag, 1986, 417-426.
13. Rabin, M. O., Probabilistic Algorithms in Finite Fields, Siam J. Comput. 9 (1980) 273-280
14. Zantema, H., Class Numbers and Units, Computational Methods in Number Theory, Part II, 1987, 213-234