Using LLL-reduction for solving RSA and factorization problems
From MaRDI portal
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Breaking RSA may be as difficult as factoring
- Breaking RSA may not be equivalent to factoring
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of RSA with small prime difference
- Cryptanalysis of short RSA secret exponents
- Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Efficient Factoring Based on Partial Information
- Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
- Factoring integers with elliptic curves
- Factoring polynomials and the knapsack problem
- Factoring polynomials with rational coefficients
- Factorization of Square-Free Integers with High Bits Known
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Finding smooth integers in short intervals using CRT decoding
- Floating-Point LLL Revisited
- scientific article; zbMATH DE number 1583766 (Why is no real title available?)
- scientific article; zbMATH DE number 4179277 (Why is no real title available?)
- scientific article; zbMATH DE number 3959521 (Why is no real title available?)
- scientific article; zbMATH DE number 3569835 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1302812 (Why is no real title available?)
- scientific article; zbMATH DE number 1303120 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1942424 (Why is no real title available?)
- scientific article; zbMATH DE number 1962166 (Why is no real title available?)
- scientific article; zbMATH DE number 2081057 (Why is no real title available?)
- scientific article; zbMATH DE number 1842495 (Why is no real title available?)
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
- scientific article; zbMATH DE number 1842497 (Why is no real title available?)
- scientific article; zbMATH DE number 1852133 (Why is no real title available?)
- scientific article; zbMATH DE number 1852134 (Why is no real title available?)
- scientific article; zbMATH DE number 1852136 (Why is no real title available?)
- scientific article; zbMATH DE number 1857497 (Why is no real title available?)
- scientific article; zbMATH DE number 1418303 (Why is no real title available?)
- scientific article; zbMATH DE number 4182680 (Why is no real title available?)
- Information Security and Privacy
- Low-exponent RSA with related messages
- Noisy polynomial interpolation and noisy Chinese remaindering
- On polynomial congruences
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
- On the security of RSA with primes sharing least-significant bits
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Public Key Cryptography - PKC 2006
- Public Key Cryptography – PKC 2004
- Public Key Cryptography – PKC 2004
- Recent advances in RSA cryptography
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Solving Simultaneous Modular Equations of Low Degree
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Stronger security proofs for RSA and Rabin bits.
- The development of the number field sieve
- The security of all RSA and discrete log bits
- Topics in Cryptology – CT-RSA 2006
- Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
Cited in
(42)- A generalized attack on some variants of the RSA cryptosystem
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Small CRT-exponent RSA revisited
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Cryptanalysis of the RSA variant based on cubic Pell equation
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Generalized cryptanalysis of small CRT-exponent RSA
- Recovering a sum of two squares decomposition
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
- scientific article; zbMATH DE number 1643920 (Why is no real title available?)
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- A tool kit for partial key exposure attacks on RSA
- Smallest Reduction Matrix of Binary Quadratic Forms
- Lattice-based integer factorisation: an introduction to Coppersmith's method
- Some applications of lattice based root finding techniques
- Small CRT-Exponent RSA Revisited
- \textit{Caveat implementor!} Key recovery attacks on MEGA
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Fast practical lattice reduction through iterated compression
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- Implicit-key attack on the RSA cryptosystem
- Improved Herrmann-May's attack with merging variables and lower LLL bound
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- Fast square-free decomposition of integers using class groups
- Smooth subsum search a heuristic for practical integer factorization
- A more complete cryptanalysis of the RSA-polynomial problem
- New results on the -hiding assumption and factoring related RSA moduli
- A novel partial key exposure attack on common prime RSA
- Solving multivariate Coppersmith problems with known moduli
- Generalized cryptanalysis of cubic Pell RSA
- Fault attacks on multi-prime RSA signatures
- Cryptanalysis of a new variant of the RSA cryptosystem
- New results on elliptic curve hidden number problem for ECDH key exchange
- Distribution of powers modulo p and security of RSA
- Survey: recovering cryptographic keys from partial information, by example
- An application of Euclidean algorithm in cryptanalysis of RSA
- Factoring multi power RSA moduli with a class of secret exponents
This page was built for publication: Using LLL-reduction for solving RSA and factorization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5188546)
