List of Figures

2.1 Model of Encryption for Confidentiality
5.1 First 300 Prime Numbers
5.2 Powers of Integers, modulo 7
5.3 Discrete Logs, modulo 7
5.4 Powers of Integers, modulo 17
5.5 Discrete Logarithms, modulo 17
6.1 Relative Frequency of Letters by Norvig
6.2 Relative Frequency of Digrams by Norvig
6.3 Relative Frequency of N-Grams by Norvig
7.1 Model of Encryption for Confidentiality
7.2 Symmetric Key Encryption for Confidentiality
7.3 Common Symmetric Key Block Ciphers
7.4 Block Cipher with n bit blocks
7.5 Simple Ideal 2-bit Block Cipher 1
7.6 Simple Ideal 2-bit Block Cipher 2
7.7 Simple Ideal 2-bit Block Cipher 2 (fixed)
7.8 Impact of Block Sizes for 80 bit Plaintext
7.9 Feistel Encryption and Decryption
7.10 Stream Cipher Encrypt and Decrypt
7.11 Paul Kocher and DeepCrack
7.12 COPACABANA by SciEngines, 2006
7.13 RIVYERA S3-5000 by SciEngines, 2013
7.14 Double Encryption Concept
7.15 Example 5-bit Block Cipher
7.16 Solution for Meet-in-the-Middle Attack
7.17 Performance for Meet-in-the-Middle Attack
7.18 Triple Encryption Concept
8.1 S-DES Key Generation and Encryption
8.2 S-DES Key Generation and Decryption
8.3 S-DES Round Function Details
8.4 General DES Encryption Algorithm
8.5 Initial Permutation Tables for DES
8.6 Calculation of F(R,K)
8.7 Permutation Tables for DES
8.8 Definition of DES S-Boxes 1 to 4
8.9 Definition of DES S-Boxes 5 to 6
8.10 DES Permutated Choice 1 and 2
8.11 DES Key Generation Schedule
8.12 DES Schedule of Left Shifts in Key Generation
9.1 S-AES Encryption
9.2 S-AES Decryption
9.3 S-AES Key Generation for Round 1
9.4 GF(

2^{4}

) Multiplication Table used in S-AES
11.1 ECB Encryption
11.2 ECB Decryption
11.3 CBC Encryption
11.4 CBC Decryption
11.5 CFB Encryption
11.6 CFB Decryption
11.7 OFB Encryption
11.8 OFB Decryption
11.9 CTR Encryption
11.10 CTR Decryption
12.1 Confidentiality with Public Key Crypto
13.1 RSA used for Confidentiality
13.2 RSA used for Authentication
14.1 Diffie–Hellman Key Exchange Example
14.2 Diffie–Hellman MITM Attack Example
15.1 Elliptic Curve for

y^{2} = x^{3} - 3 x + 5

15.2 Addition Operation on Elliptic Curve
15.3 Self Addition on Elliptic Curve
15.4 P + 2P on Elliptic Curve
15.5 NP on Elliptic Curve
16.1 Selected Cryptographic Hash Functions
17.1 Symmetric Encryption for Authentication
17.2 Authentication by Hash and then Encrypt
17.3 Authentication by Encrypting a Hash
17.4 Authentication with Hash of a Shared Secret
17.5 Authentication with only MACs
17.6 Digital Signature Example
18.1 Recommend Key Lengths from ECRYPT-CSA 2018
20.1 Scaling the classical number field sieve (NFS) vs. Shor’s quantum algorithm for factoring
20.2 Likelihood quantum computers significant threat to public-key cryptosystems
20.3 Quantum error rates vs qubits and intended direction of Google Quantum Research
20.4 Example of BB84 Quantum Key Distribution
B.1 International Reference Alphabet, or ASCII, Table in Decimal
B.2 International Reference Alphabet, or ASCII, Table in Binary
C.1 Diffie, Hellman and Merkle
C.2 Rivest, Shamir and Adleman
C.3 Alan Turing
C.4 Claude Shannon
C.5 Hedy Lamarr
C.6 Phil Zimmermann