Welcome to the resource topic for 2009/323
Title:
Factoring Unbalanced Moduli with Known Bits
Authors: Eric Brier, David Naccache, Mehdi Tibouchi
Abstract:Let n = pq > q^3 be an RSA modulus. This note describes a LLL-based method allowing to factor n given 2log_2q contiguous bits of p, irrespective to their position. A second method is presented, which needs fewer bits but whose length depends on the position of the known bit pattern. Finally, we introduce a somewhat surprising ad hoc method where two different known bit chunks, totalling \frac32 log_2 q bits suffice to factor n.
ePrint: https://eprint.iacr.org/2009/323
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .