Factoring with Hints

Sica F.
1 January 2021 De Gruyter Open Ltd

Journal of Mathematical Cryptology
2021 #15 Issue 1 123 - 130 pp.

We introduce a new approach to (deterministic) integer factorisation, which could be describedin 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.

complex analysis , factorisation of RSA moduli , Riemann zeta function

Text of the article Перейти на текст статьи

School of Sciences and Humanities, Nazarbayev University, 53 Kabanbay Batyr, Nur-Sultan, Kazakhstan

School of Sciences and Humanities

10 лет помогаем публиковать статьи Международный издатель

Книга Публикация научной статьи Волощук 2026 Book Publication of a scientific article 2026