Predicting the sieving effort for the number field sieve

Authors:
Willemien Ekkelkamp
Affiliations:
CWI, Amsterdam, The Netherlands and Leiden University, Leiden, The Netherlands
Venue:
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Year:
2008

Citing 2
Cited 1

The number field sieve

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A kilobit special number field sieve factorization

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security

Running time predictions for factoring algorithms

ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new method for predicting the sieving effortfor the number field sieve (NFS) in practice. This method takes relationsfrom a short sieving test as input and simulates relations according tothis test. After removing singletons, we decide how many relations weneed for the factorization according to the simulation and this gives agood estimate for the real sieving. Experiments show that our estimateis within 2% of the real data.