Approximate Integer Common Divisor Problem Relates to Implicit Factorization

DOI10.1109/TIT.2011.2137270zbMATH Open1365.94458MaRDI QIDQ5273653FDOQ5273653

Authors: Santanu Sarkar, Subhamoy Maitra 

Publication date: 12 July 2017

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

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cited In (15)

• Title not available (Why is that?)
• 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
• Generalized implicit factorization problem
• A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
• Implicit Factoring with Shared Most Significant and Middle Bits
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
• Approximate common divisor problem and lattice sieving
• Implicit-key attack on the RSA cryptosystem
• Deterministic factoring with oracles
• Implicit related-key factorization problem on the RSA cryptosystem
• 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)