Recovering a sum of two squares decomposition

Jaime Gutierrez Ibeas Alvar Antoine Joux 1
1 ALMASTY - ALgorithms for coMmunicAtion SecuriTY
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We present an algorithm that recovers a decomposition of an integer $N$ as sum of two squares from an approximation to one of the summands. It is based on Coppersmith's linearization technique which, applied directly to this problem, requires an approximation error smaller than $N^{1/6}$. Our algorithm performs a two-round linearization and allows approximation errors up to $N^{1/4}$.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01198937
Contributor : Lip6 Publications <>
Submitted on : Monday, September 14, 2015 - 4:12:12 PM
Last modification on : Thursday, March 21, 2019 - 2:54:39 PM

Links full text

Identifiers

Citation

Jaime Gutierrez, Ibeas Alvar, Antoine Joux. Recovering a sum of two squares decomposition. Journal of Symbolic Computation, Elsevier, 2014, 64, pp.16-21. ⟨10.1016/j.jsc.2013.12.003⟩. ⟨hal-01198937⟩

Share

Metrics

Record views

155