Note on fast computation of secret RSA exponents
From MaRDI portal
Recommendations
- Fast exponentation in cryptography
- Fast RSA-type cryptosystems using n-adic expansion
- Fast parallel exponentiation algorithm for RSA public-key cryptosystem
- scientific article; zbMATH DE number 2219412
- Low secret exponent RSA revisited
- scientific article; zbMATH DE number 597744
- scientific article; zbMATH DE number 5631849
- A secure exponentiation algorithm resistant to a combined attack on RSA implementation
- On the design of RSA with short secret exponent
- scientific article; zbMATH DE number 1279168
Cited in
(5)- Algorithms to speed up computations in threshold RSA
- A simple approach for generating RSA keys
- scientific article; zbMATH DE number 5631849 (Why is no real title available?)
- Fast generation of secure RSA-moduli with almost maximal diversity
- scientific article; zbMATH DE number 1279168 (Why is no real title available?)
This page was built for publication: Note on fast computation of secret RSA exponents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412969)