Friday, April 26, 2013

1304.6937 (Andrew R. Booker et al.)

Detecting squarefree numbers    [PDF]

Andrew R. Booker, Ghaith A. Hiary, Jon P. Keating
We present an algorithm, based on the explicit formula for $L$-functions and conditional on GRH, for proving that a given integer is squarefree with little or no knowledge of its factorization. We analyze the algorithm both theoretically and practically, and use it to prove that {\tt RSA-210} is not squarefull.
View original: http://arxiv.org/abs/1304.6937

No comments:

Post a Comment