Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents

DOI10.1007/978-3-031-07082-2_6zbMath1496.94062OpenAlexW4285262779MaRDI QIDQ2170085

Alexander May, Santanu Sarkar, Julian Nowakowski

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_6

zbMATH Keywords

partial key exposureCoppersmith's methodCRT-RSA

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Decoding McEliece with a hint -- secret Goppa key parts reveal everything ⋮ A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
• Small CRT-exponent RSA revisited
• Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• A New Lattice Construction for Partial Key Exposure Attack for RSA
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Certifying RSA
• Using LLL-Reduction for Solving RSA and Factorization Problems
• Advances in Cryptology – CRYPTO 2004
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• Advances in Cryptology - CRYPTO 2003
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Information Security and Privacy
• Partial key exposure attack on short secret exponent CRT-RSA

This page was built for publication: Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents