Number Theory for Computing / Edition 2by M.E. Hellmann, Song Y. Yan
Pub. Date: 06/10/2002
Publisher: Springer Berlin Heidelberg
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.
- Springer Berlin Heidelberg
- Publication date:
- Edition description:
- 2nd ed. 2002
- Product dimensions:
- 6.10(w) x 9.13(h) x 0.04(d)
Table of ContentsForeword by Martin E. Hellman.- Preface to the Second Edition.- Preface to the First Edition.- 1. Elementary Number Theory.- 2. Computational/Algorithmic Number Theory.- 3. Applied Number Theory.- Bibliography.- Index.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >