Customer Reviews

Prime Numbers and Computer Methods for Factorization (Progress in Mathematics)

5 star:		(2)
4 star:		(0)
3 star:		(0)
2 star:		(0)
1 star:		(0)

 

 

Excellent book published on primes, primality proving and numbers factoring. The book are written for mathematicians not computer security professionals, have sections on public keys and Pascal code for various factorization methods. There are seven chapters and there are nine appendices. The book begins with a good introduction the concept of a prime number and the prime number theorem. The chapters deal with fundamental problems: The Number of Primes Below a Given Limit, Subtleties in the Distribution of Primes, The Recognition of Primes and Methods of Factorization.The factoring methods is broken into two chapters, one on classical method and one on modern methods. The seventh chapter is a short presentation on RSA cryptosystem. The second half of the book is split between the appendices and the tables. The tables are composed of primes, factors in many formats, quadratic residues and formulas for cyclotomic polynomials. There is also an appendix devoted to elliptic curves.

I will be pleased if in a next edition a diskette with the programs of examples is included.

I think this is an excellent book as well. I bought it soon after it came out and read it. I was impressed. It has been impressive enough to stay on my bookshelf since the. Just today, I had to look up some information on factoring and remembered what a great book it is -- so I am leaving a review here. The only thing is that the code is in Pascal, which is not bad, but not like C++ or Java. Still, the book is detailed and informative.