Square Root Algorithms for the Number Field Sieve

DOI10.1007/978-3-642-31662-3_15zbMath1298.11114OpenAlexW1911237571MaRDI QIDQ3166983

Emmanuel Thomé

Publication date: 1 November 2012

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31662-3_15

zbMATH Keywords

number field sieveMontgomery's algorithmalgebraic square rootCouveignes' algorithmp-adic approach

Mathematics Subject Classification ID

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

Related Items (3)

The space complexity analysis in the general number field sieve integer factorization ⋮ Rigorous analysis of a randomised number field sieve ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

This page was built for publication: Square Root Algorithms for the Number Field Sieve