Primality Testing in Polynomial Time
| Author | : Martin Dietzfelbinger |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 153 |
| Release | : 2004-06-29 |
| ISBN-10 | : 9783540403449 |
| ISBN-13 | : 3540403442 |
| Rating | : 4/5 (442 Downloads) |
Download or read book Primality Testing in Polynomial Time written by Martin Dietzfelbinger and published by Springer Science & Business Media. This book was released on 2004-06-29 with total page 153 pages. Available in PDF, EPUB and Kindle. Book excerpt: A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers 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 volume is written for students of computer science, in particular 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.
