Cryptanalysis of RSA with more than one decryption exponent
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1489842 (Why is no real title available?)
- 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
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of RSA with two decryption exponents
- Cryptanalysis of short RSA secret exponents
- Factoring polynomials with rational coefficients
Cited in
(17)- Cryptanalysis of the multi-power RSA cryptosystem variant
- Generalized cryptanalysis of small CRT-exponent RSA
- On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
- Cryptanalysis of large RSA exponent by using the LLL algorithm
- Partial key exposure attacks on RSA with multiple exponent pairs
- Large decryption exponents in RSA
- Further cryptanalysis of a type of RSA variants
- Cryptanalysis of `less short' RSA secret exponents
- Cryptanalysis of RSA with two decryption exponents
- Partial key exposure: generalized framework to attack RSA
- Continued fractions applied to a family of RSA-like cryptosystems
- Cryptanalysis of RSA for a special case with \(d > e\)
- A security analysis of two classes of RSA-like cryptosystems
- A new attack on RSA with two or three decryption exponents
- Cryptanalysis of variants of RSA with multiple small secret exponents
- Cryptanalysis of RSA with multiple small secret exponents
- The multi-dimension RSA and its low exponent security
This page was built for publication: Cryptanalysis of RSA with more than one decryption exponent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991798)