Factoring N = prq for Large r
Factoring N = prq for Large r
D. Boneh,Glenn Durfee,Nick Howgrave-Graham
1999 · DOI: 10.1007/3-540-48405-1_21
Annual International Cryptology Conference · 128 Citations
TLDR
An algorithm for factoring integers of the form N = prq for large r is presented and a new class of integers that can be efficiently factored is obtained that should be used with care when r is large.