Integer factoring and compositeness witnesses
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Mathematical Cryptology"
DOI: 10.1515/jmc-2019-0023
Abstract: Abstract We describe a reduction of the problem of factorization of integers n ≤ x in polynomial-time (log x)M+O(1) to computing Euler’s totient function, with exceptions of at most xO(1/M) composite integers that cannot be… read more here.
Keywords: log log; factoring compositeness; integers factored; log ... See more keywords