FACTORING WITH HINTS

Thumbnail Image

Files

10.1515_jmc.pdf (437.63 KB)

Date

2021

Authors

Sica, Francesco

Journal Title

Journal ISSN

Volume Title

Publisher

Journal of Mathematical Cryptology

Abstract

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 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...

Description

Keywords

complex analysis, factorisation of RSA moduli, Riemann zeta function, Open access

Citation

Sica, Francesco. "Factoring with Hints" Journal of Mathematical Cryptology, vol. 15, no. 1, 2021, pp. 123-130. https://doi.org/10.1515/jmc-2020-0078

URI

http://nur.nu.edu.kz/handle/123456789/5668

Collections

Articles