Primality Testing and Abelian Varieties Over Finite Fields [Paperback]

From Gauss to G|del, mathematicians have sought an efficientalgorithm to distinguish prime numbers from compositenumbers. This book presents a random polynomial timealgorithm for the problem. The methods used are fromarithmetic algebraic geometry, algebraic number theory andanalyticnumber theory. In particular, the theory of twodimensional Abelian varieties over finite fields isdeveloped.The book will be of interest to both researchers andgraduate students in number theory and theoretical computerscience.From Gauss to G|del, mathematicians have sought an efficientalgorithm to distinguish prime numbers from compositenumbers. This book presents a random polynomial timealgorithm for the problem. The methods used are fromarithmetic algebraic geometry, algebraic number theory andanalyticnumber theory. In particular, the theory of twodimensional Abelian varieties over finite fields isdeveloped.The book will be of interest to both researchers andgraduate students in number theory and theoretical computerscience.Acknowledgement.- Overview of the algorithm and the proof of the main theorem.- Reduction of main theorem to three propositions.- Proof of proposition 1.- Proof of proposition 2.- Proof of proposition 3.Springer Book ArchivesDE