Author | Adleman, Leonard M. author |
---|---|

Title | Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] / by Leonard M. Adleman, Ming-Deh A. Huang |

Imprint | Berlin, Heidelberg : Springer Berlin Heidelberg, 1992 |

Connect to | http://dx.doi.org/10.1007/BFb0090185 |

Descript | VIII, 144 p. online resource |

SUMMARY

From Gauss to G el, 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

CONTENT

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

Mathematics
Arithmetic and logic units Computer
Computers
Number theory
Combinatorics
Mathematics
Number Theory
Theory of Computation
Combinatorics
Arithmetic and Logic Structures