Symmetric Cipher Model

Содержание

Слайд 2

Introduction

Symmetric encryption, also referred to as
conventional encryption or single-key encryption, was the

Introduction Symmetric encryption, also referred to as conventional encryption or single-key encryption,
only type of encryption in use prior to the

development of public-key encryption in
It remains by far the most widely used of types of encryption.
Beginning with a look at a general model

the
the

1970s.
two

for

the

symmetric encryption process; this will enable us to
understand the context within which the algorithms are used

Слайд 3

Content
Symmetric cipher
Secure Use of Conventional Encryption

1.


2.
3.


Symmetric Encryption
Cryptographic systems
Cryptanalysis
Cryptanalytic Attacks
Brute-force attack

Scheme

Brute-Force

Content Symmetric cipher Secure Use of Conventional Encryption 1. – – 2.
Cryptanalysis

of

Caesar Cipher


4.

Monoalphabetic Ciphers
Breaking Monoalphabetic Cipher

Слайд 4

Symmetric

cipher

A form of cryptosystem in which encryption and
decryption are performed using the

Symmetric cipher A form of cryptosystem in which encryption and decryption are
same key. Also


known as conventional encryption.
A symmetric encryption scheme has five ingredients.


Слайд 5

Secure Use of Conventional Encryption

Two requirements for secure use of conventional
encryption:
1. Strong

Secure Use of Conventional Encryption Two requirements for secure use of conventional
algorithm – an opponent unable to decipher the ciphertext or figure out the key.
2. Shared secret key – sender and receiver must have obtained copies of the secret key in a secure fashion and must keep the key secure.

Слайд 6

Symmetric Encryption Scheme

We do not need to keep the algorithm secret; we
need

Symmetric Encryption Scheme We do not need to keep the algorithm secret;
to keep only the key secret.


Слайд 7

Cryptographic systems

Characterized
1. The type plaintext to

along three independent dimensions:
of operations used for

Cryptographic systems Characterized 1. The type plaintext to along three independent dimensions:
transforming ciphertext. All encryption algorithms

are based on two general principles:

Substitution: the plaintext is mapped into
another element
Transposition: the plaintext elements are rearranged



Слайд 8

2.

The number of keys used.
Symmetric: both sender and receiver use the same

2. – The number of keys used. Symmetric: both sender and receiver
key (a.k.a. single-key, secret-key, or conventional encryption)
Asymmetric: the sender and receiver use different key (a.k.a. two-key, or public-key encryption)
The way in which the plaintext is processed.
A block-cipher: processes the input one block of elements at a time, producing an output block for


3.

each input block.
A stream-cipher: processes the input elements continuously, producing output one element at a time, as it goes along


Слайд 9

Cryptanalysis

Two general approaches to attacking a conventional
encryption scheme:

Cryptanalysis: exploits the characteristics of

Cryptanalysis Two general approaches to attacking a conventional encryption scheme: Cryptanalysis: exploits
the
algorithm to attempt to deduce a specific plaintext or to deduce the key being used.
Brute-force attack: tries every possible key on a piece of ciphertext until an intelligible translation into plaintext is obtained



Слайд 10

Cryptanalytic

Attacks

Ciphertext only:


Encryption algorithm
Ciphertext



Known plaintext:


Encryption algorithm
Ciphertext
One or more plaintext-ciphertext with the secret key




pairs

formed

Cryptanalytic Attacks Ciphertext only: ● Encryption algorithm Ciphertext – – Known plaintext:

Слайд 11

Chosen plaintext:


Encryption algorithm
Ciphertext
Plaintext message chosen by cryptanalyst,




together with its corresponding
generated with the

Chosen plaintext: ● Encryption algorithm Ciphertext Plaintext message chosen by cryptanalyst, –
secret key
Chosen ciphertext:

ciphertext


Encryption algorithm
Ciphertext
Purported ciphertext chosen by together with its corresponding




cryptanalyst,
decrypted

plaintext generated with the secret key

Слайд 12

Chosen text:


Encryption algorithm
Ciphertext
Plaintext message chosen by cryptanalyst,




together with its corresponding
generated with the

Chosen text: ● Encryption algorithm Ciphertext Plaintext message chosen by cryptanalyst, –
secret key Purported ciphertext chosen by together with its corresponding

ciphertext

cryptanalyst,
decrypted


plaintext generated with the secret key

Слайд 13

A

Brute-Force

Attack

Trying every possible key until an intelligible


translation of the ciphertext into plaintext

A Brute-Force Attack Trying every possible key until an intelligible ● translation
is
obtained.
On average, half of all possible keys must be tried achieve success.

to


Слайд 14

Brute-Force Cryptanalysis of Caesar
Cipher
Three important characteristics of this problem enabled

us

to use a

Brute-Force Cryptanalysis of Caesar Cipher Three important characteristics of this problem enabled
brute-force cryptanalysis:
1. The encryption and decryption algorithms are
known.
2. There are only 25 keys to try.
3. The language of the plaintext is known and easily recognizable.

Слайд 15

Example: Let's encipher some text using Caesar

cipher with the secret key is

3.

Example: Let's encipher some text using Caesar cipher with the secret key
toga
WRJD

plain:
cipher:

meet
PHHW

me
PH
the

after
DIWHU

the
WKH

party
SDUWB

Simply try all
the results.

25 possible keys. Below shown

Слайд 16

Monoalphabetic Ciphers

With only 25 possible keys, the Caesar cipher is far


from secure.

Monoalphabetic Ciphers With only 25 possible keys, the Caesar cipher is far
A dramatic increase in the key

space

can be achieved by
substitution.

allowing an arbitrary

plain:
cipher:

A B

C D

E F G

H I

J K L M N

O P Q R

S T U

V W X Y

Z

D E

F G

H I

J

K L

M N O P Q

R S T U

V W X

Y Z A B

C

If instead,

the

"cipher"

line can

be any

permutation


of the 26 alphabetic characters,

then there are 26! or

greater than 4 x

1026

possible keys.

Слайд 17

Breaking

Monoalphabetic

Cipher

The ciphertext to be solved is
UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXU
DBMETSXAIZVUEPHZHMDZSHZOWSFPAPPDTSV
PQUZWYMXUZUHSXEPYEPOPDZSZUFPOMBZWPF
UPZHMDJUDTMOHMQ
The relative frequency of

Breaking Monoalphabetic Cipher The ciphertext to be solved is UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXU DBMETSXAIZVUEPHZHMDZSHZOWSFPAPPDTSV PQUZWYMXUZUHSXEPYEPOPDZSZUFPOMBZWPF
the letters

P 13.33

H 5.83

F 3.33

B 1.67

C 0.00

Z 11.67

D 5.00

W 3.33

G 1.67

K 0.00

S 8.33

E 5.00

Q 2.50

Y 1.67

L 0.00

U 8.33

V 4.17

T 2.50

I 0.83

N 0.00

O 7.50

X 4.17

A 1.67

J 0.83

R 0.00

M 6.67

Слайд 18

Relative Frequency of Letters in English Text

Relative Frequency of Letters in English Text

Слайд 19

Comparing two previously shown
letters P and Z are the equivalents and t,

Comparing two previously shown letters P and Z are the equivalents and
but it is not certain which is

tables that cipher

of plain letters
which

e

The letters S, U, O, M, and H are all of relatively
high frequency and probably correspond to plain letters from the set {a, h, i, n, o, r, s}.
The letters with the lowest frequencies (namely, A,

B, G, Y, I, J) are likely included in the set {b, j, k,
v, x, z}.
A more systematic approach is to look for other regularities. For example, certain words may be known to be in the text. Or we could look for repeating sequences of cipher letters and try to deduce their plaintext equivalents.

q,

Слайд 20

A powerful tool is to look at the frequency

of

two-letter

combinations,

known

as

digrams.

The most common digram

A powerful tool is to look at the frequency of two-letter combinations,
in cipher

is ZW, which

appears three times. So we make the correspondence:

Z →

t and W →

h.

Слайд 21

So far, then, we have
UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZ

t

a

e

e

te

a

that

e

e

a

a

VUEPHZHMDZSHZOWSFPAPPDTSVPQUZWYMXUZUHSX

e

t

ta

t

ha

e

ee

a

e

th

t

a

EPYEPOPDZSZUFPOMBZWPFUPZHMDJUDTMOHMQ

e

e e

tat

e

the

t

Only four letters have
have quite a bit

So far, then, we have UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZ t a e e te a
of the

been identified,
message.

but

already

we

Слайд 22

Continued analysis of frequencies plus trial and
error should easily yield a solution

Continued analysis of frequencies plus trial and error should easily yield a
from this point.

it

was

disclosed

yesterday

that

several

informal

but

direct

contacts

have

been
the

made

with
cong

political

representatives

of

viet

in

moscow

The complete plaintext, with spaces added between
words, above.

Имя файла: Symmetric-Cipher-Model.pptx
Количество просмотров: 108
Количество скачиваний: 0