Implicit factorization of unbalanced RSA moduli
From MaRDI portal
Recommendations
- Implicit Factoring with Shared Most Significant and Middle Bits
- Implicit factorization of RSA moduli revisited (short paper)
- Further improvement of factoring RSA moduli with implicit hint
- Improved bounds for the implicit factorization problem
- Implicit related-key factorization problem on the RSA cryptosystem
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Factoring polynomials with rational coefficients
- Further results on implicit factoring in polynomial time
- How to Factor N 1 and N 2 When p₁=p₂ \bmod 2t
- scientific article; zbMATH DE number 3032896 (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
Cited in
(15)- Implicit factorization of RSA moduli revisited (short paper)
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- Further results on implicit factoring in polynomial time
- Improved bounds for the implicit factorization problem
- On oracle factoring of integers
- Towards optimal bounds for implicit factorization problem
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Implicit related-key factorization problem on the RSA cryptosystem
- Implicit Factoring with Shared Most Significant and Middle Bits
- Factoring unbalanced moduli with known bits
- Further improvement of factoring RSA moduli with implicit hint
- Generalized implicit factorization problem
- Solving modular linear equations via automated Coppersmith and its applications
- Elliptic-curve factoring, witnesses and oracles
- Implicit factorization with shared any bits
This page was built for publication: Implicit factorization of unbalanced RSA moduli
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346502)
