Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials

DOI10.1007/978-3-662-53887-6_28zbMath1404.94054arXiv1605.08065OpenAlexW2963330028MaRDI QIDQ2958146

Brett Hemenway, Nadia Heninger, Ted Chinburg, Zachary Scherr

Publication date: 1 February 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.08065

zbMATH Keywords

RSAlatticesCoppersmith's methodpolynomial congruencescapacity theory

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

On the optimality of lattices for the Coppersmith technique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On algebraic equations with integral coefficients whose roots belong to a given point set
• Factoring polynomials with rational coefficients
• Capacity theory on algebraic curves
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Stronger security proofs for RSA and Rabin bits.
• Finite morphisms to projective space and capacity theory
• Approximate formulas for some functions of prime numbers
• On the Optimality of Lattices for the Coppersmith Technique
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• On an extension of the definition of transfinite diameter and some applications.
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Existence of the sectional capacity
• Using LLL-Reduction for Solving RSA and Factorization Problems
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• The security of all RSA and discrete log bits