On the reduction of composed relations from the number field sieve

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

Volumn 1122, Issue , 1996, Pages 75-90

  Denny, Thomas F ^a   Müller, Volker ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LINEAR ALGEBRA; NUMBER THEORY; SIEVES;

DISCRETE LOGARITHMS; FACTORING INTEGERS; GAUSSIAN ELIMINATION; GRAPH ALGORITHMS; LANCZOS ALGORITHM; NUMBER FIELD SIEVE; PARTIAL RELATIONS; SYSTEM OF LINEAR EQUATIONS;

ALGORITHMS;

EID: 21444455606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61581-4_43     Document Type: Conference Paper

References (15)

1. T. F. Denny, D. Weber, A 65-digit prime DL computation, Message published on the NumberTheory Net, Oct. 1995
2. B. Dodson, A. K. Lenstra, NFS with Four Large Primes: An Explosive Experiment, Advances in Cryptology, CRYPTO '95, Lecture Notes in Computer Science, vol. 963 (1995), Springer Verlag, pp. 372-385
3. D. M. Gordon, Discrete Logarithms in GF(p) using the Number Field Sieve, SIAM J. Discrete Math. 6 (1993), pp. 124-138
4. J. D. Horton, A polynomial-time algorithm to find the shortest cycle basis of a graph, SIAM J. Comput.16 (1987), pp. 344-355
5. R. M. Huizing, An implementation of the number field sieve, Technical report, CWI Report NM-R9511, July 1995
6. B. A. LaMacchia, A. M. Odlyzko, Solving large sparse systems over finite fields, In: Advances in Cryptology, CRYPTO '90, Lecture Notes in Computer Science, vol. 537 (1991), Springer Verlag, pp. 109-133
7. C. Lanczos, An iterative method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Standards, Sec. B 45, pp. 255-282
8. A. K. Lenstra, M. S. Maxtasse, Factoring with two large primes, Mathematics of Computation, 63 (1994), pp. 72-82
9. A. K. Lenstra, H. W. Lenstra, The development of the number field sieve, Springer- Verlag, 1993
10. K. McCurley, The discrete logarithm problem, cryptology and computational number theory, Proc. Symp. in Applied Mathematics, American Mathematical Society, 1990
11. P. L. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), Advances in Cryptology, EUROCRYPT '95, Lecture Notes in Computer Science, vol. 921 (1995), Springer Verlag, pp. 106-120
12. A.M. Odlyzko. Discrete logarithms in finite fields and their cryptographic significanse, In Advances in Cryptology-Eurocrypt 84, Lecture Notes in Computer Science, vol. 209 (1985), Springer-Verlag Berlin, pp. 224-314
13. O. Schirokauer, Discrete logarithms and local units, Phil. Trans. R. Soc. Land. A 345 (1993), pp. 409-423
14. D. Weber, An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p, Advances in Cryptology, EUROCRYPT '95, Lecture Notes in Computer Science, vol. 921 (1995), Springer Verlag, pp. 95-105
15. J. Zayer, Faktorisieren mit dem Number Field Sieve, PhD Thesis, Universität des Saarlandes, 1995