Primality Testing and Abelian Varieties Over Finite Fields

1992
ISBN: 978-3-540-55308-3
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1512, 144 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 242 g

Reihe: Lecture Notes in Mathematics

From Gauss to G del, mathematicians have sought an efficient
algorithm to distinguish prime numbers from composite
numbers. This book presents a random polynomial time
algorithm for the problem. The methods used are from
arithmetic algebraic geometry, algebraic number theory and
analyticnumber theory. In particular, the theory of two
dimensional Abelian varieties over finite fields is
developed.
The book will be of interest to both researchers and
graduate students in number theory and theoretical computer
science.

Zielgruppe

Research

Autoren/Hrsg.

Huang, Ming-Deh A.

Adleman, Leonard M.

Fachgebiete

• Mathematik | Informatik Mathematik Algebra Zahlentheorie
• Mathematik | Informatik Mathematik Algebra Algebraische Strukturen, Gruppentheorie
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

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.