## Duke Mathematical Journal

### Detecting squarefree numbers

#### Abstract

We present an algorithm, based on the explicit formula for $L$-functions and conditional on the generalized Riemann hypothesis, 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 several RSA challenge numbers are not squarefull.

#### Article information

Source
Duke Math. J., Volume 164, Number 2 (2015), 235-275.

Dates
First available in Project Euclid: 30 January 2015

https://projecteuclid.org/euclid.dmj/1422627048

Digital Object Identifier
doi:10.1215/00127094-2856619

Mathematical Reviews number (MathSciNet)
MR3306555

Zentralblatt MATH identifier
06416948

#### Citation

Booker, Andrew R.; Hiary, Ghaith A.; Keating, Jon P. Detecting squarefree numbers. Duke Math. J. 164 (2015), no. 2, 235--275. doi:10.1215/00127094-2856619. https://projecteuclid.org/euclid.dmj/1422627048

#### References

• [1] M. Ajtai, “The shortest vector problem in $L_{2}$ is $NP$-hard for randomized reductions (extended abstract)” in STOC’98 Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, ACM Digital Library, New York, 1998, 10–19.
• [2] G. B. Arous and P. Bourgade, Extreme gaps between eigenvalues of random matrices, Ann. Probab. 41 (2013), 2648–2681.
• [3] E. L. Basor and T. Ehrhardt, Asymptotic formulas for determinants of a sum of finite Toeplitz and Hankel matrices, Math. Nachr. 228 (2001), 5–45.
• [4] B. Conrey, “Notes on eigenvalue distributions for the classical compact groups” in Recent Perspectives in Random Matrix Theory and Number Theory, London Math. Soc. Lecture Note Ser. 322, Cambridge Univ. Press, Cambridge, 2005, 111–145.
• [5] E. Costa and D. Harvey, Faster deterministic integer factorization, Math. Comp. 83 (2014), 339–345.
• [6] H. Davenport, Multiplicative Number Theory, 3rd ed., Graduate Texts in Math. 74, Springer, New York, 2000.
• [7] P. Deift, A. Its, and I. Krasovsky, Asymptotics of Toeplitz, Hankel, and Toeplitz+Hankel determinants with Fisher-Hartwig singularities, Ann. of Math. (2) 174 (2011), 1243–1299.
• [8] P. Deift, A. Its, I. Krasovsky, and X. Zhou, The Widom-Dyson constant for the gap probability in random matrix theory, J. Comput. Appl. Math. 202 (2007), 26–47.
• [9] A. Fujii, On the zeros of Dirichlet $L$-functions, V, Acta Arith. 28 (1975/76), 395–403.
• [10] GMP-ECM, http://ecm.gforge.inria.fr/ (accessed 1 December 2014).
• [11] GNU Linear Programming Kit, http://www.gnu.org/software/glpk/ (accessed 1 December 2014).
• [12] J. Kaczorowski and A. Perelli, On the structure of the Selberg class, I: $0\leq d\leq1$, Acta Math. 182 (1999), 207–241.
• [13] N. M. Katz and P. Sarnak, Random matrices, Frobenius eigenvalues, and monodromy, Amer. Math. Soc. Colloq. Pub., 45, Amer. Math. Soc., Providence, 1999.
• [14] N. M. Katz and P. Sarnak, Zeroes of zeta functions and symmetry, Bull. Amer. Math. Soc. (N.S.) 36 (1999), 1–26.
• [15] I. Krasikov, Uniform bounds for Bessel functions, J. Appl. Anal. 12 (2006), 83–91.
• [16] I. V. Krasovsky, Gap probability in the spectrum of random matrices and asymptotics of polynomials orthogonal on an arc of the unit circle, Int. Math. Res. Not. (2004), no. 25, 1249–1272.
• [17] Y. Lamzouri, X. Li, and K. Soundararajan, The least quadratic non-residue, values of $L$-functions at $s=1$, and related problems, preprint, arXiv:1309.3595v1 [math.NT].
• [18] A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.
• [19] R. Martin, Bandlimited functions, curved manifolds, and self-adjoint extensions of symmetric operators, Ph.D. thesis, University of Waterloo, Waterloo Ont., Canada, 2008.
• [20] M. Lal Mehta, Random Matrices, 3rd ed., Pure and Appl. Math. 142, Elsevier/Academic, Amsterdam, 2004.
• [21] H. L. Montgomery and A. M. Odlyzko, Large deviations of sums of independent random variables, Acta Arith. 49 (1988), 427–434.
• [22] A. M. Odlyzko, On the distribution of spacings between zeros of the zeta function, Math. Comp. 48 (1987), 273–308.
• [23] A. M. Odlyzko and H. J. J. te Riele, Disproof of the Mertens conjecture, J. Reine Angew. Math. 357 (1985), 138–160.
• [24] S. Omar, “Non-vanishing of Dirichlet $L$-functions at the central point” in Algorithmic Number Theory, Lecture Notes in Comput. Sci. 5011, Springer, Berlin, 2008, 443–453.
• [25] J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc. 76 (1974), 521–528.
• [26] M. Rubinstein, Low-lying zeros of $L$-functions and random matrix theory, Duke Math. J. 109 (2001), 147–181.
• [27] M. Rubinstein and P. Sarnak, Chebyshev’s bias, Experiment. Math. 3 (1994), 173–197.
• [28] E. Saias and A. Weingartner, Zeros of Dirichlet series with periodic coefficients, Acta Arith. 140 (2009), 335–344.
• [29] K. Soundararajan, Degree 1 elements of the Selberg class, Expo. Math. 23 (2005), 65–70.
• [30] V. Strassen, Einige Resultate über Berechnungskomplexität, Jber. Deutsch. Math.-Verein. 78 (1976/77), no. 1, 1–8.
• [31] M. N. S. Swamy, Further properties of Morgan-Voyce polynomials, Fibonacci Quart. 6 (1968), 167–175.