Detecting squarefree numbers
From MaRDI portal
Publication:2263800
DOI10.1215/00127094-2856619zbMATH Open1395.11139arXiv1304.6937OpenAlexW2056341328MaRDI QIDQ2263800
Author name not available (Why is that?)
Publication date: 19 March 2015
Published in: (Search for Journal in Brave)
Abstract: We present an algorithm, based on the explicit formula for -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 several RSA challenge numbers are not squarefull.
Full work available at URL: https://arxiv.org/abs/1304.6937
No records found.
No records found.
This page was built for publication: Detecting squarefree numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263800)
