On the security of multi-prime RSA

DOI10.1515/JMC.2008.006zbMath1146.94008OpenAlexW1985273268MaRDI QIDQ3537519

M. Jason Hinek

Publication date: 7 November 2008

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

Full work available at URL: https://doi.org/10.1515/jmc.2008.006

zbMATH Keywords

cryptanalysispartial key exposurelattice attacksmulti-prime RSAsmall private exponent

Mathematics Subject Classification ID

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

Related Items (8)

Exploiting the security of N = prqs through approximation of ϕ(N) ⋮ Cryptanalytic results on `Dual CRT' and `Common Prime' RSA ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ A Tool Kit for Partial Key Exposure Attacks on RSA ⋮ Further improvement of factoring \(N=p^rq^s\) with partial known bits ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Cryptanalysis of Dual RSA ⋮ Common modulus attacks on small private exponent RSA and some fast variants (in practice)

Cites Work

• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Finding a Small Root of a Univariate Modular Equation
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Cryptanalysis of short RSA secret exponents
• 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
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants

This page was built for publication: On the security of multi-prime RSA