Projects per year
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.
- 11Y16: Algorithms; complexity [See also 68Q25]
- 11M06: ζ(s) and L(s,χ)
- 11Y35: Analytic computations
- 11M50: Relations with random matrices
FingerprintDive into the research topics of 'Detecting squarefree numbers'. Together they form a unique fingerprint.
- 2 Finished
1/10/09 → 1/04/15