Central Library

Normal view MARC view ISBD view

A Course in Number Theory and Cryptography [electronic resource] / by Neal Koblitz.

By: Koblitz, Neal [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Graduate Texts in Mathematics: 114Publisher: New York, NY : Springer New York : Imprint: Springer, 1987Edition: 1st ed. 1987.Description: VIII, 208 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9781468403107.Subject(s): Number theory | Number TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 512.7 Online resources: Click here to access online
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 -- V. Primality and Factoring -- §1. Pseudoprimes -- §2. The rho method -- §3. Fermat factorization and factor bases -- §4. The continued fraction method -- VI. Elliptic Curves -- §1. Basic facts -- §2. Elliptic curve cryptosystems -- §3. Elliptic curve factorization -- Answers to Exercises.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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 -- V. Primality and Factoring -- §1. Pseudoprimes -- §2. The rho method -- §3. Fermat factorization and factor bases -- §4. The continued fraction method -- VI. Elliptic Curves -- §1. Basic facts -- §2. Elliptic curve cryptosystems -- §3. Elliptic curve factorization -- Answers to Exercises.

There are no comments for this item.

Log in to your account to post a comment.