On RSA moduli with half of the bits prescribed
From MaRDI portal
Publication:1762295
DOI10.1016/J.JNT.2012.07.008zbMATH Open1277.11116OpenAlexW2028904165MaRDI QIDQ1762295FDOQ1762295
Authors: Xian Meng Meng 
Publication date: 23 November 2012
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2012.07.008
Recommendations
- On RSA moduli with almost half of the bits prescribed
- On RSA moduli with prescribed bit patterns
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Factoring RSA moduli with primes sharing bits in the middle
- scientific article; zbMATH DE number 5009188
- Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
- scientific article; zbMATH DE number 1302781
- Factoring estimates for a 1024-bit RSA modulus
- Factorization of a 768-Bit RSA Modulus
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
Cites Work
Cited In (8)
- A generalization of the Siegel-Walfisz theorem and its application
- Certifying variant of RSA with generalized moduli
- On RSA moduli with almost half of the bits prescribed
- Some Considerations concerning the Selection of RSA Moduli
- Squarefree polynomials with prescribed coefficients
- On RSA moduli with prescribed bit patterns
- On the distribution of special multiplicative functions in sets of integers with restricted digits
- RSA Moduli with a Predetermined Portion: Techniques and Applications
This page was built for publication: On RSA moduli with half of the bits prescribed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762295)
