(Shannon 1948 1949)

F = {x1, x2, , xn} ( )

: {p(x1), p(x2), , p(xn)}

n

p( x ) = 1
i =1

G= {y1, y2, , yn}

: {q(y1), q(y2), , q(yn)}

2


(joint probability)

xi
yj
p(xi , yj) = p(xi) q(yj) i, j

(conditional probability)

xi
yj

p(xi | yj) = p(xi, yj) / q(yj) , q(yj) > 0

p(xi | yj) = p(xi)

3


( Shannon)
n

H ( X ) = p( xi ) log 2 p ( xi )
i =1



{0,1} p(0) = a p(1) = 1-a

H ( X ) = a log 2 a (1 a ) log 2 (1 a )

H ( X , Y ) = p ( xi , y j ) log 2 p ( xi , y j )
i =1 j =1

(,) = () + ()

H ( X , Y ) = p( xi ) q( y j ) log 2 ( p( xi ) q( y j ))
i =1 j =1

= p( xi ) q( y j ) log 2 p( xi ) p( xi ) q( y j ) log 2 q( y j )
i =1 j =1
m

i =1 j =1
n

q( y j ) p( xi ) log 2 p( xi ) p( xi ) q( y j ) log 2 q ( y j )
j =1

i =1

i =1

H ( X )+H (Y )

j =1

H ( X | Y ) = p( xi | y j ) log 2 p ( xi | y j )
i =1 j =1

(,) = () + (|) = () + (|)



, , .

k1,
k2, k3.

10

pi c1, c2, c3

To

11


(redundancy)

24 =
[log224] = 5 bits
A = [ log2n ] , , (n
)

m 2m

. m = 5 245

, , , , ....
12


(redundancy)

m 2m

2Rm

D = A-R

13


(redundancy)

Unicity distance (UD):

(P | C)

O Shannon
UD = H(K) / D, () D

D << UD =

14


F P

P = [p1, p2, ], pi F i = 1, 2,

G
C

C = [c1, c2, ], ci G i = 1, 2,

O F*

Fn n

F(n) 0 n

F(n) = U F U F2 U U Fn

G*

Gm m

G(m) 0 m

G(m) = U G U G2 U U Gm
15

S: F* G*

S-1: G* F*

= {e1, e2, , ek} ei : F(n) G(m)

To ei

di = ei-1 = G(m) F(n)

D = {d1, d2, , dk}

To E, D K = {1, 2, , k}

F(n), G(n), , D,

P F(n) i K, ei E, di D, ei (p) = c di (c) = p

16


(exclusive OR, R)

, module 2

XOR, F = G = {0, 1 }

P = [01001] F(5) = [11100] ()

C = P K = 01001 11100 = 10101

P = C K = 10101 11100 = 01001

a

ab

0
17

18

19



(block)
blocks
(padding)

20

ci = f

i,j

(pj) , i, j = 0, 1, , n

ci
pj i, j 0,5

P(ci 1 = f i,j (pj 1)) = 1/2, i, j = 0, 1, , n

21

22

23


(transposition)

(substitution)

24


(transposition)

F = G

F = G = {,,,,,,,,,,...,,}

: []

[261453] :

1 2, 2 6, .

[]

([p1 p2 p3 p4 p5 p6]) = [p2 p6 p1 p4 p5 p3]

-1([p1 p2 p3 p4 p5 p6]) = [p3 p1 p6 p4 p5 p2]

25

ei : F(n) G(m) ei

F(1) G

F = G = K = Zn e , d D

c = e(p) = p + k mod n

p = d(c) = c - k mod n

,=0, ,=1, ..., ,=23,

n = 24 ( )
26

[]

= 3

c = e(p) = p + 3 mod 24

( 23 , 12
)

27

c = p + mod n
n

n !

n !

28

(.. )
29

30

F = G = K = Zn , K = {(a, b) Zn x Zn : gcd (a, n) =1} e ,

d D

c = e(p) = a p + b mod n

p = d(c) = a-1 (c b) mod n , p F, c G, k = (a, b) K

=1

a , n

31

e(p) = 4p + 5 mod 24

gcd(4, 24) = 4, p p + 24/4

e(3) = 12 + 5 = 17 mod 24

e(9) = 36 + 5 = 41 17 (mod 24)

32

b

(ci, cj)
(pi, pj)

ci = api + b
c j = ap j + b

}mod n
33

[
]

:13, :10, :9, :6, :6, :5, :5.

12 = 0 + b mod 24

20 = a 14 + b mod 24

b = 12 = 8 14-1 mod 24,

14-1 mod 24 (= 14 modulo 24), gcd(14, 24) =2

14

34

(c = 11) 6%
(=15), (=16),
(=17)

1 = (15-12) 11-1 = 9 mod 24

2 = (16-12) 11-1 = 20 mod 24

3 = (17-12) 11-1 = 7 mod 24

11-1 11 (mod 24)

1 2 gcd(20, 24) 1 gcd(9,
24) 1
35

= 7
[
]

(7, 12)

dk (c) = 7c 12 mod 24

36

ei : F(n) G(m) i

ei

1/n

37

() , ()

38

Vigenere

F = G = K = Znl ei El, dk Dl :

39

Vigenere

ei

l


l = 1 ?

40

Vigenere

P = []

k = []

Vigenre

41

42

Vigenere

Vigenre

43