割圆素性证明及其证明
Cyclotomy Primality Proofs and their Certificates
摘要：
第一个有效的一般素性证明方法是在1980年由Adleman，Pomerance和Rumely提出的，它使用Jacobi和。H. W.小伦斯特拉和他的学生和由此产生的素性证明算法通常被称为通用名称的割圆素性证明（CPP）。本文以2007年为例，对CPP的理论背景和实施细节进行了概述。
英文摘要：
The 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
