Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
From MaRDI portal
Publication:3612560
DOI10.1007/978-3-540-74143-5_21zbMath1215.11120MaRDI QIDQ3612560
Publication date: 10 March 2009
Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_21
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
RSA Moduli with a Predetermined Portion: Techniques and Applications, Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits, Deterministic factoring with oracles, Trapdoor DDH groups from pairings and isogenies, A note on the bivariate Coppersmith theorem, Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices, Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents, A New Partial Key Exposure Attack on Multi-power RSA, A Tool Kit for Partial Key Exposure Attacks on RSA, Recovering zeros of polynomials modulo a prime, Implicit Related-Key Factorization Problem on the RSA Cryptosystem, On the Improvement of the BDF Attack on LSBS-RSA, Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
