Recovering a sum of two squares decomposition revisited

DOI10.1007/978-3-319-38898-4_11zbMATH Open1409.94914OpenAlexW2505456505MaRDI QIDQ5740244FDOQ5740244

Authors: Xiao Na Zhang, L.-P. Wang, Jun Xu, Lei Hu, Liqiang Peng, Zhangjie Huang, Zeyi Liu 

Publication date: 25 July 2016

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-38898-4_11

Recommendations

• Recovering a sum of two squares decomposition
• Advances in Cryptology - EUROCRYPT 2004
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• scientific article; zbMATH DE number 1122843

zbMATH Keywords

latticesum of squaresCoppersmith's methodLLL algorithm

Mathematics Subject Classification ID

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

Cited In (2)

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

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

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