Factoring RSA moduli with primes sharing bits in the middle
From MaRDI portal
Publication:1647745
DOI10.1007/S00200-017-0340-0zbMATH Open1391.11158OpenAlexW2747443385MaRDI QIDQ1647745FDOQ1647745
Authors: Omar Akchiche, Omar Khadir 
Publication date: 26 June 2018
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-017-0340-0
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
- A method for obtaining digital signatures and public-key cryptosystems
- Factoring integers with elliptic curves
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of short RSA secret exponents
- Title not available (Why is that?)
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of RSA with small prime difference
- On the security of RSA with primes sharing least-significant bits
- Title not available (Why is that?)
- Title not available (Why is that?)
- A monte carlo method for factorization
- Title not available (Why is that?)
- The development of the number field sieve
- Title not available (Why is that?)
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Title not available (Why is that?)
- On factoring large numbers
- Efficient Factoring Based on Partial Information
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Small Private-Exponent Attack on RSA with Primes Sharing Bits
- On the Improvement of the BDF Attack on LSBS-RSA
Cited In (17)
- Factoring RSA moduli with weak prime factors
- Small primitive roots and malleability of RSA moduli
- On RSA moduli with almost half of the bits prescribed
- Some Considerations concerning the Selection of RSA Moduli
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Generalized attack on ECDSA: known bits in arbitrary positions
- Strategy of relations collection in factoring RSA modulus
- Algorithm for factoring some RSA and Rabin moduli
- On RSA moduli with half of the bits prescribed
- Factoring RSA modulus using prime reconstruction from random known bits
- Further results on implicit factoring in polynomial time
- On RSA moduli with prescribed bit patterns
- Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
- Implicit Factoring with Shared Most Significant and Middle Bits
- Factoring unbalanced moduli with known bits
- Title not available (Why is that?)
- A note on the prime factorization method by Nemec et al.
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)
