s-cse_s - CLASSICAL ENCRYPTION 1 / 50 Syntax A symmetric...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
CLASSICAL ENCRYPTION 1 / 50
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Syntax A symmetric encryption scheme SE = ( K , E , D ) consists of three algorithms: (Adversary) 2 / 50
Background image of page 2
Correct decryption requirement For all K , M we have D K ( E K ( M )) = M 3 / 50
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Terminology recall Alphabets: Σ 1 = { A , B , C , . . . , Z } Σ 2 = { A , B , C , . . . , Z } ∪ {⊔ , . , ? , . . . } Σ 3 = { 0 , 1 } Strings: Over Σ 1 : HELLO , BZYK , ... Over Σ 2 : HOW ARE YOU ? Over Σ 3 : 01101 Denote by Σ * the set of all strings over alphabet Σ: { A , B , . . . , Z } * { 0 , 1 } * 4 / 50
Background image of page 4
Length and size If s is a string then | s | is the number of symbols in it: | HELLO | = 5 | HOW ARE YOU ? | = 12 | 01101 | = 5 We denote by s [ i ] the i -th symbol of string s : s [3] = L if s = HELLO s [5] = A if s = HOW ARE YOU ? s [2] = 1 if s = 01101 If S is a set then | S | is its size: |{ A , B , . . . , Z }| = 26 |{ 0 , 1 } 8 | = 2 8 5 / 50
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Functions Then notation π : D R means π is a map (function) with inputs drawn from the set D (the domain) outputs falling in the set R (the range) Example : DeFne π : { 1 , 4 , 6 } → { 0 , 1 } by x 1 4 6 π ( x ) 1 1 0 ±unctions can be speciFed as above or sometimes by code. Example : The above can also be speciFed by Alg π ( x ) Return x mod 3 6 / 50
Background image of page 6
Permutations A map (function) π : S S is a permutation if it is one-to-one. Equivalently, it has an inverse map π - 1 : S S . Example: S = { A , B , C } A permutation and its inverse: x A B C π ( x ) C A B y A B C π - 1 ( x ) B C A Not a permutation: x A B C π ( x ) C B B 7 / 50
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Counting permutations There are many diferent possible permutations π : S S on a given set S . How many? To be speciFc: How many permutations π : S S are there on the set S = { A , B , C } ? Answer: 3! = 3 2 1 = 6 x π ( x ) A ←− 3 choices: A,B,C B ←− 2 choices: not π ( A ) C ←− 1 choice: not π ( A ), π ( B ) In general there are | S | ! permutations π : S S . We let Perm( S ) denote the set o± all these permutations. 8 / 50
Background image of page 8
Substitution ciphers Alphabet Σ Key is a permutation π : Σ Σ defnining the encoding rule Plaintext M Σ * is a string over Σ Encryption oF M = M [1] ··· M [ n ] is C = π ( M [1]) ··· π ( M [ n ]) Decryption oF C = C [1] ··· C [ n ] is M = π - 1 ( C [1]) ··· π - 1 ( C [ n ]) 9 / 50
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Substitution ciphers A substitution cipher over alphabet Σ is a symmetric encryption scheme SE = ( K , E , D ) in which the key output by K is a permutation π : Σ Σ, and Algorithm E π ( M ) For i = 1 , . . . , | M | do C [ i ] π ( M [ i ]) Return C Algorithm D π ( C ) For i = 1 , . . . , | C | do M [ i ] π - 1 ( C [ i ]) Return M 10 / 50
Background image of page 10
Setup for Examples Σ = { A , B , . . . , Z } ∪ {⊔ , . , ? , ! , . . . } Plaintexts are members of Σ * , which means any English text (sequence of sentences) is a plaintext. For simplicity we only consider permutations that are punctuation
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/10/2010 for the course CSE CSE107 taught by Professor Bellare during the Spring '10 term at UCSD.

Page1 / 47

s-cse_s - CLASSICAL ENCRYPTION 1 / 50 Syntax A symmetric...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online