Primality Testing in Polynomial Time: From Randomized Algorithms to “PRIMES Is in P”

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 3000

ISBN: 9783540403449, 9783540259336, 3540403442

Size: 976 kB (999650 bytes)

Pages: 150/152

File format:

Language:

Publishing Year:

Category: Tags: , , , , ,

Martin Dietzfelbinger (auth.)9783540403449, 9783540259336, 3540403442

On August 6, 2002,a paper with the title “PRIMES is in P”, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the “primality problem”hasa“deterministic algorithm” that runs in “polynomial time”. Finding out whether a given number n is a prime or not is a problem that was formulated in ancient times, and has caught the interest of mathema- ciansagainandagainfor centuries. Onlyinthe 20thcentury,with theadvent of cryptographic systems that actually used large prime numbers, did it turn out to be of practical importance to be able to distinguish prime numbers and composite numbers of signi?cant size. Readily, algorithms were provided that solved the problem very e?ciently and satisfactorily for all practical purposes, and provably enjoyed a time bound polynomial in the number of digits needed to write down the input number n. The only drawback of these algorithms is that they use “randomization” — that means the computer that carries out the algorithm performs random experiments, and there is a slight chance that the outcome might be wrong, or that the running time might not be polynomial. To ?nd an algorithmthat gets by without rand- ness, solves the problem error-free, and has polynomial running time had been an eminent open problem in complexity theory for decades when the paper by Agrawal, Kayal, and Saxena hit the web.

Table of contents :
Front Matter….Pages –
1. Introduction: Efficient Primality Testing….Pages 1-12
2. Algorithms for Numbers and Their Complexity….Pages 13-21
3. Fundamentals from Number Theory….Pages 23-53
4. Basics from Algebra: Groups, Rings, and Fields….Pages 55-71
5. The Miller-Rabin Test….Pages 73-84
6. The Solovay-Strassen Test….Pages 85-94
7. More Algebra: Polynomials and Fields….Pages 95-114
8. Deterministic Primality Testing in Polynomial Time….Pages 115-131
A. Appendix….Pages 133-142
Back Matter….Pages –

Reviews

There are no reviews yet.

Be the first to review “Primality Testing in Polynomial Time: From Randomized Algorithms to “PRIMES Is in P””
Shopping Cart
Scroll to Top