Cryptanalysis of short secret exponents modulo RSA primes.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 176555 (Why is no real title available?)
- scientific article; zbMATH DE number 1394325 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- Attacks on Shamir's `RSA for paranoids'
- Cryptanalysis of `less short' RSA secret exponents
- Cryptanalysis of short RSA secret exponents
- Factoring Large Integers
- Public-key cryptosystems based on cubic finite field extensions
Cited in
(7)- Cryptanalysis of RSA Using the Ratio of the Primes
- Cryptanalysis of `less short' RSA secret exponents
- scientific article; zbMATH DE number 5631849 (Why is no real title available?)
- Cryptanalysis of RSA with a small parameter revisited
- scientific article; zbMATH DE number 1279168 (Why is no real title available?)
- Attacks of simple block ciphers via efficient heuristics
- Cryptanalysis of short RSA secret exponents
This page was built for publication: Cryptanalysis of short secret exponents modulo RSA primes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429863)