Recovering a sum of two squares decomposition
From MaRDI portal
Publication:2437316
DOI10.1016/j.jsc.2013.12.003zbMath1332.11110OpenAlexW2067188659MaRDI QIDQ2437316
Álvar Ibeas, Antoine Joux, Jaime Gutierrez
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2013.12.003
Symbolic computation and algebraic computation (68W30) Sums of squares and representations by other particular quadratic forms (11E25) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
- Attacking the Pollard Generator
- Minkowski's Convex Body Theorem and Integer Programming
- Hermite’s Constant and Lattice Algorithms
- Using LLL-Reduction for Solving RSA and Factorization Problems
- Fault Attacks Against emv Signatures