Predicting the Sieving Effort for the Number Field Sieve

DOI10.1007/978-3-540-79456-1_11zbMath1230.11148OpenAlexW1491737863MaRDI QIDQ5387597

Willemien Ekkelkamp

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/12758

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (3)

The space complexity analysis in the general number field sieve integer factorization ⋮ Running Time Predictions for Factoring Algorithms ⋮ Root optimization of polynomials in the number field sieve

Cites Work

• The development of the number field sieve
• A Kilobit Special Number Field Sieve Factorization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Predicting the Sieving Effort for the Number Field Sieve