Approximate Integer Common Divisor Problem Relates to Implicit Factorization
From MaRDI portal
Publication:5273653
DOI10.1109/TIT.2011.2137270zbMath1365.94458MaRDI QIDQ5273653
Santanu Sarkar, Subhamoy Maitra
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (11)
The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ Deterministic factoring with oracles ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem ⋮ A Simple and Improved Algorithm for Integer Factorization with Implicit Hints ⋮ Towards Optimal Bounds for Implicit Factorization Problem ⋮ Задача о приближенном общем делителе и цепные дроби ⋮ Approximate common divisor problem and lattice sieving ⋮ On the greatest common divisor of shifted sets ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
This page was built for publication: Approximate Integer Common Divisor Problem Relates to Implicit Factorization
