slides5

slides5 - CS 531, Fall 2007 Substitution Ciphers...

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

View Full Document Right Arrow Icon
T 1 Substitution Ciphers CS 531, Fall 2007 Copyright © William C. Cheng let A be a alphabet, M be the set of all strings of length t over A , K be the set of all permutations on the set A Substitution ciphers are block ciphers which replace symbols (or groups of symbols) by other symbols or groups of symbols Mono-alphabetic substitution cipher (or simple substitution cipher ) define for each e K an encryption transformation E e as: E e (m) = (e(m 1 )e(m 2 )...e(m t )) = (c 1 c 2 ...c t ) = c where m = (m 1 m 2 ...m t ) M the above means that for each symbol in a t - tuple, replace (substitute) it by another symbol from A according to some fixed permutation e the inverse permutation d=e -1
Background image of page 1

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

View Full DocumentRight Arrow Icon
distribution of letter frequencies is preserved in the ciphertext (i.e., first-order statistics of plaintext and ciphertext are isomorphic ) T 2 Mono-alphabetic Substitution Ciphers CS 531, Fall 2007 Copyright © William C. Cheng q=26 , size of key space is quite large: q! 4 × 10 26 If A contains q symbols, the number of distinct substitution ciphers is q! and is independent of block size in the cipher however, mono-alphabetic substitution cipher is insecure because the key being used can be determined quite easily by examining a modest amount of ciphertext vulnerable to simple statistics-based cryptanalysis
Background image of page 2
T 3 Homophonic Substitution Ciphers CS 531, Fall 2007 Copyright © William C. Cheng a homophonic substitution cipher replaces each symbol a in a plaintext message block with a randomly chosen string from H(a) To each symbol a A , associate a set H(a) of strings of t symbols, with restriction that the sets H(a) , a A , be pairwise disjoint to decrypt a string c of t symbols, one must determine an a A such that c H(a) the key for this cipher consists of the sets H(a) Can use a homophonic substitution cipher to make the
Background image of page 3

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

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

This note was uploaded on 03/05/2008 for the course CSCI 531 taught by Professor Cheng during the Spring '08 term at USC.

Page1 / 13

slides5 - CS 531, Fall 2007 Substitution Ciphers...

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

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