Implicit factorization with shared any bits
From MaRDI portal
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Advances in Cryptology - CRYPTO 2003
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Approximate Integer Common Divisor Problem Relates to Implicit Factorization
- Factoring polynomials with rational coefficients
- Finding a small root of a univariate modular equation
- Floating-Point LLL Revisited
- Further improvement of factoring RSA moduli with implicit hint
- Generalized implicit factorization problem
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- Implicit Factoring with Shared Most Significant and Middle Bits
- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
- Implicit factorization of RSA moduli revisited (short paper)
- Implicit factorization of unbalanced RSA moduli
- Improved bounds for the implicit factorization problem
- Minkowski sum based lattice construction for multivariate simultaneous Coppersmith's technique and applications to RSA
- Partial key exposure: generalized framework to attack RSA
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
- Towards optimal bounds for implicit factorization problem
This page was built for publication: Implicit factorization with shared any bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326372)
