
Factoring with Hints
We introduce a new deterministic factoring algorithm, which could be described in the cryptographically fashionable term of 'factoring with hints': we show that, given the knowledge of the factorisations of $O(N^{1/3+epsilon})$ terms surrounding $N=pq$ product of two large primes, we can recover det





