×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

A Course in Number Theory and Cryptography / Edition 2
     

A Course in Number Theory and Cryptography / Edition 2

by Neal Koblitz
 

See All Formats & Editions

ISBN-10: 1461264421

ISBN-13: 9781461264422

Pub. Date: 12/31/2012

Publisher: Springer New York

This is a substantially revised and updated introduction to arithmetic topics, both ancient and modern, that have been at the centre of interest in applications of number theory, particularly in cryptography. As such, no background in algebra or number theory is assumed, and the book begins with a discussion of the basic number theory that is needed. The approach

Overview

This is a substantially revised and updated introduction to arithmetic topics, both ancient and modern, that have been at the centre of interest in applications of number theory, particularly in cryptography. As such, no background in algebra or number theory is assumed, and the book begins with a discussion of the basic number theory that is needed. The approach taken is algorithmic, emphasising estimates of the efficiency of the techniques that arise from the theory, and one special feature is the inclusion of recent applications of the theory of elliptic curves. Extensive exercises and careful answers are an integral part all of the chapters.

Product Details

ISBN-13:
9781461264422
Publisher:
Springer New York
Publication date:
12/31/2012
Series:
Graduate Texts in Mathematics Series , #114
Edition description:
Softcover reprint of the original 2nd ed. 1994
Pages:
235
Product dimensions:
6.10(w) x 9.10(h) x 0.60(d)

Related Subjects

Table of Contents

I. Some Topics in Elementary Number Theory.- 1. Time estimates for doing arithmetic.- 2. Divisibility and the Euclidean algorithm.- 3. Congruences.- 4. Some applications to factoring.- II. Finite Fields and Quadratic Residues.- 1. Finite fields.- 2. Quadratic residues and reciprocity.- III. Cryptography.- 1. Some simple cryptosystems.- 2. Enciphering matrices.- IV. Public Key.- 1. The idea of public key cryptography.- 2. RSA.- 3. Discrete log.- 4. Knapsack.- 5 Zero-knowledge prools and oblivious transfer.- V. Primality and Factoring.- 1. Pseudoprimes.- 2. The rho method.- 3. Fermat factorization and factor bases.- 4. The continued fraction method.- 5. The quadratic sieve method.- VI. Elliptic Curves.- 1. Basic facts.- 2. Elliptic curve cryptosystems.- 3. Elliptic curve primality test.- 4. Elliptic curve factorization.- Answers to Exercises.

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews