000			02072nam a2200361 4500
001			OTLid0000897
003			MnU
005			20201105133415.0
006			m o d s
008			200722s2017 mnu o 0 0 eng d
020			_a
040			_aMnU _beng _cMnU
050		4	_aQA37.3
245	0	4	_aThe Joy of Cryptography _cMike Rosulek
264		2	_bOpen Textbook Library
264		1	_bOregon State University
300			_a1 online resource
490	0		_aOpen textbook library.
505	0		_a0 Review of Concepts & Notation -- 1 One-Time Pad & Kerckhoffs' Principle -- 2 The Basics of Provable Security -- 3 Secret Sharing -- 4 Basing Cryptography on Intractable Computations -- 5 Pseudorandom Generators -- 6 Pseudorandom Functions & Block Ciphers -- 7 Security Against Chosen Plaintext Attacks -- 8 Block Cipher Modes of Operation -- 9 Chosen Ciphertext Attacks -- 10 Message Authentication Codes -- 11 Hash Functions -- 12 Authenticated Encryption & AEAD -- 13 RSA & Digital Signatures -- 14 Diffie-Hellman Key Agreement -- 15 Public-Key Encryption
520	0		_aThe pedagogical approach is anchored in formal definitions/proof of security, but in a way that I believe is more accessible than what is "traditional" in crypto. All security definitions are written in a unified and simplified "game-based" style. For an example of what security definitions look like in this style, see the index of security definitions (which will make more sense after reading chapters 2 & 4).
542	1		_fAttribution-NonCommercial-ShareAlike
546			_aIn English.
588	0		_aDescription based on online resource
650		0	_aMathematics _vTextbooks
650		0	_aCryptography _vTextbooks
700	1		_aRosulek, Mike _eauthor
710	2		_aOpen Textbook Library _edistributor
856	4	0	_uhttps://open.umn.edu/opentextbooks/textbooks/897 _zAccess online version
999			_c20233 _d20233