Common modulus attacks on small private exponent RSA and some fast variants (in practice)

DOI10.1515/JMC.2010.003zbMath1194.94186MaRDI QIDQ3580732

Charles C. Y. Lam, M. Jason Hinek

Publication date: 13 August 2010

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

zbMATH Keywords

RSAcontinued fractionslattice reductionmulti-prime RSAsmall private exponentcommon modulusTakagi's scheme

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (1)

A new attack on RSA with two or three decryption exponents

Cites Work

• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Riemann's hypothesis and tests for primality
• A “WEAK” PRIVACY PROTOCOL USING THE RSA CRYPTO ALGORITHM
• Cryptanalysis of short RSA secret exponents
• On the security of multi-prime RSA
• An LLL Algorithm with Quadratic Complexity
• A method for obtaining digital signatures and public-key cryptosystems
• 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)

This page was built for publication: Common modulus attacks on small private exponent RSA and some fast variants (in practice)