FACTORING WITH HINTS

Sica, Francesco

dc.contributor.author	Sica, Francesco
dc.date.accessioned	2021-01-25T04:22:37Z
dc.date.available	2021-01-25T04:22:37Z
dc.date.issued	2020-11-17
dc.identifier.citation	Sica, F. (2020). Factoring with Hints. Journal of Mathematical Cryptology, 15(1), 123–130. https://doi.org/10.1515/jmc-2020-0078	en_US
dc.identifier.issn	1862-2984
dc.identifier.uri	https://www.degruyter.com/view/journals/jmc/15/1/article-p123.xml
dc.identifier.uri	https://doi.org/10.1515/jmc-2020-0078
dc.identifier.uri	http://nur.nu.edu.kz/handle/123456789/5223
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(N 1/3+ϵ ) terms surrounding N = pq product of two large primes, we can recover deterministically p and q in O(N 1/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.language.iso	en	en_US
dc.publisher	De Gruyter	en_US
dc.relation.ispartofseries	Journal of Mathematical Cryptology;Volume 15: Issue 1
dc.rights	Attribution-NonCommercial-ShareAlike 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/us/	*
dc.subject	Riemann zeta function	en_US
dc.subject	factorisation of RSA moduli	en_US
dc.subject	complex analysis	en_US
dc.subject	Research Subject Categories::MATHEMATICS	en_US
dc.title	FACTORING WITH HINTS	en_US
dc.type	Article	en_US
workflow.import.source	science