Rigorous analysis of a randomised number field sieve
- 1 June 2018
- journal article
- research article
- Published by Elsevier in Journal of Number Theory
- Vol. 187, 92-159
Abstract
No abstract availableKeywords
All Related Versions
This publication has 34 references indexed in Scilit:
- On sharp transitions in making squaresAnnals of Mathematics, 2012
- On polynomial selection for the general number field sieveMathematics of Computation, 2006
- Factoring with two large primesMathematics of Computation, 1994
- Cribler les entiers sans grand facteur premierPhilosophical Transactions A, 1993
- Integers, without large prime factors, in arithmetic progressions. IIPhilosophical Transactions A, 1993
- A rigorous time bound for factoring integersJournal of the American Mathematical Society, 1992
- Algorithms in algebraic number theoryBulletin of the American Mathematical Society, 1992
- On the number of positive integers ≦ x and free of prime factors > yJournal of Number Theory, 1986
- INTEGERS FREE OF LARGE PRIME DIVISORS IN SHORT INTERVALSThe Quarterly Journal of Mathematics, 1985
- Quadratische K rper im Gebiete der h heren Kongruenzen. I.Mathematische Zeitschrift, 1924