Number Theory for Computing

Song Y. Yan

436 pages, parution le 06/05/2002 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

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.

Contents

Foreword 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.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Song Y. Yan
Parution	06/05/2002
Édition	2^eme édition
Nb. de pages	436
Format	16 x 24
Couverture	Relié
Poids	777g
Intérieur	Noir et Blanc
EAN13	9783540430728