FACTORING WITH HINTS
| dc.contributor.author | Sica, Francesco | |
| dc.date.accessioned | 2021-08-09T14:52:04Z | |
| dc.date.available | 2021-08-09T14:52:04Z | |
| dc.date.issued | 2021 | |
| dc.description.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... | en_US |
| dc.identifier.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 | en_US |
| dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/5668 | |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Mathematical Cryptology | en_US |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
| dc.subject | complex analysis | en_US |
| dc.subject | factorisation of RSA moduli | en_US |
| dc.subject | Riemann zeta function | en_US |
| dc.subject | Open access | en_US |
| dc.title | FACTORING WITH HINTS | en_US |
| dc.type | Article | en_US |
| workflow.import.source | science |