Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
From MaRDI portal
Publication:3612560
DOI10.1007/978-3-540-74143-5_21zbMath1215.11120OpenAlexW1529687384MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (14)
Trapdoor DDH groups from pairings and isogenies ⋮ A note on the bivariate Coppersmith theorem ⋮ Recovering zeros of polynomials modulo a prime ⋮ Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices ⋮ A New Partial Key Exposure Attack on Multi-power RSA ⋮ Reconstructing points of superelliptic curves over a prime finite field ⋮ Deterministic factoring with oracles ⋮ On the Improvement of the BDF Attack on LSBS-RSA ⋮ A Tool Kit for Partial Key Exposure Attacks on RSA ⋮ Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits ⋮ Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents ⋮ RSA Moduli with a Predetermined Portion: Techniques and Applications ⋮ Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
This page was built for publication: Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
