Approximate Divisor Multiples – Factoring with Only a Third of the Secret CRT-Exponents
- 25 May 2022
- book chapter
- Published by Springer Nature
- p. 147-167
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Certifying RSA2012
- Using LLL-Reduction for Solving RSA and Factorization Problems2009
- Partial Key Exposure Attack on CRT-RSA2009
- Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and FactoringJournal of Cryptology, 2006
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants2006
- Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring2004
- New Partial Key Exposure Attacks on RSA2003
- Cryptanalysis of RSA with Private Key d Less than N 0.2921999
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known1996