A course in number theory and cryptography
By: Neal Koblitz.
Edition: 2nd ed.
Series: Graduate texts in mathematics ;
Publisher: Springer-Verlag
Published: 1994
Place of publication: New York
Language: eng
Number of pages: 235
Subjects: Number theory; Cryptography
Notes: Includes bibliographical references and index.
Table of contents: label: Foreword
title: v; label: Preface to the Second Edition
title: vii; label: Chapter I. Some Topics in Elementary Number Theory
title: 1; label: 1. Time estimates for doing arithmetic
title: 1; label: 2. Divisibility and the Euclidean algorithm
title: 12; label: 3. Congruences
title: 19; label: 4. Some applications to factoring
title: 27; label: Chapter II. Finite Fields and Quadratic Residues
title: 31; label: 1. Finite fields
title: 33; label: 2. Quadratic residues and reciprocity
title: 42; label: Chapter III. Cryptography
title: 54; label: 1. Some simple cryptosystems
title: 54; label: 2. Enciphering matrices
title: 65; label: Chapter IV. Public Key
title: 83; label: 1. The idea of public key cryptography
title: 83; label: 2. RSA
title: 92; label: 3. Discrete log
title: 97; label: 4. Knapsack
title: 111; label: 5. Zero-knowledge protocols and oblivious transfer
title: 117; label: Chapter V. Primality and Factoring
title: 125; label: 1. Pseudoprimes
title: 126; label: 2. The rho method
title: 138; label: 3. Fermat factorization and factor bases
title: 143; label: 4. The continued fraction method
title: 154; label: 5. The quadratic sieve method
title: 160; label: Chapter VI. Elliptic Curves
title: 167; label: 1. Basic facts
title: 167; label: 2. Elliptic curve cryptosystems
title: 177; label: 3. Elliptic curve primality test
title: 187; label: 4. Elliptic curve factorization
title: 191; label: Answers to Exercises
title: 200; label: Index
title: 231