A Course in Number Theory and Cryptography. Second edition

Koblitz, Neal

ISBN 10: 0387942939 / ISBN 13: 9780387942933

Editore: Springer, 1994

Riguardo questo articolo

*Price HAS BEEN REDUCED by 10% until Monday, Oct. 13 (weekend SALE item)* 2nd edition; 235 pp., Hardcover, NEW!! - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Codice articolo ZB1334470

Dati bibliografici

• Titolo: A Course in Number Theory and Cryptography. Second edition
• Editore: Springer
• Data di pubblicazione: 1994
• Lingua: Inglese
• ISBN 10: 0387942939
• ISBN 13: 9780387942933
• Rilegatura: Rilegato
• Edizione: seconda edizione
• Condizione: New

Descrizione articolo

Riassunto

The purpose of this book is to introduce the reader to arithmetic topics, both ancient and modern, that have been at the center of interest in applications of number theory, particularly in cryptography. 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, emphasizing estimates of the efficiency of the techniques that arise from the theory. A special feature is the inclusion of recent application of the theory of elliptic curves. Extensive exercises and careful answers have been included in all of the chapters. Because number theory and cryptography are fast-moving fields, this new edition contains substantial revisions and updated references.

Contenuti

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