Primality Testing in Polynomial Time

From Randomized Algorithms to

Martin Dietzfelbinger - Collection Lecture Notes in Computer Science

150 pages, parution le 09/07/2004

Ajouter à une liste

Indisponible

Résumé

This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite.

The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number of digits needed to write n, are important for theoretical computer science and for applications in algorithmics and cryptology.

This book gives a self-contained account of theoretically and practically important efficient algorithms for the primality problem, covering the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as the recent deterministic algorithm of Agrawal, Kayal, and Saxena. The textbook is written for students of computer science, in particular for those with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.

Written for:
Graduate and undergraduate students, lecturers, researchers

Sommaire

Efficient primality testing
Algorithms for numbers and their complexity
Fundamentals from number theory
Basics from algebra: groups, rings, and fields
The Miller-Rabin Test
The Soloyvay-Strassen Test
More algebra: polynomials and fields
Deterministic primality testing in polynomial time
Appendix

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Martin Dietzfelbinger
Collection	Lecture Notes in Computer Science
Parution	09/07/2004
Nb. de pages	150
Format	15,5 x 23,5
Couverture	Broché
Poids	250g
Intérieur	Noir et Blanc
EAN13	9783540403449