Purple 1 Purple Purple 2 Purple  Used by Japanese government o Diplomatic communications o Named for color of binder cryptanalysts used o Other Japanese.

Slides:



Advertisements
Similar presentations
Cryptography encryption authentication digital signatures
Advertisements

Classical Encryption Techniques Week 6-wend. One-Time Pad if a truly random key as long as the message is used, the cipher will be secure called a One-Time.
Intro 1 Introduction Intro 2 Good Guys and Bad Guys  Alice and Bob are the good guys  Trudy is the bad guy  Trudy is our generic “intruder”
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Cryptography and Network Security Chapter 3
WEP 1 WEP WEP 2 WEP  WEP == Wired Equivalent Privacy  The stated goal of WEP is to make wireless LAN as secure as a wired LAN  According to Tanenbaum:
PURPLE and The Life of William Friedman Peter Smith Matt Salmon.
Enigma? Several Images from Wikipedia (an online encyclopedia)
Enigma Meghan Emilio Faculty Sponsor: Ralph Morelli (Computer Science)
Modern Cryptography.
FEAL FEAL 1.
Sigaba 1 Sigaba Sigaba 2 Sigaba  Used by Americans during WWII o And afterwards (to about 1948)  Never broken o Germans quit collecting, considered.
RC4 1 RC4 RC4 2 RC4  Invented by Ron Rivest o “RC” is “Ron’s Code” or “Rivest Cipher”  A stream cipher  Generate keystream byte at a step o Efficient.
Chapter 2 Basic Encryption and Decryption (part B)
Lecture 23 Symmetric Encryption
CMEA 1 CMEA. CMEA 2 CMEA  Cellular Message Encryption Algorithm  Designed for use with cell phones o To protect confidentiality of called number o For.
Enigma Meghan Emilio Advisor: Professor Ralph Morelli April 2004.
What is Cryptography? Definition: The science or study of the techniques of secret writing, esp. code and cipher systems, methods, and the like Google.
Enigma 1 Enigma Enigma 2 Enigma  Developed and patented (in 1918) by Arthur Scherbius  Many variations on basic design  Eventually adopted by Germany.
Computer Security CS 426 Lecture 3
Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.
Chapter 2 – Classical Encryption Techniques
3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.
Polyalphabetic Substitution Ciphers. First Steps Towards Complexity  If one alphabet is good, then two alphabets must be better!  By doubling the number.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
CSCI 5857: Encoding and Encryption
Confusion and Diffusion1 Ref: William Stallings, Cryptography and Network Security, 3rd Edition, Prentice Hall, 2003.
Security in Computing Chapter 12, Cryptography Explained Part 6
Hill Cipher Developed by the mathematician Lester Hill in The encryption algorithm takes m successive plain text and substitute for them m cipher.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Chapter 20 Symmetric Encryption and Message Confidentiality.
Lec. 5 : History of Cryptologic Research II
Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.
Based on Applied Cryptography by Schneier Chapter 1: Foundations Dulal C. Kar.
LIS508 last lecture: Cryptography & Security Thomas Krichel
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
National Institute of Science & Technology Cryptology and Its Applications Akshat Mathur [1] Cryptology and Its Applications Presented By AKSHAT MATHUR.
Symmetric-Key Cryptography
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
Terminology and classical Cryptology
CSCI 5857: Encoding and Encryption
Data Security and Encryption (CSE348) 1. Lecture # 6 2.
Introduction to Ciphers Breno de Medeiros. Cipher types From “Cipher”, Wikipedia article.
Classical Crypto By: Luong-Sorin VA, IMIT Dith Nimol, IMIT.
Lecture 3 Page 1 Advanced Network Security Review of Cryptography Advanced Network Security Peter Reiher August, 2014.
Traditional Symmetric-Key Ciphers
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami 2 nd Semester
Computer Security Cryptography. Cryptography Now and Before  In the past – mainly used for confidentiality  Today –Still used for confidentiality –Data.
Introduction to Modern Symmetric-key Ciphers
Lecture 23 Symmetric Encryption
The Storyboard stage. Mention what will be your animation medium: 2D or 3D Mention the software to be used for animation development: JAVA, Flash, Blender,
Computer and Network Security Rabie A. Ramadan Lecture 3.
DATA & COMPUTER SECURITY (CSNB414) MODULE 3 MODERN SYMMETRIC ENCRYPTION.
1 CIS 5371 Cryptography 1.Introduction. 2 Prerequisites for this course  Basic Mathematics, in particular Number Theory  Basic Probability Theory 
The Enigma Machine Eric Roberts CS 106A February 3, 2016.
Network Security Lecture 13 Presented by: Dr. Munam Ali Shah.
Wired Equivalent Privacy (WEP) Chris Overcash. Contents What is WEP? What is WEP? How is it implemented? How is it implemented? Why is it insecure? Why.
@Yuan Xue CS 285 Network Security Block Cipher Principle Fall 2012 Yuan Xue.
3.1 Chapter 3 Traditional Symmetric-Key Ciphers Part2.
CH15 –Security & Crypto.
Enigma Machine.
Rotor Ciphers.
STREAM CIPHERS by Jennifer Seberry.
Chapter -2 Block Ciphers and the Data Encryption Standard
RC4 RC
Cryptography Lecture 16.
Modern Cryptography.
Symmetric Encryption or conventional / private-key / single-key
Florida State University
Presentation transcript:

Purple 1 Purple

Purple 2 Purple  Used by Japanese government o Diplomatic communications o Named for color of binder cryptanalysts used o Other Japanese ciphers: Red, Coral, Jade, etc.  Not used for tactical military info o That was JN-25  Used to send infamous “14-part” message o Broke off negotiations with U.S. o Supposed to be delivered in Washington immediately before attack at Pearl Harbor o Actually delivered after attack began

Purple 3 Purple  The “14-part” message o Decrypted by U.S. on December 6, 1941 o No explicit warning of attack but… o …General Marshall sent warning to Hawaii o Warning arrived after attack was over o Endless fuel for conspiracy theorists  Purple provided useful intelligence o For example, info on German D-day defenses  Tactical military info was from JN-25 o Midway/Coral Sea, Admiral Yamamoto, etc.

Purple 4 Purple  No intact Purple machine ever found  This fragment from embassy in Berlin o Recovered from rubble at the end of war

Purple 5 Purple  Simulator constructed by American cryptanalysts o Rowlett gets most credit o Friedman, others involved  Simulator based on intercepted ciphertext o Analysts never saw the Purple machine… o …yet they built a functioning replica o Some say it was greatest crypto success of the war

Purple 6 Purple  Switched permutations o Not rotors!!!  S,L,M, and R are switches o Each step, one of the perms switches to a different perm

Purple 7 Purple  Input letter permuted by plugboard, then…  Vowels and consonants sent thru different switches  The “6-20 split”

Purple 8 Purple  Switch S o Steps once for each letter typed o Permutes vowels  Switches L,M,R o One of these steps for each letter typed o L,M,R stepping determined by S

Purple 9 Purple Plugboard  Purple Plugboard o Every letter plugged to another letter o Not the same as Enigma stecker  Purple, plugboard o Could be any permutation of 26 letters  Enigma stecker o Pairs connected (so stecker is its own inverse) o Only a limited set of perms are possible

Purple 10 Purple  Each switch S,L,M,R has 25 different, unrelated, hardwired permutations o Each L,M,R permutes 20 consonants o Each S permutes 6 vowels  Period for 6s perms is 25  Period for 20s perms is 25 3 = 15,625  Set fast, medium, slow of L,M,R

Purple 11 Purple  Each switch S,L,M,R has 25 different, unrelated, hardwired permutations o Each L,M,R permutes 20 consonants o Each S permutes 6 vowels  Purple is not its own inverse  To decrypt? Reverse the flow thru diagram  In WWII, input and output plugboard settings were apparently always the same o Why?

Purple 12 Purple Encryption  Let P I,P O,P S,P R,P M,P L be input and output plugboards, “sixes” perm, R,M,L “twenties” perms, respectively  Note: P S,P R,P M,P L vary with step  Then encryption formula is

Purple 13 Purple Encryption  And decryption is  If P I  P O then decryption is complex  Requires inverse plugboard perms o Or tricky wiring

Purple 14 Purple Keyspace  If switch perms unknown, then (6!) 25  (20!) 75 =  = switches 25 4 = switch initial settings 6 = choices for fast, medium, slow (26!) 2 = plugboards  Implies keyspace is about

Purple 15 Purple Keyspace  If switch perms are known, then 25 4 = switch initial settings 6 = choices for fast, medium, slow (26!) 2 = plugboard (assuming only 1)  Keyspace is “only” about  Note that most of this is due to plugboard o But plugboard is cryptographically very weak

Purple 16 Purple  Purple message included “message indicator” o “Code” to specify initial switch settings o MI different for each message  “Daily key” was plugboard setting  Cryptanalysts needed to o Determine inner workings of machine, that is, diagnose the machine o Break indicator system (easier)

Purple 17 Purple  Only about 1000 daily keys used  So once the machine was known o After a number of successful attacks… o …cryptanalysts could decrypt messages as fast as (or faster than) the Japanese  But, how to diagnose the machine?  Only ciphertext is available!

Purple 18 Purple Diagnosis  From cryptanalysts perspective o Know Purple is poly-alphabetic substitution o But how are permutations generated?  The 6-20 split is a weakness o Suppose D,E,H,Q,W,X are plugged to vowels A,E,I,O,U,Y, respectively, by input plugboard o Assume input/output plugboards are the same o Then output D,E,H,Q,W,X go thru S perms o All other output letters go thru L,M,R perms o So what?

Purple Split  Suppose D,E,H,Q,W,X are the sixes  Input plugboard o Connects D,E,H,Q,W,X to vowels  Output plugboard o Connects A,E,I,O,U,Y to D,E,H,Q,W,X  Can cryptanalyst determine the sixes?

Purple Split  Average letter frequency of D,E,H,Q,W,X is about 4.3%  Average letter frequency of remaining 20 letters is about 3.7%  Each of the sixes letters should appear about 4.3% of the time  Each “ 20 ” should appear about 3.7%

Purple Split  For any ciphertext of reasonable length, usually relatively easy to find 6s o 6 high frequency or 6 low frequency letters  Then easy to find 6s permutations o Hardwired, so never change (only 25 of them)  With this info, can decrypt some messages o Especially if 6s were actually vowels… o As was the case with Red (predecessor to Purple)

Purple Split  Can solve for the 6s…  But what about 20s?  WWII cryptanalysts familiar with rotors o From ciphertext, easy to see that Purple not a rotor machine… o But what was it?  Suppose, many messages collected, many of these broken, so known plaintext available

Purple 23 20s  Suppose that many messages encrypted with same key o Said to be in depth  Suppose the plaintext is also known  Then analyst knows lots of 20s perms…  But this is only a small part of key space  So how can this help? o Consider a scaled-down example

Purple 24 20s  Consider “7s” instead of “20s” o Numbers instead of letters o Then perms of 0,1,2,3,4,5,6  Known plaintext so encryption perms known o Msg 1, first position, plaintext 4  ciphertext 1 o Msg 2, first position, plaintext 0  ciphertext 5 o Msg 3 first position, plaintext 5  ciphertext 2 o Msg 4, first position, plaintext 6  ciphertext 4 o Msg 5, first position, plaintext 3  ciphertext 3 o Msg 6, first position, plaintext 1  ciphertext 6 o Msg 7, first position, plaintext 2  ciphertext 0  Then 1st perm is 5,6,0,3,1,2,4

Purple 25 20s (actually, 7s) permutations keypositionkeyposition

Purple 26 20s  Pattern on previous slide occurs if same sequence of permutations applied o But input is different (permuted) o Consistent with “switched” permutations  Looks easy here, but not so easy when o Period of 25 for fast 20s switch o Only partial permutations available o Do not know what you are looking for!

Purple 27 20s  Analysts determined three switches o Each with 25 perms  Can then solve equations to peel apart hardwired permutations  Had to construct a working Purple simulator o How to do so?

Purple 28 20s  How to implement switched perms?  Used six 4-level telephone switches  Discovered after the war that this is exactly what Japanese had used  That’s what you call ironic…

Purple 29 Hill Climb Attack  In modern symmetric ciphers o If key is incorrect by one bit, then putative decrypt unrealted to plaintext  Purple cipher o “Nearby” plugboard settings yield approximate plaintext o A so-called hill climb attack is possible

Purple 30 Cryptanalysts  Purple broken by Frank Rowlett’s team  Rowlett among designers of Sigaba o Sigaba was never broken during war o Today, Sigaba not trivial to break  We talk about Sigaba next…

Purple 31 Purple: The Bottom Line  As with Enigma, designers confused physical security and statistical security o Even worse for Purple than with Enigma o Physical security of Purple was protected  Once Purple machine diagnosed o And message indicator system broken  Then a very small number of “keys” o Only about 1000 plugboard settings