Approximate Integer Common Divisor Problem Relates to Implicit Factorization

DOI10.1109/TIT.2011.2137270MaRDI QIDQ5273653zbMATH OpenFDO

Authors Santanu Sarkar, Subhamoy Maitra

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2011.2137270

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cited in

(17)

• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• Revisiting orthogonal lattice attacks on approximate common divisor problems
• Improved results on cryptanalysis of prime power RSA
• On the greatest common divisor of shifted sets
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• Approximate common divisor problem and continued fractions
• A more complete cryptanalysis of the RSA-polynomial problem
• Generalized implicit factorization problem
• A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
• Implicit Factoring with Shared Most Significant and Middle Bits
• Approximate common divisor problem and lattice sieving
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
• Solving modular linear equations via automated Coppersmith and its applications
• Implicit-key attack on the RSA cryptosystem
• Implicit related-key factorization problem on the RSA cryptosystem
• Deterministic factoring with oracles
• Towards optimal bounds for implicit factorization problem

This page was built for publication: Approximate Integer Common Divisor Problem Relates to Implicit Factorization

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