Another Generalization of Wiener’s Attack on RSA
From MaRDI portal
Publication:3506378
DOI10.1007/978-3-540-68164-9_12zbMath1142.94355OpenAlexW2105418754MaRDI QIDQ3506378
Publication date: 13 June 2008
Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68164-9_12
Related Items
An application of Euclidean algorithm in cryptanalysis of RSA ⋮ Classical attacks on a variant of the RSA cryptosystem ⋮ A generalized attack on RSA type cryptosystems ⋮ Factoring RSA Moduli with Weak Prime Factors ⋮ Continued fractions applied to a family of RSA-like cryptosystems ⋮ Cryptanalysis of RSA Using the Ratio of the Primes ⋮ A New Class of Weak Encryption Exponents in RSA ⋮ A Unified Method for Private Exponent Attacks on RSA Using Lattices ⋮ A new attack on RSA and Demytko’s elliptic curve cryptosystem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
- Factoring integers with elliptic curves
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of RSA with small prime difference
- Cryptanalysis of short RSA secret exponents
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Smoothing ‘smooth’ numbers
- Linear forms in the logarithms of algebraic numbers
- Public Key Cryptography – PKC 2004
