The space complexity analysis in the general number field sieve integer factorization

DOI10.1016/j.tcs.2016.03.028zbMath1403.11082OpenAlexW2318484863MaRDI QIDQ278727

Yu Wang, Hongyan Zang, Qi Wang, Xiubin Fan

Publication date: 2 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.028

zbMATH Keywords

computational complexitygeneral number field sieveinteger factorizationmathematical expectationp-adic evaluationspace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (2)

Solving future equation systems using integral-type error function and using twice ZNN formula with disturbances suppressed ⋮ An improved parallel block Lanczos algorithm over GF(2) for integer factorization

Cites Work

• The development of the number field sieve
• Square Root Algorithms for the Number Field Sieve
• On polynomial selection for the general number field sieve
• Factorization of a 768-Bit RSA Modulus
• Solving sparse linear equations over finite fields
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Predicting the Sieving Effort for the Number Field Sieve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The space complexity analysis in the general number field sieve integer factorization