Yet Another Introductory Number Theory Textbook (Cryptology Emphasis Version) (Record no. 362)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02042nam a2200217 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | UUN-OA-673 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20260922220311.0 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Jonathan A. Poritz |
| 245 10 - TITLE STATEMENT | |
| Title | Yet Another Introductory Number Theory Textbook (Cryptology Emphasis Version) |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Name of producer, publisher, distributor, manufacturer | Jonathan Poritz |
| Date of production, publication, distribution, manufacture, or copyright notice | 2014 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | 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. |
| 540 ## - TERMS GOVERNING USE AND REPRODUCTION NOTE | |
| Terms governing use and reproduction | Attribution-ShareAlike |
| 650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer Science - Cryptography |
| 650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Mathematics - Applied |
| 650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | B. Sc. Artificial Intelligence |
| Source of heading or term | local |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://open.umn.edu/opentextbooks/textbooks/yet-another-introductory-number-theory-textbook-cryptology-emphasis-version">https://open.umn.edu/opentextbooks/textbooks/yet-another-introductory-number-theory-textbook-cryptology-emphasis-version</a> |
| Link text | Access resource and available formats |
No items available.