Computing a square root for the number field sieve
From MaRDI portal
Recommendations
Cited in
(12)- An Implementation of the Number Field Sieve
- The space complexity analysis in the general number field sieve integer factorization
- Square Root Algorithms for the Number Field Sieve
- Modular exponentiation via the explicit Chinese remainder theorem
- Continued fractions and parallel SQUFOF
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
- A Montgomery-like square root for the number field sieve
- Sieving methods for class group computation
- scientific article; zbMATH DE number 733569 (Why is no real title available?)
- scientific article; zbMATH DE number 919915 (Why is no real title available?)
- Root optimization of polynomials in the number field sieve
- Computing \(e\)-th roots in number fields
This page was built for publication: Computing a square root for the number field sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4273682)