Sica, Francesco
(De Gruyter, 2020-11-17)
We introduce a new approach to (deterministic) integer factorisation, which could be described
in the cryptographically fashionable term of “factoring with hints”: we prove that, for any ϵ > 0, given the
knowledge of the ...