Cyclotomy Primality Proofs and their Certificates

Simple item page
dc.creatorMihailescu, Preda
dc.date2007-09-26
dc.date.accessioned2026-07-07T08:32:17Z
dc.date.available2026-07-07T08:32:17Z
dc.descriptionThe first efficient general primality proving method was proposed in the year 1980 by Adleman, Pomerance and Rumely and it used Jacobi sums. The method was further developed by H. W. Lenstra Jr. and more of his students and the resulting primality proving algorithms are often referred to under the generic name of Cyclotomy Primality Proving (CPP). In the present paper we give an overview of the theoretical background and implementation specifics of CPP, such as we understand them in the year 2007.
dc.identifierhttps://arxiv.org/abs/0709.4112
dc.identifierhttp://arxiv.org/abs/0709.4112
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138753
dc.subjectNumber Theory
dc.subject11Y11
dc.titleCyclotomy Primality Proofs and their Certificates
dc.typetext

Files

Collections

arXiv