REFERENCES
- Bollobas , B. 1985 . Random Graphs Orlando , FL : Academic Press. . [Bollobas 1985]
- Buhler , J. , Lenstra , H. W. Jr. and Pomerance , Carl . “Factoring integers with the number field sieve” [Buhler et al.], (preprint)
- LaMacchia , B. A. and Odlyzko , A. M. 1991 . “Solving large sparse linear systems over finite fields”. ” . In Advances in Cryptology: Crypto 90 Edited by: Menzes , A. and Vanstone , S. 109 – 133 . Berlin : Springer-Verlag. . [LaMacchia and Odlyzko 1991], Lecture Notes in Computer Science 537
- Odlyzko , A. M. “Discrete logarithms in finite fields and their cryptographic significance” . Advances in Cryptology: Proceedings of Eurocrypt 84 . Edited by: Beth , T. , Cot , N. and Ingemarsson , I. pp. 224 – 314 . Berlin : Springer-Verlag. . [Odlyzko 1985], Lecture Notes in Computer Science 209
- Pomerance , C. , Smith , J. W. and Tuler , R. 1988 . “A pipeline architecture for factoring large integers with the quadratic sieve algorithm” . SIAM J. Comput. , 17 : 387 – 403 . [Pomerance et al. 1988]
- Wiedemann , D. H. 1986 . “Solving sparse linear equations over finite fields” . IEEE Trans. Information Theory , 32 : 54 – 62 . [Wiedemann 1986]