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

Factorization (11Y05) Cryptography (94A60)

Cited in

(18)

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

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)