An Introduction to Cryptography

Similar documents
CS408 Cryptography & Internet Security

VIDEO intypedia001en LESSON 1: HISTORY OF CRYPTOGRAPHY AND ITS EARLY STAGES IN EUROPE. AUTHOR: Arturo Ribagorda Garnacho

Enigma. Developed and patented (in 1918) by Arthur Scherbius Many variations on basic design Eventually adopted by Germany

CSc 466/566. Computer Security. 4 : Cryptography Introduction

New Address Shift Linear Feedback Shift Register Generator

Breaking the Enigma. Dmitri Gabbasov. June 2, 2015

Understanding Cryptography A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl. Chapter 2 Stream Ciphers ver.

Understanding Cryptography A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl. Chapter 2 Stream Ciphers ver.

Institute of Southern Punjab, Multan

Sherlock Holmes and the adventures of the dancing men

Cryptography. The Codebreakers: The Story of Secret Writing. by David Kahn A Bit of History. Seminal Text on Cryptography

Stream Cipher. Block cipher as stream cipher LFSR stream cipher RC4 General remarks. Stream cipher

The Web Cryptology Game CODEBREAKERS.EU edition 2015

LFSR stream cipher RC4. Stream cipher. Stream Cipher

Lecture 8: Cracking the Codes based on Tony Sale s Codes & Ciphers Web Page. History of Computing. Today s Topics. History of Computing Cipher Systems

Sequences and Cryptography

Eric Roberts and Jerry Cain Handout #36 CS 106J May 15, The Enigma Machine

PA Substitution Cipher

Stream Ciphers. Debdeep Mukhopadhyay

Key- The key k for my cipher is a single number from 1-26 which is shared between the sender and the reciever.

Cryptography CS 555. Topic 5: Pseudorandomness and Stream Ciphers. CS555 Spring 2012/Topic 5 1

Encryption. Secure Chat. Encryption Machine

PART FOUR. Polyalphabetic Substitution Systems PERIODIC POLYALPHABETIC SUBSTITUTION SYSTEMS

LECTURE NOTES ON Classical Cryptographic Techniques ( Substitution Ciphers System)

Code-makers & Codebreakers. Substitution ciphers and frequency analysis

Exploring the Enigma [The MATH Connection]

ISSN (Print) Original Research Article. Coimbatore, Tamil Nadu, India

Grade School Crypto. Part 1. Dr. Rick Smith, Cryptosmith October, 2013

Cabinet War Rooms SIGSALY. The A-3 scrambler

Perfect Localized Security of the Fourtytwofish Cipher in the Delphic Oracle Model

The Evolution of the Cryptologic Bombe. Chris Christensen Department of Mathematics Northern Kentucky University

Substitution cipher. Contents

CRYPTOGRAPHY. Sharafat Ibn Mollah Mosharraf TOUCH-N-PASS EXAM CRAM GUIDE SERIES. Special Edition for CSEDU. Students CSE, DU )

FOR OFFICIAL USE ONLY

Playfair Cipher. From the earliest forms of stenography to the most advanced forms of encryption, the

Cardano Girolamo Cardano invented: Fleissner, after Austrian cryptologist (Eduard). Described by Jules Verne in the story Mathias Sandorf.

Most people familiar with codes and cryptography have at least heard of the German

STA4000 Report Decrypting Classical Cipher Text Using Markov Chain Monte Carlo

NUMB3RS Activity: Coded Messages. Episode: The Mole

V.Sorge/E.Ritter, Handout 5

Example: compressing black and white images 2 Say we are trying to compress an image of black and white pixels: CSC310 Information Theory.

Performance Evaluation of Stream Ciphers on Large Databases

Keywords- Cryptography, Frame, Least Significant Bit, Pseudo Random Equations, Text, Video Image, Video Steganography.

How I Broke the Confederate Code (137 Years Too Late)

WATERMARKING USING DECIMAL SEQUENCES. Navneet Mandhani and Subhash Kak

NON-BREAKABLE DATA ENCRYPTION WITH CLASSICAL INFORMATION

CRYPTOGRAPHY IN CREATIVE MEDIA. Olivia Grace Vanarthos. Honors Thesis. Appalachian State University

How to Predict the Output of a Hardware Random Number Generator

The Swiss cipher machine NeMa

Multiple Image Secret Sharing based on Linear System

cryptography, plaintext; ciphertext. key,

HCCA: A Cryptogram Analysis Algorithm Based on Hill Climbing

Pseudorandom bit Generators for Secure Broadcasting Systems

Encryption of Ultrasound Images Using. the Permutation on the ( /p ) Fields

Nomenclators. Nomenclator Example. Alberti s Cipher Disk. Early code/cipher combination, popular form 1400s-1800s. Philip of Spain (1589, see Kahn):

Appendix Cryptograms

Fault Analysis of Stream Ciphers

Attacking of Stream Cipher Systems Using a Genetic Algorithm

Randomness analysis of A5/1 Stream Cipher for secure mobile communication

DESIGN OF RECONFIGURABLE IMAGE ENCRYPTION PROCESSOR USING 2-D CELLULAR AUTOMATA GENERATOR

CRYPTOGRAPHY AND STATISTICS: A DIDACTICAL PROJECT. Massimo BORELLI, Anna FIORETTO, Andrea SGARRO, Luciana ZUCCHERI

Update to 8 June 2011 Press Release

Permutation-based cryptography for the Internet of Things

WG Stream Cipher based Encryption Algorithm

Cryptology Notes ~ 1. Frank Tapson 2003 [trolc0:2]

The Paper Enigma Machine

Many books on cryptography were published prior to the 1609

Relies on hiding a message by jumbling up individual letters of the message. Sending a whole message with the letters jumbled up using a cipher

Computer Science 126. Prologue: A Simple Machine. General Computer Science Fall Robert Sedgewick

Dorabella Cipher. Cryptography peppers the world s history as an aid to military communication

The Tentatve List of Enigma and Other Machine Usages, formatted by Tony Sale. (c) July March l945 page 1

(12) Patent Application Publication (10) Pub. No.: US 2003/ A1

Introduction to Set Theory by Stephen Taylor

Facts and Myths of Enigma: Breaking Stereotypes

1 Introduction 2. 3 Zygalski Sheets Using Zygalski Sheets Programmatic Replication Weaknesses/Problems 7

Image Steganalysis: Challenges

Steganographic Technique for Hiding Secret Audio in an Image

WINGS TO YOUR THOUGHTS..

Optimum Composite Field S-Boxes Aimed at AES

Cryptanalysis of LILI-128

Modified Version of Playfair Cipher Using Linear Feedback Shift Register and Transpose Matrix Concept

Modified Alternating Step Generators with Non-Linear Scrambler

116 Facta Universitatis ser.: Elect. and Energ. vol. 11, No.1 è1998è to use any kind of encrypted information or with not very pleased attitude of loc

Key-based scrambling for secure image communication

Welch Gong (Wg) 128 Bit Stream Cipher For Encryption and Decryption Algorithm

VeriLab. An introductory lab for using Verilog in digital design (first draft) VeriLab

Physical Layer Built-in Security Enhancement of DS-CDMA Systems Using Secure Block Interleaving

Optimization of Multi-Channel BCH Error Decoding for Common Cases. Russell Dill Master's Thesis Defense April 20, 2015

Zodiackillersite. Backward E = 3/ G = 14 / Y K E = = 36 3/14/36

Physical Layer Built-in Security Enhancement of DS-CDMA Systems Using Secure Block Interleaving

The A to Z GUIDE to the ZK-Crypt

Le Sphinx. Controls. 1 sur 5 17/04/ :59. Pocket cipher device

Digital Audio and Video Fidelity. Ken Wacks, Ph.D.

Testing of Cryptographic Hardware

LFSR Counter Implementation in CMOS VLSI

USAGE OF FIREFLY ALGORITHM IN VIGNERE CIPHER TO REDUCE VARIABLE LENGTH KEY SEARCH TIME

AWord-Based Genetic Algorithm for Cryptanalysis of Short Cryptograms

Inter-Schools Literacy Olympiads

Ciphers that Substitute Symbols

Advanced Devices. Registers Counters Multiplexers Decoders Adders. CSC258 Lecture Slides Steve Engels, 2006 Slide 1 of 20

Transcription:

An Introduction to http://www.southernct.edu/~fields/

Terminology is the study of secret writing. This is the only branch of mathematics to be designated by the U.S. government as export-controlled. Cryptographic knowledge is considered to be war materials! While we won t head off into TOP SECRET territory we will have a bit of fun working out how to make (and to break) good secret codes.

the enigma Terminology

WACs Terminology

or Cryptology? Terminology means secret writing

or Cryptology? Terminology means secret writing Cryptology means the study of secrets

or Cryptology? Terminology means secret writing Cryptology means the study of secrets practically speaking, they are synonyms...

Cast of Characters Terminology Alice (the sender) wants to send a message to...

Cast of Characters Terminology Alice (the sender) wants to send a message to... Bob (the recipient) but they are afraid that...

Cast of Characters Terminology Alice (the sender) wants to send a message to... Bob (the recipient) but they are afraid that... Eve (the eavesdropper) will snoop on them and learn their secrets.

Components Terminology plaintext is the message that Alice wants to send.

Components Terminology plaintext is the message that Alice wants to send. ciphertext is the scrambled/unreadable thing she actually sends.

Components Terminology plaintext is the message that Alice wants to send. ciphertext is the scrambled/unreadable thing she actually sends. encryption is the process of converting plaintext to ciphertext.

Components Terminology plaintext is the message that Alice wants to send. ciphertext is the scrambled/unreadable thing she actually sends. encryption is the process of converting plaintext to ciphertext. decryption is the reverse process.

Components Terminology plaintext is the message that Alice wants to send. ciphertext is the scrambled/unreadable thing she actually sends. encryption is the process of converting plaintext to ciphertext. decryption is the reverse process. is what Eve has to do in order to break the code.

A cryptosystem Terminology The term cryptosystem is used to describe any systematic way to do encryption and decryption of messages.

A cryptosystem Terminology The term cryptosystem is used to describe any systematic way to do encryption and decryption of messages. Usually a key must also be chosen (in advance) by Alice and Bob.

A cryptosystem Terminology The term cryptosystem is used to describe any systematic way to do encryption and decryption of messages. Usually a key must also be chosen (in advance) by Alice and Bob. If Eve knows the cryptosystem, she can attempt a brute force attack try every possible key...

security through obscurity Terminology People used to believe that a really Byzantine cryptosystem for which Eve couldn t even guess what the possible keys could be would allow Alice and Bob to communicate securely.

security through obscurity Terminology People used to believe that a really Byzantine cryptosystem for which Eve couldn t even guess what the possible keys could be would allow Alice and Bob to communicate securely. Arguably, this is why Japan and Germany lost World War II.

security through obscurity Terminology People used to believe that a really Byzantine cryptosystem for which Eve couldn t even guess what the possible keys could be would allow Alice and Bob to communicate securely. Arguably, this is why Japan and Germany lost World War II. Shannon s Maxim: The enemy knows the system (Claude Shannon (1916-2001)

cribs Terminology If you have some idea what an encrypted message may be about, this allows you to make a list of cribs. Cribs are words or phrases that may be part of the plaintext.

steganography the Caesar shift how can they decode it if they don t even know there is a message?

steganography the Caesar shift how can they decode it if they don t even know there is a message? Tatoo a message on a slave s shaved head, then let their hair grow back.

steganography the Caesar shift how can they decode it if they don t even know there is a message? Tatoo a message on a slave s shaved head, then let their hair grow back. Yesterday, Oliver used a relatively easy secret message analyzer really terrific!

steganography the Caesar shift how can they decode it if they don t even know there is a message? Tatoo a message on a slave s shaved head, then let their hair grow back. Yesterday, Oliver used a relatively easy secret message analyzer really terrific! It has been claimed that the Al Qaeda network hides messages in the low bits of pixels in internet porn.

Roman cryptography steganography the Caesar shift Supposedly, Julius Caesar invented a simple cryptosystem: shift each letter in a message 3 units up in the alphabet:

Roman cryptography steganography the Caesar shift Supposedly, Julius Caesar invented a simple cryptosystem: shift each letter in a message 3 units up in the alphabet: So, Attack at dawn on Friday would be encrypted as

steganography the Caesar shift Roman cryptography Supposedly, Julius Caesar invented a simple cryptosystem: shift each letter in a message 3 units up in the alphabet: So, Attack at dawn on Friday would be encrypted as Dwwdfn dw gdzq rq iulgdb

Activity I steganography the Caesar shift Write a creative message (not too long please... ) and encrypt it with the Caesar shift. Trade with another group and decrypt their message.

shift ciphers some mathematical preliminaries The Caesar shift is the basis of the simple cryptosystem known as the shift cipher. The key in a shift cipher is the amount of shifting that we will do to encode a message. (For the original Caesar shift the key is k = 3.)

its not that many possibilities some mathematical preliminaries There are only 25 possible different amounts of shifting that one can do.

its not that many possibilities some mathematical preliminaries There are only 25 possible different amounts of shifting that one can do. We say there are 25 elements in the keyspace

its not that many possibilities some mathematical preliminaries There are only 25 possible different amounts of shifting that one can do. We say there are 25 elements in the keyspace It s not really that hard to just try all the possibilities and see if any of them look intelligible.

Activity II some mathematical preliminaries Pick a key this should be a relatively small integer. Lets keep things in the range -5 to 5. Write a creative message and encrypt it with the shift cipher using your key. Trade with another group and decrypt their message.

too easy some mathematical preliminaries To get a useful cryptosystem we will need to develop a scheme where there are many more keys!

clock arithmetic some mathematical preliminaries If it is 9:00 o clock, what time will it be in 5 hours?

clock arithmetic some mathematical preliminaries If it is 9:00 o clock, what time will it be in 5 hours? So 9+5 = 2.

clock arithmetic some mathematical preliminaries If it is 9:00 o clock, what time will it be in 5 hours? So 9+5 = 2. Hmmmm...

clock arithmetic some mathematical preliminaries If it is 9:00 o clock, what time will it be in 5 hours? So 9+5 = 2. Hmmmm... Suppose it s zero o clock. (You can continue to call it 12 if you want, but 0 is really more sensible.)

clock arithmetic some mathematical preliminaries If it is 9:00 o clock, what time will it be in 5 hours? So 9+5 = 2. Hmmmm... Suppose it s zero o clock. (You can continue to call it 12 if you want, but 0 is really more sensible.) What time will it be after 5 five hour time periods go by?

clock arithmetic some mathematical preliminaries If it is 9:00 o clock, what time will it be in 5 hours? So 9+5 = 2. Hmmmm... Suppose it s zero o clock. (You can continue to call it 12 if you want, but 0 is really more sensible.) What time will it be after 5 five hour time periods go by? So 5 5 = 1.

some practice some mathematical preliminaries 11 + 2 =

some practice some mathematical preliminaries 11 + 2 = 1

some practice some mathematical preliminaries 11 + 2 = 1 7 5 =

some practice some mathematical preliminaries 11 + 2 = 1 7 5 = 35

some practice some mathematical preliminaries 11 + 2 = 1 7 5 = 35 = 36 1

some practice some mathematical preliminaries 11 + 2 = 1 7 5 = 35 = 36 1 = 11

some practice some mathematical preliminaries 11 + 2 = 1 7 5 = 35 = 36 1 = 11 11 11 =

some practice some mathematical preliminaries 11 + 2 = 1 7 5 = 35 = 36 1 = 11 11 11 = 121

some practice some mathematical preliminaries 11 + 2 = 1 7 5 = 35 = 36 1 = 11 11 11 = 121 = 1

some practice some mathematical preliminaries 11 + 2 = 1 7 5 = 35 = 36 1 = 11 11 11 = 121 = 1 6 8 =

some practice some mathematical preliminaries 11 + 2 = 1 7 5 = 35 = 36 1 = 11 11 11 = 121 = 1 6 8 = 48 = 0

clocks on other planets some mathematical preliminaries A clock with 7 hours on it: 0 6 1 5 2 4 3

mod 7 operations some mathematical preliminaries 4 + 5 =

mod 7 operations some mathematical preliminaries 4 + 5 = 2

mod 7 operations some mathematical preliminaries 4 + 5 = 2 6 + 4 =

mod 7 operations some mathematical preliminaries 4 + 5 = 2 6 + 4 = 3

mod 7 operations some mathematical preliminaries 4 + 5 = 2 6 + 4 = 3 3 4 =

mod 7 operations some mathematical preliminaries 4 + 5 = 2 6 + 4 = 3 3 4 = 5

mod 7 operations some mathematical preliminaries 4 + 5 = 2 6 + 4 = 3 3 4 = 5 Notice that the zero product property holds, since 7 is prime.

some mathematical preliminaries mod 26 operations and the alphabet Each letter of the alphabet can be thought of as a number from 0 to 25. (A=0, B=1, C=2, etc.)

some mathematical preliminaries mod 26 operations and the alphabet Each letter of the alphabet can be thought of as a number from 0 to 25. (A=0, B=1, C=2, etc.) The Caesar shift can now be described mathematically: x x + 3 (mod 26) The general shift cipher with key k is: x x + k (mod 26)

trouble in paradise some mathematical preliminaries Sadly, arithmetic mod 26 is not so nice. Twenty-six is not prime and the zero product property fails in mod 26.

trouble in paradise some mathematical preliminaries Sadly, arithmetic mod 26 is not so nice. Twenty-six is not prime and the zero product property fails in mod 26. The problem we are worried about is whether a given operation can be inverted. Adding (i.e. doing a shift) is always invertible (just shift the other way).

trouble in paradise some mathematical preliminaries Sadly, arithmetic mod 26 is not so nice. Twenty-six is not prime and the zero product property fails in mod 26. The problem we are worried about is whether a given operation can be inverted. Adding (i.e. doing a shift) is always invertible (just shift the other way). Multiplying, on the other hand...

trouble in paradise some mathematical preliminaries Sadly, arithmetic mod 26 is not so nice. Twenty-six is not prime and the zero product property fails in mod 26. The problem we are worried about is whether a given operation can be inverted. Adding (i.e. doing a shift) is always invertible (just shift the other way). Multiplying, on the other hand... The trouble arises because 26 = 2 13 so if we avoid numbers that have either 2 or 13 as factors life will be good.

the affine cipher some mathematical preliminaries In the affine cipher we encrypt using the map x mx + b (mod 26).

the affine cipher some mathematical preliminaries In the affine cipher we encrypt using the map x mx + b (mod 26). A key is now a pair of things: m and b.

the affine cipher some mathematical preliminaries In the affine cipher we encrypt using the map x mx + b (mod 26). A key is now a pair of things: m and b. The choices for m are limited to odd numbers other than 13 in the range 0 to 25. For b we can use anything in that range.

the affine cipher some mathematical preliminaries In the affine cipher we encrypt using the map x mx + b (mod 26). A key is now a pair of things: m and b. The choices for m are limited to odd numbers other than 13 in the range 0 to 25. For b we can use anything in that range. The keyspace contains 12 26 = 312 elements.

the affine cipher some mathematical preliminaries In the affine cipher we encrypt using the map x mx + b (mod 26). A key is now a pair of things: m and b. The choices for m are limited to odd numbers other than 13 in the range 0 to 25. For b we can use anything in that range. The keyspace contains 12 26 = 312 elements. Suddenly a brute force approach is looking less enticing.

Activity III some mathematical preliminaries The following message was encrypted with an affine cipher where the key was m = 3 and b = 2. I also took out spaces and punctuation (as is typical of encrypted ciphertext). What does it say?

Activity III some mathematical preliminaries The following message was encrypted with an affine cipher where the key was m = 3 and b = 2. I also took out spaces and punctuation (as is typical of encrypted ciphertext). What does it say? CBOQOXCNAPURKPWOH

duoncfzimepghvrxtjsbwlyqak the substitution cipher the Vigenère cipher the one time pad

duoncfzimepghvrxtjsbwlyqak the substitution cipher the Vigenère cipher the one time pad You can make a cipher by choosing an essentially random encoding for each letter of the alphabet

duoncfzimepghvrxtjsbwlyqak the substitution cipher the Vigenère cipher the one time pad You can make a cipher by choosing an essentially random encoding for each letter of the alphabet There are as many keys as there are possible permutations of 26 things.

duoncfzimepghvrxtjsbwlyqak the substitution cipher the Vigenère cipher the one time pad You can make a cipher by choosing an essentially random encoding for each letter of the alphabet There are as many keys as there are possible permutations of 26 things. 26! = 26 25 24... 3 2 1 4.03 10 26

duoncfzimepghvrxtjsbwlyqak the substitution cipher the Vigenère cipher the one time pad You can make a cipher by choosing an essentially random encoding for each letter of the alphabet There are as many keys as there are possible permutations of 26 things. 26! = 26 25 24... 3 2 1 4.03 10 26 Kind of a lot of those keys would be weak, in the sense that too many letters would be encrypted as themselves. But even if we restrict to only those permutations where every letter gets moved there are plenty of keys.

frequency analysis the substitution cipher the Vigenère cipher the one time pad If you have a chunk of ciphertext and one-fifth of the symbols are Q s I ll bet you can guess what letter Q represents.

frequency analysis the substitution cipher the Vigenère cipher the one time pad If you have a chunk of ciphertext and one-fifth of the symbols are Q s I ll bet you can guess what letter Q represents. RSTLN and E

frequency analysis the substitution cipher the Vigenère cipher the one time pad If you have a chunk of ciphertext and one-fifth of the symbols are Q s I ll bet you can guess what letter Q represents. RSTLN and E With a sufficiently large sample of ciphertext we can use an analysis of the frequency that the symbols occur to guess (accurately) about what the decryptions of certain symbols are.

The undecipherable cipher the substitution cipher the Vigenère cipher the one time pad

The undecipherable cipher the substitution cipher the Vigenère cipher the one time pad Vigenère actually invented an even better type of cipher, but through a misattribution his name is associated with this scheme, so he s just stuck with it.

The undecipherable cipher the substitution cipher the Vigenère cipher the one time pad Vigenère actually invented an even better type of cipher, but through a misattribution his name is associated with this scheme, so he s just stuck with it. In this cipher we return to simply shifting the symbols of our plaintext up in the alphabet, but each symbol is shifted by a different amount.

The undecipherable cipher the substitution cipher the Vigenère cipher the one time pad Vigenère actually invented an even better type of cipher, but through a misattribution his name is associated with this scheme, so he s just stuck with it. In this cipher we return to simply shifting the symbols of our plaintext up in the alphabet, but each symbol is shifted by a different amount. Each time we run into an E it will get shifted to some other letter but a different one each time! Frequency analysis will no longer work.

the substitution cipher the Vigenère cipher the one time pad lemonlemonlemonlemonlemonlem

the substitution cipher the Vigenère cipher the one time pad lemonlemonlemonlemonlemonlem The original implementations of the Vigenère cipher involved using a word or a short phrase as the key.

the substitution cipher the Vigenère cipher the one time pad lemonlemonlemonlemonlemonlem The original implementations of the Vigenère cipher involved using a word or a short phrase as the key. The key s letters tell you how much to shift.

the substitution cipher the Vigenère cipher the one time pad lemonlemonlemonlemonlemonlem The original implementations of the Vigenère cipher involved using a word or a short phrase as the key. The key s letters tell you how much to shift. The key would be repeated as often as necessary so as to produce shift amounts for all of the letters in the plaintext.

really?!? the substitution cipher the Vigenère cipher the one time pad

really?!? the substitution cipher the Vigenère cipher the one time pad Cryptanalysts eventually showed how to break Vigenere ciphers.

really?!? the substitution cipher the Vigenère cipher the one time pad Cryptanalysts eventually showed how to break Vigenere ciphers. If you can figure out the length of the key you can break a Vigenere cipher into a bunch of parallel shift ciphers

really?!? the substitution cipher the Vigenère cipher the one time pad Cryptanalysts eventually showed how to break Vigenere ciphers. If you can figure out the length of the key you can break a Vigenere cipher into a bunch of parallel shift ciphers Each of those is easy to break seperately.

provably secure the substitution cipher the Vigenère cipher the one time pad

provably secure the substitution cipher the Vigenère cipher the one time pad Even if you make the key for a Vigenere cipher so long that there are never repeats, it is possible to break them with some very high-powered statistical analysis.

provably secure the substitution cipher the Vigenère cipher the one time pad Even if you make the key for a Vigenere cipher so long that there are never repeats, it is possible to break them with some very high-powered statistical analysis. However, if we make the key for a Vigenere-type cipher be an arbitrarily long random sequence of letters we will have secure communication.

provably secure the substitution cipher the Vigenère cipher the one time pad Even if you make the key for a Vigenere cipher so long that there are never repeats, it is possible to break them with some very high-powered statistical analysis. However, if we make the key for a Vigenere-type cipher be an arbitrarily long random sequence of letters we will have secure communication. This is called a one time pad

provably secure the substitution cipher the Vigenère cipher the one time pad Even if you make the key for a Vigenere cipher so long that there are never repeats, it is possible to break them with some very high-powered statistical analysis. However, if we make the key for a Vigenere-type cipher be an arbitrarily long random sequence of letters we will have secure communication. This is called a one time pad There are certain places where you do not want to be caught with an arbitrarily long random sequence of letters about your person.

thanks! the substitution cipher the Vigenère cipher the one time pad Thank for coming, I hope you had fun! http://www.nsa.gov/kids/