Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits
Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits
S. Maitra,Santanu Sarkar,Sourav Sen Gupta
2010 · DOI: 10.1007/978-3-642-12678-9_6
International Conference on Cryptology in Africa · 13 Citations
TLDR
This paper revisits the work of Heninger and Shacham in Crypto 2009 and provides a combinatorial model for the search where some random bits of the primes are known and shows how one can factorize N given the knowledge of random bits in the least significant halves of thePrimes.