Finding a Small Root of a Univariate Modular Equation

DOI10.1007/3-540-68339-9_14zbMath1304.94042OpenAlexW1749471906MaRDI QIDQ2876895

Don Coppersmith

Publication date: 20 August 2014

Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68339-9_14

Mathematics Subject Classification ID

Related Items (50)

A Unified Framework for Small Secret Exponent Attack on RSA ⋮ Toward RSA-OAEP Without Random Oracles ⋮ Cryptanalysis of Prime Power RSA with two private exponents ⋮ An efficient probabilistic public-key cryptosystem over quadratic fields quotients ⋮ Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices ⋮ Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ A New Partial Key Exposure Attack on Multi-power RSA ⋮ Practical attacks on small private exponent RSA: new records and new insights ⋮ Inferring sequences produced by the quadratic generator ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding ⋮ Lattice attacks against elliptic-curve signatures with blinded scalar multiplication ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ A Tool Kit for Partial Key Exposure Attacks on RSA ⋮ Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial ⋮ On the security of multi-prime RSA ⋮ Thrackles: An Improved Upper Bound ⋮ Further improvement of factoring \(N=p^rq^s\) with partial known bits ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Applications of Signcryption ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation ⋮ On the optimality of lattices for the Coppersmith technique ⋮ Optimal security proofs for full domain hash. Revisited ⋮ The polynomial approximate common divisor problem and its application to the fully homomorphic encryption ⋮ Combined Attack on CRT-RSA ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ A method for obtaining digital signatures and public-key cryptosystems ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance ⋮ Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem ⋮ Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents ⋮ Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures ⋮ Cryptanalysis of elliptic curve hidden number problem from PKC 2017 ⋮ RSA Moduli with a Predetermined Portion: Techniques and Applications ⋮ Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs ⋮ Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes ⋮ Computing prime divisors in an interval ⋮ Generalized cryptanalysis of small CRT-exponent RSA ⋮ A small secret exponent attack on cryptosystems using Dickson polynomials ⋮ A new parallel lattice reduction algorithm for BKZ reduced bases ⋮ Formally verified certificate checkers for hardest-to-round computation ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey

This page was built for publication: Finding a Small Root of a Univariate Modular Equation