Books written by Leonard M. Adleman.
Turing Award winner of 2002 together with Adi Shamir and Ron Rivest for their ingenious contribution for making public-key cryptography useful in practice.
Primality Testing and Abelian Varieties Over Finite Fields
From Gauss to Gödel, mathematicians have sought an efficient algorithm to distinguish prime numbers from composite numbers. This book presents a random polynomial time algorithm for the problem.
