Cryptanalytic results on `Dual CRT' and `Common Prime' RSA

DOI10.1007/s10623-012-9675-5zbMath1273.94358OpenAlexW1974890031MaRDI QIDQ1934238

Subhamoy Maitra, Santanu Sarkar

Publication date: 28 January 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9675-5

zbMATH Keywords

cryptanalysislatticesCommon Prime RSADual CRT-RSA

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices ⋮ Cryptanalysis of Dual RSA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of short RSA secret exponents
• On the security of multi-prime RSA
• Dual RSA and Its Security Analysis
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Information Security and Privacy
• Topics in Cryptology – CT-RSA 2006
• Public Key Cryptography - PKC 2006

This page was built for publication: Cryptanalytic results on `Dual CRT' and `Common Prime' RSA