A small secret exponent attack on cryptosystems using Dickson polynomials
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4081459
- Cryptanalysis of public-key distribution systems based on Dickson polynomials
- A unified framework for small secret exponent attack on RSA
- Public Key Cryptography - PKC 2006
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Small secret exponent attack on RSA variant with modulus N=p^rq
- Practical attacks on small private exponent RSA: new records and new insights
- Improving small private exponent attack on the Murru-Saettone cryptosystem
- Cryptanalysis of the Dickson-Scheme
- Small Private-Exponent Attack on RSA with Primes Sharing Bits
Cites work
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of short RSA secret exponents
- Finding a small root of a univariate modular equation
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 732318 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
Cited in
(5)- Cryptanalysis of public-key distribution systems based on Dickson polynomials
- scientific article; zbMATH DE number 4157891 (Why is no real title available?)
- Cryptanalysis of the Dickson-Scheme
- scientific article; zbMATH DE number 4081459 (Why is no real title available?)
- scientific article; zbMATH DE number 1839603 (Why is no real title available?)
This page was built for publication: A small secret exponent attack on cryptosystems using Dickson polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121388)
