Approximate common divisor problem and lattice sieving

DOI10.4213/MVK257MaRDI QIDQ3382022zbMATH 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/mvk257

zbMATH Keywords

approximate common divisor problemGaussian volume heuristicsinteger linear programminglattice sievingsystem of integer linear inequalities

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Continued fractions and generalizations (11J70) Cryptography (94A60)

Recommendations

• Approximate common divisor problem and continued fractions
• scientific article; zbMATH DE number 1852136
• A sieve algorithm for the shortest lattice vector problem
• Approximate common divisors via lattices
• Algorithms for the approximate common divisor problem

Cites work

• Approximate common divisor problem and continued fractions
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization
• Fully homomorphic encryption over the integers
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

Cited in

(7)

• 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
• Approximate common divisors via lattices
• Algorithms for the approximate common divisor problem
• Approximate common divisor problem and continued fractions
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)

This page was built for publication: Approximate common divisor problem and lattice sieving

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