Approximate common divisor problem and continued fractions

DOI10.4213/MVK184MaRDI QIDQ3381824zbMATH OpenOpenAlexFDO

Authors K. D. Zhukov

Publication date 20 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk184

zbMATH Keywords

approximate common divisorscontinued fractionsDiophantine approximation

Mathematics Subject Classification ID

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

Recommendations

• Approximate common divisor problem and lattice sieving
• scientific article; zbMATH DE number 1852136
• Certified approximate univariate GCDs
• On approximate GCDs of univariate polynomials
• Algorithms for the approximate common divisor problem

Cites work

• Approximate Integer Common Divisor Problem Relates to Implicit Factorization
• Continued fractions and RSA with small secret exponent
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• scientific article; zbMATH DE number 3232841 (Why is no real title available?)

Cited in

(6)

• Algorithms for CRT-variant of approximate greatest common divisor problem
• Revisiting orthogonal lattice attacks on approximate common divisor problems
• Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
• Recovering a sum of two squares decomposition
• Approximate common divisor problem and lattice sieving
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)

Describes a project that uses

Uses Software

• MPIR

This page was built for publication: Approximate common divisor problem and continued fractions

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