[工程科技]CyclotomyprimalityproofsandtheircertificatesMathematicaGoettingensis.pdfVIP

Elle est a` toi cette chanson Toi l’professeur qui sans fa¸con, As ouvert ma petite th`ese 1 Quand mon espoir manquait de braise . To the memory of Manuel Bronstein CYCLOTOMY PRIMALITY PROOFS AND THEIR CERTIFICATES ˘ PREDA MIHAILESCU Abstract. 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 2006. Contents 1. Introduction 2 1.1. Some notations 5 2. Galois extensions of rings and cyclotomy 5 2.1. Finding Roots in Cyclotomic Extensions 11 2.2. Finding Roots of Unity and the Lucas – Lehmer Test 12 3. Gauss and Jacobi sums over Cyclotomic Extensions of Rings 14 4. Further Criteria for Existence of Cyclotomic Extensions 17 5. Certification