Number Theory for Computing

Features

• Cover Type: Hard Cover with 445 pages
• Published by: Springer
• Edition: 2nd Edition June 10, 2002
• Written in: English
• ISBN 10 Number: 3540430725
• ISBN 13 Number: 978-3540430728
• Book Dimensions: 9.4 x 6.4 x 0.9 inches
• Weighs: 1.7 pounds

Product Review


From the reviews of the second edition:

"This book gives a profound and detailed insight at an undergraduate level in abstract and computational number theory as well as in applications in computing and cryptography. … The author has done a lot of work in providing a plenty of examples, in adding many historical comments including sketchy biographies … and in presenting the whole topic in a very accessible style. So the book can be recommended warmly for the laymen as well as for the mathematician without experience in applied number theory." (G. Kowol, Monatshefte für Mathematik, Vol. 140 (4), 2003)

Product Description
There are many surprising connections between the theory of numbers, which is one of the oldest branches of mathematics, and computing and information theory. Number theory has important applications in computer organization and security, coding and cryptography, random number generation, hash functions, and graphics. Conversely, number theorists use computers in factoring large integers, determining primes, testing conjectures, and solving other problems. This book takes the reader from elementary number theory, via algorithmic number theory, to applied number theory in computer science. It introduces basic concepts, results, and methods, and discusses their applications in the design of hardware and software, cryptography, and security. It is aimed at undergraduates in computing and information technology, but will also be valuable to mathematics students interested in applications. In this 2nd edition full proofs of many theorems are added and some corrections are made.

Reader Reviews
This review is from: Number Theory for Computing (Hardcover) I just picked this monograph up at the Crypto-2000 conference at UCSB. It is an unassuming, straight forward walk through the elements of computational number theory. The author claims all that is required is high school math; however, once cracking the book open the reader finds that the material is more directed at the advanced undergraduate, or even the graduate math student, computer scientist, or to he/she who wants a singular experience in good mathematics. For example, there are side bars that touch on some of the very brightest of the number theory elite; providing much needed insight as to their motivations and pursuits of attack. Many a complicated concept is rendered harmless and fashioned readily available for the learned reader. It is the kind of book that you can not put down. I passed it around to a few of my colleaques; the book quickly became a pleasent read for them followed up by a request to forward the ISBN number to their email accounts. The author knows the crafts of both writing well and displaying the beauty of number theory. Lastly, the technical content is not watered down, the author maintains academic discipline while making anecdotal information available via side-bars. Otherwise, the inspired reader would have to track down a text on the history of mathematics to sort out the 'story' behind the insights. Instead it is "all" there for you to consider or mark for a later read.