Number Theory for Computing
Buch in deiner Nähe kaufen
Beschreibung
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, including electrical and electronic engineering, but will also be valuable to mathematics students interested in applications. It presupposes only high-shool math.
In this 2nd edition proofs of many theorems are added and some corrections are made.
This book provides a good introduction to the classical elementary number theory and the modern algorithmic number theory, and their applications in computing and information technology, including computer systems design, cryptography and network security. In this 2nd edition proofs of many theorems have been provided, further additions and corrections were made.
A good introduction to classical and modern number theory and its applications in computer science Self-contained source on number theory for computing professionals Useful for self-study or as class text and basic reference Only prerequisite is high-school math First edition released in 2000 In the second edition additional proofs of many theorems are provided, corrections and additions were made Includes supplementary material: sn.pub/extras
Autor*in
M.E. Hellmann
Themen in »Number Theory for Computing«
Prime algorithm algorithms cryptography hash function information information theory tar algorithm analysis and problem complexity
Stimmen zu »Number Theory for Computing«
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)
()