I n f o r m a t i o n T r a n s m i s s i o n - - PowerPoint PPT Presentation

▶
i n f o r m a t i o n t r a n s m i s s i o n c h a p t e
SMART_READER_LITE
LIVE PREVIEW

I n f o r m a t i o n T r a n s m i s s i o n - - PowerPoint PPT Presentation

Nov 13, 2023 265 likes •485 views

I n f o r m a t i o n T r a n s m i s s i o n C h a p t e r 6 C r y p t o l o g y OVE EDFORS Electrical and information technology L e a r n i n g o u t c o m e s A f t e r t h i

slide-1
SLIDE 1

I n f

  • r

m a t i

  • n

T r a n s m i s s i

  • n

C h a p t e r 6 C r y p t

  • l
  • g

y

OVE EDFORS Electrical and information technology

slide-2
SLIDE 2

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 2

L e a r n i n g

  • u

t c

  • m

e s

  • A

f t e r t h i s l e c t u r e t h e s t u d e n t s h

  • u

l d

– u

n d e r t a n d w h a t c r y p t

  • l
  • g

y i s a n d h

  • w

i t i s u s e d ,

– b

e f a m i l i a r w i t h t h e c r y p t

  • m
  • d

e l s

  • f

s y s t e m s f

  • r

s e c r e c y a n d a u t h e n t i c a t i

  • n

,

– u

n d e r s t a n d w h a t m a k e s a c r y p t

  • s

y s t e m s e c u r e ,

– b

e a b l e t

  • p

e r f

  • r

m e n c r y p t i

  • n

, d e c r y p t i

  • n

a n d c r y p t a n a l y s i s

  • n

s i m p l e c i p h e r s ,

– u

n d e r s t a n d h

  • w

C e s a r , V i g i n e r e a n d V e r n a m c i p h e r s w

  • r

k , a n d

– u

n d e r s t a n d t h e p r i n c i p l e

  • f

p e r f e c t s e c u r i t y .

slide-3
SLIDE 3

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 3

Wh e r e a r e w e i n t h e B I G P I C T U R E ?

Cryptology Lecture relates to pages 211-200 in textbook. (Pages 220-228, self study.)

slide-4
SLIDE 4

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 4

C r y p t

  • l
  • g

y

“The science concerned with data communication and storage in secure and usually secret form” – Encyclopaedia Britannica Legitimate users obtain security by using a secret key that is known only to them. The area is often subdivided into the two disciplines:

  • Cryptography
  • Cryptanalysis
slide-5
SLIDE 5

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 5

Mo d e l

  • f

a c r y p t

  • s

y s t e m f

  • r

s e c r e c y

slide-6
SLIDE 6

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 6

S e c u r i t y

  • f

t h e c i p h e r

  • The security of the cipher should reside entirely in the

secret key.

  • The designer of a cryptosystem should always assume

that the enemy ``by hook or by crook'' can get hold of a detailed description of the cryptosystem; the only thing that is hidden from the cryptanalyst is the actual value of the key.

  • Although this is an old principle formulated by Auguste

Kerckhoffs already in 1883, it is still valid

slide-7
SLIDE 7

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 7

Mo d e l

  • f

a c r y p t

  • s

y s t e m f

  • r

a u t h e n t i c a t i

  • n
slide-8
SLIDE 8

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 8

I m p e r s

  • n

a t i

  • n

a n d s u b s t i t u t i

  • n

The impersonation attack is successful if the receiver accepts the ciphertext C* that is chosen by the intruder without knowledge about the genuine ciphertext C In the substitution attack the intruder first observes the genuine ciphertext C, then he chooses a ciphertext C* that he hopes will be accepted by the receiver.

slide-9
SLIDE 9

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 9

P r

  • b

a b i l i t y

  • f

a s u c c e s s f u l i m p e r s

  • n

a t i

  • n

a t t a c k

Simmons showed a combinatorial lower bound on the probability of a successful impersonation attack, namely, where and are the numbers of plaintexts and ciphertexts, respectively.

slide-10
SLIDE 10

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1

C a e s a r a n d V i g e n è r e c i p h e r s

Caesar shifted the cipher alphabet three steps such that A is encrypted as D B is encrypted as E C is encrypted as F As an example we have Caesar used always a shift of three steps, but nowadays a cipher obtained by any shift is called a Caesar cipher. The number of steps in the shift is the key; that is, the classical Caesar cipher has key K=3.

plaintext ciphertext CAESAR FDHVDU

slide-11
SLIDE 11

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 1

DIAJMHVODJI

C e s a r c i p h e r c r y p t a n a l y s i s

What we heard when eaves- dropping EJBKNIWPEKJ Doesn't make sense. Replace each letter with the next! FKCLOJXQFLK Doesn't make sense. Replace each letter with the next! GLDMPKYRGML Doesn't make sense. Replace each letter with the next! HMENQLZSHNM Doesn't make sense. Replace each letter with the next! INFORMATION INFORMATION Doesn't make sense. Replace each letter with the next! YES! This makes sense! JOGPSNBUJPO BGYHKTMBHG CHZILUNCIH . . . … and there are 20 more nonsensical letter combinations, before we come back to the original “DIAJMHVODJI”.

slide-12
SLIDE 12

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 2

Mo n

  • a

l p h a b e t i c s u b s t i t u t i

  • n

c i p h e r s

The Caesar cipher is a special case of a mono-alphabetic substitution cipher: An arbitrary permutation of the English alphabet is used as the key for a substitution done letter by letter. For example, the mapping is a key that enciphers the plaintext WOODSTOCK as the ciphertext OQQAWIQUR.

Plaintext alphabet

ABCDEFGHIJKLMNOPQRSTUVWXYZ

Cipher alphabet

XGUACDTBFHRSLMQVYZWIEJOKNP

slide-13
SLIDE 13

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 3

Tie V i g e n è r e c i p h e r

To make a cipher less vulnerable to statistical attacks we can try to conceal the varying relative frequencies for the plaintext letters by using more than one substitution alphabet. A popular example of a so called polyalphabetic substitution cipher is the Vigenère cipher named after the French cryptographer Blaisede Vigenère (1523--1596). For a couple of centuries his cipher was known as le chiffre indéchiffrable, the ”unbreakable cipher''.

slide-14
SLIDE 14

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 4

V i g i n è r e t a b l e

slide-15
SLIDE 15

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 5

Tie V i g e n è r e c i p h e r

The key consists of a word that is repeated periodically. For example, if the key is THOMPSON and the plaintext is FOR WOODSTOCK MY FRIEND OF FRIENDS, then we

  • btain the ciphertext as follows:
slide-16
SLIDE 16

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 6

B r e a k i n g t h e V i g e n è r e c i p h e r

The cryptanalyst looks for such repetitions in the ciphertext. In our example we find the repeated string TEBLBP:

slide-17
SLIDE 17

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 7

Tie V e r n a m c i p h e r

slide-18
SLIDE 18

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 8

P e r f e c t s e c r e c y

Shannon defined a cryptosystem to provide perfect secrecy if the plaintext and the ciphertext are independent random variables. For such systems we will obtain no information at all about the plaintext by observing only the ciphertext. We might do as well just by guessing the plaintext without observing the ciphertext and by doing so trust our luck!

slide-19
SLIDE 19

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 1 9

B e c a r e f u l w h e n t r u s t i n g e n c r y p t i

  • n
slide-20
SLIDE 20

O v e E d f

  • r

s E I T A 3

  • C

h a p t e r 6 ( P a r t 1 ) 2

S u m m a r y

  • C

r y p t

  • g

r a p h y i s u s e d f

  • r

s e c r e t c

  • m

m u n i c a t i

  • n

a n d a u t h e n t i c a t i

  • n
  • C

r y p t a n a l y s i s i s u s e d f

  • r

“ b r e a k i n g ” ( e a v e s d r

  • p

p i n g

  • n

) s e c r e t c

  • m

m u n i c a t i

  • n

w i t h

  • u

t k n

  • w

i n g t h e k e y

  • I

m p e r s

  • n

a t i

  • n

i s s u c c e s s f u l i f a n i n t r u d e r c a n “ i n s e r t ” a m e s s a g e t h a t i s a c c e p t e d a s a r e a l

  • n

e b y t h e r e c e i v e r

  • S

u b s t i t u i t i

  • n

i s s u c c e s s f u l i f a n i n t r u d e r c a n “ r e p l a c e ” a g e n u i n e m e s s a g e w i t h h i s / h e r

  • w

n a n d i t i s a c c e p t e d a s a r e a l

  • n

e b y t h e r e c e i v e r

  • C

e s a r a n d V i g i n è r e c i p h e r s a r e e x a m p l e s

  • f

m

  • n
  • a

n d p

  • l

y

  • a

l p h a b e t i c s u b s t i t u t i

  • n

c i p h e r s ( b

  • t

h a r e q u i t e s i m p l e t

  • “

b r e a k ” )

  • T

h e V e r n a m c i p h e r i s a n ( p r

  • v

a b l y ) u n b r e a k a b l e v e r s i

  • n
  • f

t h e V i g i n è r e c i p h e r w i t h a k e y a s l

  • n

g a s t h e m e s s a g e i t s e l f . A l s

  • c

a l l e d a

  • n

e

  • t

i m e p a d , s i n c e t h e k e y i s

  • n

l y u s e d

  • n

c e a n d t h e n d i s c a r d e d .

  • P

e r f e c t s e c r e c y m e a n s t h a t t h e r e i s n

  • m

u t u a l i n f

  • r

m a t i

  • n

(

  • r

d e p e n d e n c y ) b e t w e e n p l a i n t e x t a n d c i p h e r t e x t , u n l e s s y

  • u

k n

  • w

t h e k e y .

slide-21
SLIDE 21