slides6

Slides6 - CS 531 Fall 2007 One-time Pad The one-time pad can be shown to be theoretically unbreakable i.e if a cryptanalyst has c1c2.ct the

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

View Full Document Right Arrow Icon
T 1 One-time Pad CS 531, Fall 2007 Copyright © William C. Cheng i.e., if a cryptanalyst has c 1 c 2 ...c t , the cryptanalyst can do no better than guess at the plaintext i.e., any t - bit binary strings are equally likely as plaintext The one-time pad can be shown to be theoretically unbreakable the plaintext can be any binary string of length t It has been proven that to realize an unbreakable system requires a random key of the same length as the message this reduces the practicality of one-time pad Myth or reality? (until very recently) communication line between Moscow and Washington was secured by a one-time pad transport of key done by trusted courier
Background image of page 1

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

View Full DocumentRight Arrow Icon
T 2 The Key Space CS 531, Fall 2007 Copyright © William C. Cheng a key is typically a compact way to specify the encryption transformation Size of key space is the number of encryption/decryption key pairs that are available in the cipher system e.g., a transposition cipher of block length t has t! encryption functions to choose from, each can be simply described by a permutation which is called the key a necessary, but usually not sufficient , condition for an encryption scheme to be secure is that the key space be large enough to preclude exhaustive search It is a great temptation to relate the security of the encryption
Background image of page 2
Image of page 3
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 / 9

Slides6 - CS 531 Fall 2007 One-time Pad The one-time pad can be shown to be theoretically unbreakable i.e if a cryptanalyst has c1c2.ct the

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

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