Further improvement of factoring N = p r q s with partial known bits

• Main Authors: Wang, Shixiong, Qu, Longjiang, Li, Chao, Wang, Huaxiong
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2021
• Subjects: Science::Mathematics; RSA Variant; Partial Known Bits
• Online Access: https://hdl.handle.net/10356/151173
• Institution: Nanyang Technological University

We revisit the factoring with known bits problem on RSA moduli. In 1996, Coppersmith showed that the RSA modulus N = pq with balanced p, q can be efficiently factored, if the high order ¼log₂ N bits of one prime factor is given. Later, this important result is also generalized to the factorization o...