000			01461nam a2200241Ia 4500
003			OSt
005			20220418125828.0
008			220128s9999 xx 000 0 und d
020			_a9781461264422
040			_cCUS
082			_a512.7 _bKOB/G
100			_aKoblitz, Neal _96664
245		2	_aA course in Number Theory and Cryptography
250			_a2nd, ed.
260			_aNew York: _bSpringer, _c1994.
300			_avii,235p.
505			_a 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.
650			_aNumber theory. _96668
650			_aThéorie des nombres. _96669
650			_aCryptography. _96670
942			_2ddc _cWB16
947			_a3474
999			_c211906 _d211906