Yet Another Introductory Number Theory Textbook (Cryptology Emphasis Version)

This version of YAINTT has a particular emphasis on connections to cryptology. The cryptologic material appears in Chapter 4 and §§5.5 and 5.6, arising naturally (I hope) out of the ambient number theory. The main cryptologic applications – being the RSA cryptosystem, Diffie-Hellman key exchange, an...

Full description

Saved in:
Bibliographic Details
Main Author: Poritz, Jonathan A. (Author)
Format: Electronic eBook
Language:English
Published: Pueblo, Colorado Jonathan Poritz [2014]
Series:Open textbook library.
Subjects:
Online Access:Access online version
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000nam a2200000 i 4500
001 OTLid0000673
003 MnU
005 20240122145216.0
006 m o d s
007 cr
008 190224s2014 mnu o 0 0 eng d
040 |a MnU  |b eng  |c MnU 
050 4 |a QA37.3 
245 0 0 |a Yet Another Introductory Number Theory Textbook (Cryptology Emphasis Version)  |c Jonathan Poritz 
264 2 |a Minneapolis, MN  |b Open Textbook Library 
264 1 |a Pueblo, Colorado  |b Jonathan Poritz  |c [2014] 
264 4 |c ©2014. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 0 |a Open textbook library. 
505 0 |a Chapter 1: Well-Ordering and Division -- Chapter 2: Congruences -- Chapter 3: Prime Numbers -- Chapter 4: Cryptology -- Chapter 5: Indices = Discrete Logarithms 
520 0 |a This version of YAINTT has a particular emphasis on connections to cryptology. The cryptologic material appears in Chapter 4 and §§5.5 and 5.6, arising naturally (I hope) out of the ambient number theory. The main cryptologic applications – being the RSA cryptosystem, Diffie-Hellman key exchange, and the ElGamal cryptosystem – come out so naturally from considerations of Euler’s Theorem, primitive roots, and indices that it renders quite ironic G.H. Hardy’s assertion [Har05] of the purity and eternal inapplicability of number theory. Note, however, that once we broach the subject of these cryptologic algorithms, we take the time to make careful definitions for many cryptological concepts and to develop some related ideas of cryptology which have much more tenuous connections to the topic of number theory. This material therefore has something of a different flavor from the rest of the text – as is true of all scholarly work in cryptology (indeed, perhaps in all of computer science), which is clearly a discipline with a different culture from that of “pure”mathematics. Obviously, these sections could be skipped by an uninterested reader, or remixed away by an instructor for her own particular class approach. 
542 1 |f Attribution-ShareAlike 
546 |a In English. 
588 0 |a Description based on print resource 
650 0 |a Applied mathematics  |v Textbooks 
650 0 |a Cryptography  |v Textbooks 
700 1 |a Poritz, Jonathan A.  |e author 
710 2 |a Open Textbook Library  |e distributor 
856 4 0 |u https://open.umn.edu/opentextbooks/textbooks/673  |z Access online version