Computing discrete logarithms with quadratic number rings

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

Volumn 1403, Issue , 1998, Pages 171-183

  Weber, Damian ^a  

^a FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CRYPTOGRAPHY;

COMPUTATIONAL RESULTS; DISCRETE LOGARITHMS; GAUSSIAN INTEGERS; INDEX CALCULUS; NUMBER FIELD SIEVE; PRACTICAL EXPERIENCE; QUADRATIC NUMBER; RUNNING TIME;

COMPUTATION THEORY;

EID: 84956868710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054125     Document Type: Conference Paper

References (16)

1. D. Coppersmith, A. Odlyzko, and R. Schroeppel. Discrete logarithms in GF(p). Algorithmica 1, pages 1-15, 1986.
2. Th. Denny. Lösen grosser dünnbcsetzter Gleichungssysteme über endlichen Primkörpern. PhD thesis, Universität des Saarlandes/Germany, 1997.
3. Th. Denny and V. Müller. On the reduction of composed relations from the number field sieve. In Algebraic Number Theory II, number 1122 in Lecture Notes in Computer Science, 1996.
4. M. Elkenbracht-Huizing. Factoring integers with the Number Field Sieve. PhD thesis, Rijksuniversiteit te Leiden, 1996.
5. M. Elkenbracht-Huizing. A multiple polynomial general number field sieve. In Algebraic Number Theory II, number 1122 in Lecture Notes in Computer Science, 1996.
6. D. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math., 6:124-138, 1993.
7. L. Hua. Introduction to Number Theory. Springer, 1982.
8. D. E. Knuth and L. Trabb Pardo. Analysis of a simple factorization algorithm. Theoretical Computer Science, 3:321-348, 1976.
9. P. L. Montgomery. Number field sieve with two quadratic polynomials, presentation at Centrum for Wiskunde en Informatica, Amsterdam, 1993.
10. S. Pohlig and M. Heilman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans, on Information Theory, 24:106-110, 1978.
11. O. Schirokauer. Discrete logarithms and local units. Phil. Trans. R. Soc. Lond. A 345, pages 409-423, 1993.
12. O. Schirokauer, D. Weber, and Th. F. Denny. Discrete logarithms: the effectiveness of the index calculus method. In H. Cohen, editor, Algorithmic Number Theory - ANTS II, number 1122 in Lecture Notes in Computer Science, 1996.
13. D. Weber. Computing discrete logarithms with the number field sieve. In H. Cohen, editor, Algorithmic Number Theory - ANTS II, number 1122 in Lecture Notes in Computer Science, 1996.
14. D. Weber. On the computation of discrete logarithms in finite prime fields. PhD thesis, Universität des Saarlandes/Germany, 1997.
15. D. Weber and Th. F. Denny. The solution of McCurley’s challenge. 1998. To appear.
16. J. Zayer. Faktorisieren mit dem Number Field Sieve. PhD thesis, Universität des Saarlandes/Germany, 1995.