Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P

by Martin Dietzfelbinger

Book Overview

A self-contained treatment 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 volume is written for students of computer science, in particular those with a special interest in cryptology, and students of mathematics. The text may be used...

• Format: Paperback
• Language: English
• ISBN: 1904501192
• ISBN13: 9783540403449
• Release Date: June 2004
• Publisher: Springer
• Length: 150 Pages
• Weight: 0.55 lbs.
• Dimensions: 0.4" x 6.2" x 9.3"