Recovering a sum of two squares decomposition

DOI10.1016/J.JSC.2013.12.003MaRDI QIDQ2437316zbMATH OpenOpenAlexFDO

Authors Álvar Ibeas, Jaime Gutierrez, Antoine Joux

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

zbMATH Keywords

Coppersmith methodsum of squares

Mathematics Subject Classification ID

Sums of squares and representations by other particular quadratic forms (11E25) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Recovering a sum of two squares decomposition revisited
• scientific article; zbMATH DE number 953235
• Remarks on the algorithms of Cornacchia and Hermite-Serret
• scientific article; zbMATH DE number 1122843
• Approximate common divisor problem and continued fractions

Cites work

• A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
• Attacking the Pollard Generator
• Factoring polynomials with rational coefficients
• Fault attacks against EMV signatures
• Hermite’s Constant and Lattice Algorithms
• scientific article; zbMATH DE number 3987367 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• scientific article; zbMATH DE number 3221502 (Why is no real title available?)
• Minkowski's Convex Body Theorem and Integer Programming
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Using LLL-reduction for solving RSA and factorization problems

Cited in

(2)

• Summation-by-parts and correction procedure via reconstruction
• Recovering a sum of two squares decomposition revisited

This page was built for publication: Recovering a sum of two squares decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437316)