Journal article icon

Journal article

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.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1215/00127094-2856619

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Mathematical Institute
Oxford college:
Queens College
Role:
Author


Publisher:
Duke University Press
Journal:
Duke Mathematical Journal More from this journal
Volume:
164
Issue:
2
Pages:
235-275
Publication date:
2015-01-30
DOI:
ISSN:
0012-7094


Keywords:
Pubs id:
pubs:1049648
UUID:
uuid:a19fd25e-363c-4967-9fee-dbc475779897
Local pid:
pubs:1049648
Source identifiers:
1049648
Deposit date:
2019-09-25

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP