An improved analysis on three variants of the RSA cryptosystem
From MaRDI portal
Recommendations
- Classical attacks on a variant of the RSA cryptosystem
- A generalized attack on RSA type cryptosystems
- A generalized attack on some variants of the RSA cryptosystem
- A new attack on three variants of the RSA cryptosystem
- A new improved bound for short decryption exponent on RSA modulus N = pq using Wiener's method
Cites work
- scientific article; zbMATH DE number 1302856 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- 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 method for obtaining digital signatures and public-key cryptosystems
- A new attack on three variants of the RSA cryptosystem
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of short RSA secret exponents
- Factoring polynomials with rational coefficients
- How to generalize RSA cryptanalyses
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Public Key Cryptography – PKC 2004
- Small secret exponent attack on RSA variant with modulus N=p^rq
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving linear equations modulo unknown divisors: revisited
- The LLL algorithm. Survey and applications
- The Magma algebra system. I: The user language
Cited in
(17)- Further cryptanalysis of some variants of the RSA cryptosystem
- Cryptanalysis of the RSA variant based on cubic Pell equation
- A generalized attack on some variants of the RSA cryptosystem
- Small CRT-exponent RSA revisited
- Further cryptanalysis of a type of RSA variants
- A new attack on some RSA variants
- Improved cryptanalysis of the AJPS Mersenne based cryptosystem
- Classical attacks on a variant of the RSA cryptosystem
- Cryptanalysis of RSA variants with primes sharing most significant bits
- An improved binary algorithm for RSA
- A security analysis of two classes of RSA-like cryptosystems
- A generalized attack on a new variant of the RSA cryptosystem
- RSA quantum cryptanalysis: a thorough exploration of n-bit attacks and emerging factoring techniques
- Improved cryptanalysis of an RSA variant based on cubic Pell curve
- Cryptanalysis of some algebraic variants of the RSA cryptosystem
- Partial prime factor exposure attacks on some RSA variants
- A novel cryptanalytic attack on a family of RSA-like cryptosystems
This page was built for publication: An improved analysis on three variants of the RSA cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980851)
