Common modulus attacks on small private exponent RSA and some fast variants (in practice)
From MaRDI portal
Publication:3580732
DOI10.1515/JMC.2010.003zbMATH Open1194.94186MaRDI QIDQ3580732FDOQ3580732
Authors: M. Jason Hinek, Charles C. Y. Lam
Publication date: 13 August 2010
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Recommendations
RSAcontinued fractionslattice reductionmulti-prime RSAsmall private exponentcommon modulusTakagi's scheme
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Small Secret Key Attack on a Variant of RSA (Due to Takagi)
- Riemann's hypothesis and tests for primality
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- An LLL algorithm with quadratic complexity
- On the security of multi-prime RSA
- A “WEAK” PRIVACY PROTOCOL USING THE RSA CRYPTO ALGORITHM
Cited In (1)
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)