Factoring RSA moduli with primes sharing bits in the middle
From MaRDI portal
Publication:1647745
Recommendations
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Implicit factorization of RSA moduli revisited (short paper)
- Cryptanalysis of RSA variants with primes sharing most significant bits
- New Attacks on the RSA Cryptosystem
- Implicit Factoring with Shared Most Significant and Middle Bits
Cites work
- scientific article; zbMATH DE number 1617917 (Why is no real title available?)
- scientific article; zbMATH DE number 3959521 (Why is no real title available?)
- scientific article; zbMATH DE number 3460351 (Why is no real title available?)
- scientific article; zbMATH DE number 1302812 (Why is no real title available?)
- scientific article; zbMATH DE number 682387 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- A monte carlo method for factorization
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of RSA with small prime difference
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Cryptanalysis of short RSA secret exponents
- Efficient Factoring Based on Partial Information
- Factoring integers with elliptic curves
- On factoring large numbers
- On the Improvement of the BDF Attack on LSBS-RSA
- On the security of RSA with primes sharing least-significant bits
- Small Private-Exponent Attack on RSA with Primes Sharing Bits
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- The development of the number field sieve
Cited in
(19)- Factoring RSA moduli with weak prime factors
- Algorithm for factoring some RSA and Rabin moduli
- Some Considerations concerning the Selection of RSA Moduli
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Small primitive roots and malleability of RSA moduli
- On RSA moduli with half of the bits prescribed
- On RSA moduli with prescribed bit patterns
- scientific article; zbMATH DE number 3954815 (Why is no real title available?)
- Cryptanalysis of RSA variants with primes sharing most significant bits
- Factoring unbalanced moduli with known bits
- On RSA moduli with almost half of the bits prescribed
- Implicit Factoring with Shared Most Significant and Middle Bits
- Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
- Factoring RSA modulus using prime reconstruction from random known bits
- Generalized attack on ECDSA: known bits in arbitrary positions
- A note on the prime factorization method by Nemec et al.
- An attack on \(N = p^2q\) with partially known bits on the multiple of the prime factors
- Further results on implicit factoring in polynomial time
- Strategy of relations collection in factoring RSA modulus
This page was built for publication: Factoring RSA moduli with primes sharing bits in the middle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647745)
