Cryptanalysis of a new variant of the RSA cryptosystem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 176555 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (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
- A new generalization of the KMOV cryptosystem
- A novel RSA-like cryptosystem based on a generalization of the Rédei rational functions
- Another Generalization of Wiener’s Attack on RSA
- Classical attacks on a variant of the RSA cryptosystem
- Continued fractions applied to a family of RSA-like cryptosystems
- Cryptanalysis of RSA and its variants.
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of the RSA variant based on cubic Pell equation
- Factoring polynomials with rational coefficients
- Further cryptanalysis of a type of RSA variants
- Improving small private exponent attack on the Murru-Saettone cryptosystem
- On optimal bounds of small inverse problems and approximate GCD problems with higher degree
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Using LLL-reduction for solving RSA and factorization problems
Cited in
(2)
This page was built for publication: Cryptanalysis of a new variant of the RSA cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030865)
