Modifications to the Number Field Sieve
- 1 March 1993
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 6 (3) , 169-180
- https://doi.org/10.1007/bf00198464
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Factoring numbers using singular integersPublished by Association for Computing Machinery (ACM) ,1991
- The number field sievePublished by Association for Computing Machinery (ACM) ,1990
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- Fast, Rigorous Factorization and Discrete Logarithm AlgorithmsPublished by Elsevier ,1987
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- Refined analysis and improvements on some factoring algorithmsJournal of Algorithms, 1982
- On the number of positive integers ≤ x and free of prime factors > y, IIIndagationes Mathematicae, 1966