Abstract
We present a new method for predicting the sieving effort for the number field sieve (NFS) in practice. This method takes relations from a short sieving test as input and simulates relations according to this test. After removing singletons, we decide how many relations we need for the factorization according to the simulation and this gives a good estimate for the real sieving. Experiments show that our estimate is within 2 % of the real data. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Ekkelkamp, W. (2008). Predicting the sieving effort for the number field sieve. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5011 LNCS, pp. 167–179). https://doi.org/10.1007/978-3-540-79456-1_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
