A Course in Number Theory and Cryptography

Neal Koblitz - Collection Graduate Texts in Mathematics

234 pages, parution le 10/09/1994 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

A mathematical discourse on cryptography, covering the mathematical proofs and theories behind many current public key crypto-systems. Discusses topics such as quadratic residues, pseudo-primes, and congruences. Brief mathematical treatises on RSA, discrete logs, knapsacks, and zero-knowledge protocols are offered as well as on factoring methods and primality. Continued fraction and quadratic sieve methods are discussed briefly. The system most thoroughly covered is the elliptic curve system, to which an entire chapter is devoted, compared to a few pages for most of the other topics covered. This book is written in condensed mathematical language and is aimed at mathematicians, not algorithm designers.

Sommaire

Some Topics in Elementary Number Theory
Finite Fields and Quadratic Residues
Cryptography
Public Key
Primality and Factoring
Elliptic Curves

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Neal Koblitz
Collection	Graduate Texts in Mathematics
Parution	10/09/1994
Édition	2^eme édition
Nb. de pages	234
Format	16 x 24
Couverture	Broché
Poids	518g
Intérieur	Noir et Blanc
EAN13	9780387942933
ISBN13	978-0-387-94293-3