1

SECURITY IN COMPUTING,
FIFTH EDITION
Cryptography
 2

Problems Addressed by Encryption

• Suppose a sender wants to send a message to a recipient. An
attacker may attempt to
• Block the message
• Intercept the message
• Modify the message
• Fabricate an authentic-looking alternate message
 3

Encryption Terminology
• Sender
• Recipient
• Transmission medium
• Interceptor/intruder
• Encrypt, encode, or encipher
• Decrypt, decode, or decipher
• Cryptosystem
• Plaintext
• Ciphertext
 4

A history of encryption
 5

Encryption/Decryption Process

Key Key
(Optional) (Optional)

Original
Plaintext Encryption Ciphertext Decryption
Plaintext
 6

Symmetric vs. Asymmetric

Key

Original
Plaintext Encryption Ciphertext Decryption
Plaintext

(a) Symmetric Cryptosystem

Encryption Decryption
Key Key

Original
Plaintext Encryption Ciphertext Decryption
Plaintext

(b) Asymmetric Cryptosystem

From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
 7

Stream Ciphers

Key
(Optional)

…ISSOPMI wdhuw…
Plaintext Encryption Ciphertext
 8

Block Ciphers
Key
(Optional)
.. XN OI TP ES

Plaintext IH Ciphertext
Encryption

po
ba
qc
kd
em
..
 Diffusion
• The idea of diffusion is to hide the relationship between
the ciphertext and the plaintext.
• In diffusion, the statistical structure of the plaintext is
dissipated into long range statistics of the ciphertext.
• Each plaintext digit affects the value of many ciphertext
digits
Note
Diffusion hides the relationship between the ciphertext
5.9
and the plaintext.
 Confusion
• The idea of confusion is to hide the relationship
between the ciphertext and the key.

• Confusion seeks to make the relationship between the

statistics of ciphertext and the value of the encryption
key as complex as possible.
Note
Confusion hides the relationship between the
ciphertext and the key.
5.10
 11

Stream vs. Block

Stream Block
Advantages  Speed of  High diffusion
transformation  Immunity to
 Low error insertion of
propagation symbol

Disadvantages  Low diffusion  Slowness of

 Susceptibility to encryption
malicious  Padding
insertions and  Error
modifications propagation
 12

DES: The Data Encryption Standard

• Symmetric block cipher
• Developed in 1976 by IBM for the US National Institute of Standards and
Technology (NIST)
 6.13

DES is a block cipher, as shown in Figure.

Figure Encryption and decryption with DES

6.14

Triple DES
Figure Triple DES with two keys
 6.15
Continue

Figure General structure of DES

6.16

Initial and Final Permutations

Figure Initial and final permutation steps in DES
6.17
Continue

Table Initial and final permutation tables

 6.18

Rounds
DES uses 16 rounds. Each round of DES is a Feistel cipher.

Figure
A round in DES
(encryption site)
 6.19
Continued
DES Function
The heart of DES is the DES function. The DES function applies a 48-bit
key to the rightmost 32 bits to produce a 32-bit output.

Figure
DES function
 6.20
Continue

Expansion P-box
Since RI−1 is a 32-bit input and KI is a 48-bit key, we first need to expand
RI−1 to 48 bits.

Figure Expansion permutation

 6.21
Continue

Although the relationship between the input and output can be defined
mathematically, DES uses Table 6.2 to define this P-box.

Table Expansion P-box table

 6.22
Continue

Whitener (XOR)
After the expansion permutation, DES uses the XOR operation on the
expanded right section and the round key. Note that both the right section
and the key are 48-bits in length. Also note that the round key is used only
in this operation.
 6.23
Continue

S-Boxes
The S-boxes do the real mixing (confusion). DES uses 8 S-boxes, each with
a 6-bit input and a 4-bit output. See Figure 6.7.

Figure 6.7 S-boxes

6.24
Continue

Figure 6.8 S-box rule

 6.25
Continue
Table 6.3 shows the permutation for S-box 1. For the rest of the boxes see
the textbook.

Table 6.3 S-box 1

 6.26
Continued
Example 6.3

The input to S-box 1 is 100011. What is the output?

Solution

If we write the first and the sixth bits together, we get 11 in binary, which is 3 in
decimal. The remaining bits are 0001 in binary, which is 1 in decimal. We look for the
value in row 3, column 1, in Table 6.3 (S-box 1). The result is 12 in decimal, which in
binary is 1100. So the input 100011 yields the output 1100.
 6.27
Continued
Example 6.4

The input to S-box 8 is 000000. What is the output?

Solution

If we write the first and the sixth bits together, we get 00 in binary, which is 0 in
decimal. The remaining bits are 0000 in binary, which is 0 in decimal. We look for the
value in row 0, column 0, in Table 6.10 (S-box 8). The result is 13 in decimal, which is
1101 in binary. So the input 000000 yields the output 1101.
 6.28
Continue

Straight Permutation

Table 6.11 Straight permutation table

 6.29
Cipher and Reverse Cipher

Using mixers and swappers, we can create the cipher and reverse cipher,
each having 16 rounds.

First Approach
To achieve this goal, one approach is to make the last round (round 16)
different from the others; it has only a mixer and no swapper.

Note

In the first approach, there is no swapper in the last round.

6.30
Continued
Figure DES cipher and reverse cipher for the first approach
 6.31
6.2.3 Continued

Alternative Approach
We can make all 16 rounds the same by including one swapper to the 16th
round and add an extra swapper after that (two swappers cancel the effect of
each other).

Key Generation
The round-key generator creates sixteen 48-bit keys out of a 56-bit cipher
key.
6.32
Continued

Figure 6.10
Key generation
6.33
Continued

Table 6.12 Parity-bit drop table

Table 6.13 Number of bits shifts

6.34
Continued

Table 6.14 Key-compression table

 6.35
Examples
Example 6.5

We choose a random plaintext block and a random key, and determine what the
ciphertext block would be (all in hexadecimal):

Table 6.15 Trace of data for Example 6.5

6.36
6.2.4 Continued
Example 6.5 Continued

Table 6.15 Trace of data for Example 6.5 (Conintued

 6.37
6.2.4 Continued
Example 6.6

Let us see how Bob, at the destination, can decipher the ciphertext received from Alice
using the same key. Table 6.16 shows some interesting points.
Strength of DES – Key Size
• 56-bit keys have 256 = 7.2 x 1016 values
• brute force search looks hard
• recent advances have shown is possible
• in 1997 on Internet in a few months
• in 1998 on dedicated h/w (EFF) in a few days
• in 1999 above combined in 22hrs!
• still must be able to recognize plaintext
• now considering alternatives to DES
Strength of DES – Timing Attacks
• attacks actual implementation of cipher
• use knowledge of consequences of implementation to derive knowledge of
some/all subkey bits
• specifically use fact that calculations can take varying times depending on
the value of the inputs to it
• particularly problematic on smartcards
Strength of DES – Analytic Attacks
• now have several analytic attacks on DES
• these utilise some deep structure of the cipher
• by gathering information about encryptions
• can eventually recover some/all of the sub-key bits
• if necessary then exhaustively search for the rest
• generally these are statistical attacks
• include
• differential cryptanalysis
• linear cryptanalysis
• related key attacks
6.41

Example 6.8

Let us try the first weak key in Table 6.18 to encrypt a block two times. After two
encryptions
with the same key the original plaintext block is created. Note that we have used the
encryption algorithm two times, not one encryption followed by another decryption.
6.42

Continued
Figure 6.11 Double encryption and decryption with a weak key
6.43
Continued
6.44
6.3.3 Continued
6.45
6.3.3 Continued

Figure 6.12 A pair of semi-weak keys in encryption and decryption

6.46
6.3.3 Continued
Example 6.9

What is the probability of randomly selecting a weak, a semi-weak, or a possible weak

key?
Solution

DES has a key domain of 256. The total number of the above keys are 64 (4 + 12 + 48).
The probability of choosing one of these keys is 8.8 × 10−16, almost impossible.
6.47

Continued
 48

AES: Advanced Encryption System

• Symmetric block cipher

• Developed in 1999 by independent Dutch
cryptographers
• Still in common use
 49

DES vs. AES

 50

Public Key (Asymmetric) Cryptography

• Instead of two users sharing one secret key, each user
has two keys: one public and one private
• Messages encrypted using the user’s public key can only
be decrypted using the user’s private key, and vice versa
 51

Secret Key vs. Public Key Encryption

From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
Public-Key Cryptography
• probably most significant advance in the 3000 year history of cryptography
• uses two keys – a public & a private key
• asymmetric since parties are not equal
• uses clever application of number theoretic concepts to function
• complements rather than replaces private key crypto
Public-Key Cryptography
• public-key/two-key/asymmetric cryptography involves
the use of two keys:
• a public-key, which may be known by anybody, and can be
used to encrypt messages, and verify signatures
• a private-key, known only to the recipient, used to decrypt
messages, and sign (create) signatures
• is asymmetric because
• those who encrypt messages or verify signatures cannot
decrypt messages or create signatures
Public-Key Cryptography
 10.55

Keys
Asymmetric key cryptography uses two separate keys: one
private and one public.
Figure Locking and unlocking in asymmetric-key cryptosystem
10.56

General Idea

Figure General idea of asymmetric-key cryptosystem

Why Public-Key Cryptography?
• developed to address two key issues:
• key distribution – how to have secure communications in
general without having to trust a KDC with your key
• digital signatures – how to verify a message comes intact from
the claimed sender
• public invention due to Whitfield Diffie & Martin Hellman at
Stanford Uni in 1976
• known earlier in classified community
Public-Key Characteristics
• Public-Key algorithms rely on two keys with the characteristics
that it is:
• computationally infeasible to find decryption key knowing only
algorithm & encryption key
• computationally easy to en/decrypt messages when the relevant
(en/decrypt) key is known
• either of the two related keys can be used for encryption, with
the other used for decryption (in some schemes)
Public-Key Cryptosystems
Public-Key Applications
• can classify uses into 3 categories:
• encryption/decryption (provide secrecy)
• digital signatures (provide authentication)
• key exchange (of session keys)
• some algorithms are suitable for all uses, others are specific to
one
 61

Public Key to Exchange Secret Keys

1 .,
4. , 5
a bc 6de
f

4h

a
2
g

b
c
i
7r
pq
7

5k l
j

3d e f
8tu

s
pq r s
v
9
wxyz

8 uv
t

mn
6
o
w
x
9y
z
1 Bill, give me your public k ey

Here is my key, Amy 2

3 Here is a symmetric k ey we can use

From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
 62

Key Exchange Man in the Middle

1,
4

.
., 5
ab c 6de f

2c
4g

ab
h
i
7q
p

5j k l

3 de f
7

rs
pq r
s
8
t uv
w 9

8t u
xy z

m
6o
v

n
w
9x y
z
Bill, give me
1
your public key

1a No, give it to me

Here is my key, Amy 2

Here is the middle’s key 2a

3 Here is the symmetric k ey

3a Here is another symmetric k ey

15.63

Man-in-the-middle attack
15.64

Figure Station-to-station key agreement method

 65

Error Detecting Codes

• Demonstrates that a block of data has been modified
• Simple error detecting codes:
• Parity checks
• Cyclic redundancy checks
• Cryptographic error detecting codes:
• One-way hash functions
• Cryptographic checksums
• Digital signatures

Parity Check
 66

One-Way Hash Function Digital Signature

Mark only Mark fixed

the sender to
M can make document
Encrypted for
authenticity

Authentic Unforgeable

Hash
function

Message
digest
 67

Certificates: Trustable Identities and Public Keys

• A certificate is a public key and an
identity bound together and signed by
a certificate authority.

• A certificate authority is an authority

that users trust to accurately verify
identities before generating
certificates that bind those identities
to keys.
 68

Certificate Signing and Hierarchy

To create Diana’s certificate: To create Delwyn’s certificate:
Diana creates and delivers to Edward: Delwyn creates and delivers to Diana:
Name: Diana Name: Delwyn
Position: Division Manager Position: Dept Manager
Public key: 17EF83CA ... Public key: 3AB3882C ...

Edward adds: Diana adds:

Name: Diana hash value Name: Delwyn hash value
Position: Division Manager 128C4 Position: Dept Manager 48CFA
Public key: 17EF83CA ... Public key: 3AB3882C ...

Edward signs with his private key: Diana signs with her private key:
Name: Diana hash value Name: Delwyn hash value
Position: Division Manager 128C4 Position: Dept Manager 48CFA
Public key: 17EF83CA ... Public key: 3AB3882C ...

Which is Diana’s certificate. And appends her certificate:

Name: Delwyn hash value
Position: Dept Manager 48CFA
Public key: 3AB3882C ...
Name: Diana hash value
Position: Division Manager
Public key: 17EF83CA ...
128C4 HTTPS helps greatly in reducing the information leaked to third
parties. However, it does not prevent tracking. Modern browser
Which is Delwyn’s certificate.
fingerprinting techniques work even behind HTTPS. Security
researchers have developed a browser extension called HTTPS
Diana’s certificate is made using Edward’s signature. Everywhere that attempts to use HTTPS whenever possible
Delwyn’s certificate includes Diana’s certificate so that it and at the same time mitigate the use of fingerprinting
can effectively be tied back to Edward, creating a chain of techniques.
trust.
 69

Cryptographic Tool Summary

 70

What happens with URLs?

 71

Summary
• Encryption helps prevent attackers from revealing, modifying, or fabricating
messages

• Symmetric and asymmetric encryption have complementary strengths and

weaknesses

• Certificates bind identities to digital signatures