Sica, Francesco2021-08-092021-08-092021Sica, Francesco. "Factoring with Hints" Journal of Mathematical Cryptology, vol. 15, no. 1, 2021, pp. 123-130. https://doi.org/10.1515/jmc-2020-0078http://nur.nu.edu.kz/handle/123456789/5668We 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 factorisations of O(N1/3+ϵ) terms surrounding N = pq product of two large primes, we can recover deterministically p and q in O(N1/3+ϵ) bit operations. This shows that the factorisations of close integers are non trivially related and that consequently one can expect more results along this line of thought...enAttribution-NonCommercial-ShareAlike 3.0 United Statescomplex analysisfactorisation of RSA moduliRiemann zeta functionOpen accessArticle