Primality Testing in Polynomial Time

丛 书 名：Lecture Notes in Computer Science

版本说明：1

作     者：Martin Dietzfelbinger 

I S B N：(纸本) 9783540403449 

出 版 社：Springer Berlin  Heidelberg 

出 版 年：1000年

页      数：X, 150页

主 题 词：Number Theory Algebra Algorithm Analysis and Problem Complexity Computation by Abstract Devices Cryptology Probability and Statistics in Computer Science 

摘      要：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 problemhasa“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.