Common modulus attacks on small private exponent RSA and some fast variants (in practice)
From MaRDI portal
Publication:3580732
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A “WEAK” PRIVACY PROTOCOL USING THE RSA CRYPTO ALGORITHM
- An LLL algorithm with quadratic complexity
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of short RSA secret exponents
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- On the security of multi-prime RSA
- Riemann's hypothesis and tests for primality
- Small Secret Key Attack on a Variant of RSA (Due to Takagi)
Cited in
(2)
This page was built for publication: Common modulus attacks on small private exponent RSA and some fast variants (in practice)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580732)