Historical Ciphers. ECE Lecture 6. Why (not) to study historical ciphers? Required Reading. Secret Writing. Mary, Queen of Scots
|
|
- Junior Burns
- 6 years ago
- Views:
Transcription
1 ECE - Lecture Required Reading W tallings, Cryptography and Network ecurity, Historical Ciphers Chapter, Classical Encryption Techniques A Menezes et al, Handbook of Applied Cryptography, Chapter 73 Classical ciphers and historical development Why (not) to study historical ciphers? ecret Writing AGAINT Not similar to modern ciphers Long abandoned FOR Basic components became a part of modern ciphers Under special circumstances modern ciphers can be reduced to historical ciphers Influence on world events The only ciphers you can break! teganography (hidden messages) Codes (replace words) ubstitution Transformations ubstitution Ciphers (replace letters) Cryptography (encrypted messages) Transposition Ciphers (change the order of letters) elected world events affected by cryptology 5 - trial of Mary Queen of cots - substitution cipher 97 - Zimmermann telegram, America enters World War I Battle of England, Battle of Atlantic, D-day - ENIGMA machine cipher 9 world s first computer, Colossus - German Lorenz machine cipher 95s operation Venona breaking ciphers of soviet spies stealing secrets of the U atomic bomb one-time pad Mary, Queen of cots cottish Queen, a cousin of Elisabeth I of England Forced to flee cotland by uprising against her and her husband Treated as a candidate to the throne of England by many British Catholics unhappy about a reign of Elisabeth I, a Protestant Imprisoned by Elisabeth for 9 years Involved in several plots to assassinate Elisabeth Put on trial for treason by a court of about noblemen, including Catholics, after being implicated in the Babington Plot by her own letters sent from prison to her co-conspirators in the encrypted form
2 Mary, Queen of cots cont cipher used for encryption was broken by codebreakers of Elisabeth I it was so called nomenclator mixture of a code and a substitution cipher Mary was sentenced to death for treachery and executed in 57 at the age of Zimmermann Telegram sent on January, 97 from the Foreign ecretary of the German Empire, Arthur Zimmermann, to the German ambassador in Washington instructed the ambassador to approach the Mexican government with a proposal for military alliance against the U offered Mexico generous material aid to be used to reclaim a part of territories lost during the Mexican-American War of -, specifically Texas, New Mexico, and Arizona sent using a telegram cable that touched British soil encrypted with cipher 75, which British codebreakers had partly broken intercepted and decrypted Zimmermann Telegram British foreign minister passed the ciphertext, the message in German, and the English translation to the American ecretary of tate, and he has shown it to the President Woodrow Wilson A version released to the press was that the decrypted message was stolen from the German embassy in Mexico After publishing in press, initially believed to be a forgery On February, Germany had resumed "unrestricted" submarine warfare, which caused many civilian deaths, including American passengers on British ships On March 3, 97 and later on March 9, 97, Arthur Zimmermann was quoted saying "I cannot deny it It is true On April, 97, President Wilson asked Congress to declare war on Germany On April, 97, Congress complied, bringing the United tates into World War I Ciphers used predominantly in the given period() Cryptography Cryptanalysis BC hift ciphers Monoalphabetic substitution cipher Frequency analysis al-kindi, Baghdad IX c 5 Invention of the Vigenère Cipher Homophonic ciphers Black chambers XVIII c 99 ( nd ed) 999 Vigenère cipher Kasiski s method (imple polyalphabetic substitution ciphers) 99 Invention of rotor machines Index of coincidence William Friedman Electromechanical machine ciphers (Complex polyalphabetic substitution ciphers) 9 Vernam cipher (one-time pad) 3 9
3 Ciphers used predominantly in the given period() Cryptography Cryptanalysis ubstitution Ciphers () Monalphabetic (simple) substitution cipher 99 hennon s theory of secret systems one-time pad tream Ciphers -P networks 977 Publication of DE DE Triple DE AE Reconstructing ENIGMA Rejewski, Poland Polish cryptological bombs, and perforated sheets British cryptological bombs, Bletchley Park, UK Breaking Japanese Purple cipher DE crackers M = m m m 3 m m N C = f(m ) f(m ) f(m 3 ) f(m ) f(m N ) Generally f is a random permutation, eg, f = a b c d e f g h i j k l m n o p q r s t u v w x y z s l t a v m c e r u b q p d f k h w y g x z j n i o Key = f Number of keys =!» Monalphabetic substitution ciphers implifications () A Caesar Cipher B hift Cipher c i = f(m i ) = m i + 3 mod m i = f - (c i ) = c i - 3 mod No key c i = f(m i ) = m i + k mod m i = f - (c i ) = c i - k mod Key = k Number of keys = Coding characters into numbers A Û B Û C Û D Û 3 E Û F Û 5 G Û H Û 7 I Û J Û 9 K Û L Û M Û N Û 3 O Û P Û 5 Q Û R Û 7 Û T Û 9 U Û V Û W Û X Û 3 Y Û Z Û 5 Caesar Cipher: Example Monalphabetic substitution ciphers implifications () Plaintext: Ciphertext: I C A M E I A W I C O N Q U E R E D L F D P H L V D Z L F R Q T X H U H G C Affine Cipher c i = f(m i ) = k m i + k mod gcd (k, ) = m i = f - (c i ) = k - (c i - k ) mod Key = (k, k ) Number of keys = = 3 3
4 Most frequent single letters Average frequency in a random string of letters: = 3 = 3% Average frequency in a long English text: E 3% T, N, R, I, O, A, %-9% D, H, L 35%-5% C, F, P, U, M, Y, G, W, V 5%-3% B, X, K, Q, J, Z < % Most frequent digrams, and trigrams Digrams: TH, HE, IN, ER, RE, AN, ON, EN, AT Trigrams: THE, ING, AND, HER, ERE, ENT, THA, NTH, WA, ETH, FOR, DTH Relative frequency of letters in a long English text by tallings A B C D E F G H I J K L M N O P Q R T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e f g h i j k l m n o p q r s t u v w x y z in a long English plaintext in the corresponding ciphertext for a shift cipher a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e f g h i j k l m n o p q r s t u v w x y z in a long English plaintext in the corresponding ciphertext for a general monoalphabetic substitution cipher Frequency analysis attack: relevant frequencies a b c d e f g h i j k lm n o p q r s t u v w x y z Long English text T a b c d e f g h i j k lm n o p q r s t u v w x y z Ciphertext of the long English text T a b c d e f g h I j k l m n o p q r s t u v w x y z hort English message M a b c d e f g h I j k lm n o p q r s t u v w x y z Ciphertext of the short English message M
5 Ciphertext: Frequency analysis attack () tep : Establishing the relative frequency of letters in the ciphertext FMXVE DKAPH FERBN DKRXR REFM ORUD DKDV HVUFE DKAPR KDLYE VLRHH RH Frequency analysis attack () tep : Assuming the relative frequency of letters in the corresponding message, and deriving the corresponding equations Assumption: Most frequent letters in the message: E and T Corresponding equations: A B C D E F G H I J K L M N O P Q R T U V W X Y Z R - D - 7 E, H, K - 5 E R T D f(e) = R f(t) = D f() = 7 f(9) = 3 Frequency analysis attack (3) tep 3: Verifying the assumption for the case of affine cipher f() = 7 f(9) = 3 k + k º 7 (mod ) 9 k + k º 3 (mod ) 5 k º - (mod ) 5 k º (mod ) Breaking the affine cipher () tep : olving the equation of the form a x º b mod n for x = k gcd(5, ) = Thus, one solution 5 k º (mod ) k = (5 - ) mod = 7 mod = However, gcd(k, ) = Thus, our initial assumption incorrect ubstitution Ciphers () Polyalphabetic substitution cipher M = m m m d m d+ m d+ m d m d+ m d+ m 3d C = f (m ) f (m ) f d (m d ) f (m d+ ) f (m d+ ) f d (m d ) f (m d+ ) f ( m d+ ) f d (m 3d ) d is a period of the cipher Key = d, f, f,, f d Number of keys for a given period d = (!) d» ( ) d a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e f g h i j k l m n o p q r s t u v w x y z in a long English plaintext in the corresponding ciphertext for a polyalphabetic substitution cipher %» 3 % 5
6 Polyalphabetic substitution ciphers implifications () A Vigenère cipher: polyalphabetic shift cipher Invented in 5 c i = f i mod d (m i ) = m i + k i mod d mod m i = f - i mod d(c i ) = c i - k i mod d mod Key = k, k,, k d- Number of keys for a given period d = () d plaintext: Key = nsa 3 Vigenère quare a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e f g h i j k l m n o p q r s t u v w x y z b c d e f g h i j k l m n o p q r s t u v w x y z a c d e f g h i j k l m n o p q r s t u v w x y z a b d e f g h i j k l m n o p q r s t u v w x y z a b c e f g h i j k l m n o p q r s t u v w x y z a b c d f g h i j k l m n o p q r s t u v w x y z a b c d e g h i j k l m n o p q r s t u v w x y z a b c d e f h i j k l m n o p q r s t u v w x y z a b c d e f g i j k l m n o p q r s t u v w x y z a b c d e f g h j k l m n o p q r s t u v w x y z a b c d e f g h i k l m n o p q r s t u v w x y z a b c d e f g h i j l m n o p q r s t u v w x y z a b c d e f g h i j k m n o p q r s t u v w x y z a b c d e f g h i j k l n o p q r s t u v w x y z a b c d e f g h i j k l m o p q r s t u v w x y z a b c d e f g h i j k l m n p q r s t u v w x y z a b c d e f g h i j k l m n o q r s t u v w x y z a b c d e f g h i j k l m n o p r s t u v w x y z a b c d e f g h i j k l m n o p q s t u v w x y z a b c d e f g h i j k l m n o p q r t u v w x y z a b c d e f g h i j k l m n o p q r s u v w x y z a b c d e f g h i j k l m n o p q r s t v w x y z a b c d e f g h i j k l m n o p q r s t u w x y z a b c d e f g h i j k l m n o p q r s t u v x y z a b c d e f g h i j k l m n o p q r s t u v w y z a b c d e f g h i j k l m n o p q r s t u v w x z a b c d e f g h i j k l m n o p q r s t u v w x y Plaintext: Key: Encryption: Ciphertext: Vigenère Cipher - Example TO BE OR NOT TO BE NA T O B E O R N O T T O B E G G B R G R A G T G G B R GGBRGRAGTGGBR Determining the period of the polyalphabetic cipher Kasiski s method Ciphertext: G G B R G R A G T G G B R Distance = 9 Period d is a divisor of the distance between identical blocks of the ciphertext In our example: d = 3 or 9 Index of coincidence method () n i - number of occurances of the letter i in the ciphertext i = a z N - length of the ciphertext p i = probability that the letter of the ciphertext is equal to i Index of coincidence method () Measure of roughness: z z M R = æ ö ç p - = - å i p è ø å i i= a i= a p i = lim N z å p i i= a n i N = MR 3 period 5
7 Index of coincidence method (3) Index of coincidence method () Measure of roughness Index of coincidence z The approximation of å z pi i =a Definition: Probability that two random elements of the ciphertext are identical z ni (ni -) ni z Formula: i=a I C = å i =a å N å (n -) n = (N -) N Polyalphabetic substitution ciphers implifications () i MR = IC - = MR period i i=a - (N -) N 3 5 Military Enigma B Rotor machines used before and during the WWII Country Germany: UA: Japan: UK: Poland: Machine Period Enigma d= 5 =,9 M-35, Hagelin M-9 Purple Typex d= (-k), k=5, 7, 9 Lacida d= 3 35 =, Functional diagram & dataflow Enigma Daily Keys 7
8 Order of rotors (Walzenlage) Positions of rings (Ringstellung) combinations 3 combinations Plugboard Connections (teckerverbindung) Initial Positions of Rotors (Grundstellung) ~ 5 5 combinations 3 combinations Number of possible internal connections of Enigma 3 Total Number of Keys 3» 75 Larger number of keys than DE Estimated number of atoms in the universe
9 Broken by Polish Cryptologists 93-9 Enigma Timetable: 939 Jul 5-, 939: A secret meeting takes place in the Kabackie Woods near the town Pyry (outh of Warsaw), where the Poles hand over to the French and British Intelligence ervice their complete solution to the German Enigma cipher, and two replicas of the Enigma machine Marian Rejewski (born 95) Jerzy Różycki (born 99) Henryk Zygalski (born 97) Improvements and new methods developed by British cryptologists Alan Turing (born 9) Gordon Welchman (born 9) Enigma Timetable: : Alan Turing develops an idea of the British cryptological Bombe based on the known-plaintext attack Gordon Welchman develops an improvement to the Turing s idea called diagonal board Harold Doc Keen, engineer at British Tabulating Machines (BTM) becomes responsible for implementing British Bombe 9
10 May, 9: First British cryptological bombe developed to reconstruct daily keys goes into operation Over Bombes are used in England throughout the war Each bombe weighed one ton, and was 5 feet high, 7 feet long, feet wide Enigma Timetable: 93 Apr, 93: The production of the American Bombe starts in the National Cash Register Company (NCR) in Dayton, Ohio The engineering design of the bombe comes from Joseph Desch Machines were operated by members of the Women s Royal Naval ervice, Wrens ubstitution Ciphers (3) 3 Running-key cipher M = m m m 3 m m N K = k k k 3 k k N K is a fragment of a book C = c c c 3 c c N c i = m i + k i mod m i = c i - k i mod Key: book (title, edition), position in the book (page, row) a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e f g h i j k l m n o p q r s t u v w x y z in a long English plaintext in the corresponding ciphertext for a running-key cipher %» 3 % ubstitution Ciphers () Polygram substitution cipher M = m m m d - M m d+ m d+ m d - M m d+ m d+ m 3d - M 3 C = c c c d - C c d+ c d+ c d - C c d+ c d+ c 3d - C 3 d is the length of a message block C i = f(m i ) M i = f - (C i ) Key = d, f Number of keys for a given block length d = ( d )! Key: P L A Y F Playfair Cipher PLAYFAIR I A DIGRAM CIPHER I R D G M C H E B K N O Q T U V W X Z Convention (tallings) message ciphertext 5 P O L A N D A K A Y Q R Convention (Handbook) message ciphertext P O L A N D K A A Y R Q
11 Ciphering: Hill Cipher 99 Hill Cipher Deciphering: M [xd] = C [xd] K - [dxd] C [xd] = M [xd] K [dxd] message block = ciphertext block inverse key matrix k, k,, k d (c, c,, c d ) = (m, m,, m d ) k d, k d,, k dd ciphertext block = message block key matrix where K [dxd] K - [dxd] = key matrix inverse key matrix =,,,,,,,,,,,,,,,, identity matrix Hill Cipher - Known Plaintext Attack () Hill Cipher - Known Plaintext Attack () Known: C = (c, c,, c d ) M = (m, m,, m d ) C = (c, c,, c d ) M = (m, m,, m d ) C d = (c d, c d,, c dd ) M d = (m d, m d,, m dd ) c, c,, c d c, c,, c d c d, c d,, c dd = m, m,, m d m, m,, m d m d, m d,, m dd k, k,, k d k, k,, k d k d, k d,, k dd We know that: (c, c,, c d ) = (m, m,, m d ) K [dxd] (c, c,, c d ) = (m, m,, m d ) K [dxd] (c d, c d,, c dd ) = (m d, m d,, m dd ) K [dxd] C [dxd] = M [dxd] K [dxd] K [dxd] = M - [dxd] C [dxd] ubstitution Ciphers (5) Homophonic substitution cipher M = { A, B, C,, Z } C = {,,, 3,, 99 } c i = f(m i, random number) m i = f - (c i ) Transposition ciphers M = m m m 3 m m N C = m f() m f() m f(3) m f() m f(n) Letters of the plaintext are rearranged without changing them f: E 7, 9, 7,, A,, 5, 9 U 5,, 9 X 33
12 a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e f g h i j k l m n o p q r s t u v w x y z in a long English plaintext in the corresponding ciphertext for a transposition cipher Transposition cipher Example Plaintext: CRYPTANALYT Key: Encryption: Ciphertext: KRI 3 K R I C R Y P T A N A L Y T YNCTLRAYPAT Gilbert Vernam, AT&T Major Joseph Mauborgne One-time Pad Vernam Cipher c i = m i Å k i 9 One-time Pad Equivalent version c i = m i + k i mod m i k i c i m i k i c i TO BE OR NOT TO BE AX TC VI URD WM OF TL UG JZ HFW PK PJ All bits of the key must be chosen at random and never reused All letters of the key must be chosen at random and never reused Perfect Cipher Claude hannon Communication Theory of ecrecy ystems, 9 " m Î M c Î C P(M=m C=c) = P(M = m) The cryptanalyst can guess a message with the same probability without knowing a ciphertext as with the knowledge of the ciphertext Is substitution cipher a perfect cipher? C = XRZ P(M=ADD C=XRZ) = P(M=ADD) ¹
13 Is one-time pad a perfect cipher? -P Networks C = XRZ P(M=ADD C=XRZ) ¹ P(M=ADD) ¹ M might be equal to CAT, PET, ET, ADD, BBC, AAA, HOT, HI, HER, BET, WA, NOW, etc P P Basic operations of -P networks Avalanche effect ubstitution -box Permutation P-box m m m m3 m m5 m m7 m m9 m m m m m m3 m P P c c c c c3 c c5 c5 c c7 c7 c c c9 c c c c c c c c3 c c hannon Product Ciphers LUCIFER Horst Feistel, Walt Tuchman IBM Computationally secure ciphers based on the idea of diffusion and confusion Confusion relationship between plaintext and ciphertext is obscured, eg through the use of substitutions Diffusion spreading influence of one plaintext letter to many ciphertext letters, eg through the use of permutations m m m3 m m5 m m7 m m9 m m m m5 m m7 m k, k, k 3, k 3, P k, k, K 3, k 3, P k, K, k 3, k 3, c c c3 c c5 c c7 c c9 c c c c5 c c7 c rounds 3
14 LUCIFER- external look plaintext block bits LUCIFER key 5 bits bits ciphertext block
Historical Ciphers. Required Reading. W. Stallings, Cryptography and Network Security, Chapter 2, Classical Encryption Techniques
ECE 646 - Lecture 6 Historical Ciphers Required Reading W tallings, Cryptography and Network ecurity, Chapter, Classical Encryption Techniques A Menezes et al, Handbook of Applied Cryptography, Chapter
More informationECE 646 Lecture 5. Motivation: Mathematical Background: Modular Arithmetic. Public-key ciphers. RSA keys. RSA as a trap-door one-way function
ECE Lecture 5 Mathematical Background: Modular Arithmetic Motivation: Public-key ciphers RSA as a trap-door one-way function PUBLIC KEY message ciphertext M C = f(m) = M e mod N C RSA keys PUBLIC KEY PRIVATE
More informationECE 646 Lecture 5. Mathematical Background: Modular Arithmetic
ECE 646 Lecture 5 Mathematical Background: Modular Arithmetic Motivation: Public-key ciphers RSA as a trap-door one-way function PUBLIC KEY message ciphertext M C = f(m) = M e mod N C M = f -1 (C) = C
More informationFacts & Myths of Enigma
Facts & Myths of Enigma Breaking Stereotypes Arkadiusz Orłowski & Kris Gaj How should we begin? Begin at the beginning, and go on till you come to the end: then stop. The King to the White Rabbit Lewis
More informationmonoalphabetic cryptanalysis Character Frequencies (English) Security in Computing Common English Digrams and Trigrams Chapter 2
Common English Digrams and Trigrams Digrams EN RE ER NT TH ON IN TF AN OR Trigrams ENT ION AND ING IVE TIO FOR OUR THI ONE monoalphabetic cryptanalysis See class example Pfleeger, Security in Computing,
More informationCryptography CS 555. Topic 2: Evolution of Classical Cryptography CS555. Topic 2 1
Cryptography CS 555 Topic 2: Evolution of Classical Cryptography Topic 2 1 Lecture Outline Basics of probability Vigenere cipher. Attacks on Vigenere: Kasisky Test and Index of Coincidence Cipher machines:
More informationFinal Exam Math 105: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 30 April :30 11:00 a.m.
Final Exam Math 10: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 0 April 2002 :0 11:00 a.m. Instructions: Please be as neat as possible (use a pencil), and show
More informationCristina Nita-Rotaru. CS355: Cryptography. Lecture 4: Enigma.
CS355: Cryptography Lecture 4: Enigma. Towards cryptographic engines } How to move from pencil and paper to more automatic ways of encrypting and decrypting? } How to design more secure ciphers } Alberti
More information1999 version 2001 simplified version
香港中文大學讀書會 1999 version 2001 simplified version Author Simon Singh http://simonsingh.net/ 1. Fermat s Last Theorem the epic quest to Solve the World's Greatest Mathematical Problem(2007) 2. The Code Book(1999)
More informationAlgebra for Cryptology
Algebra for Cryptology Arkadii Slinko Department of Mathematics The University of Auckland Auckland, 6 April, 2013 What is cryptology? Cryptology is about communication in the presence of adversaries or
More informationCiphers: Making and Breaking
Ciphers: Making and Breaking Ralph Morelli Trinity College, Hartford (ralph.morelli@trincoll.edu) Smithsonian Institute October 31, 2009 2009 Ralph Morelli You are free to reuse and remix this presentation
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 3 January 22, 2013 CPSC 467b, Lecture 3 1/35 Perfect secrecy Caesar cipher Loss of perfection Classical ciphers One-time pad Affine
More information1/18 2/16 3/20 4/17 5/6 6/9 7/14 % Please do not write in the spaces above.
1/18 2/16 3/20 4/17 5/6 6/9 7/14 % Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. Please make sure that you read through this entire exam before
More informationHistorical cryptography
Historical cryptography CSCI 470: Web Science Keith Vertanen Copyright 2013 Overview Historical cryptography Monoalphabetic substitution ciphers Breaking them Some improvements The cipher of Mary Queen
More informationCryptography. The Making and Breaking of Secret Codes. 5/29/2009 John C. Polking, Rice University 1
Cryptography The Making and Breaking of Secret Codes. 5/29/2009 John C. Polking, Rice University 1 Need for Cryptography Many areas of human endeavor require secret communication. Modern methods of communication
More informationClassical Cryptography
Classical Cryptography CSG 252 Fall 2006 Riccardo Pucella Goals of Cryptography Alice wants to send message X to Bob Oscar is on the wire, listening to communications Alice and Bob share a key K Alice
More information5. Classical Cryptographic Techniques from modular arithmetic perspective
. Classical Cryptographic Techniques from modular arithmetic perspective By classical cryptography we mean methods of encipherment that have been used from antiquity through the middle of the twentieth
More informationCOS433/Math 473: Cryptography. Mark Zhandry Princeton University Spring 2017
COS433/Math 473: Cryptography Mark Zhandry Princeton University Spring 2017 Previously on COS 433 Pre- modern Cryptography 1900 B.C. mid 1900 s A.D With few exceptions, synonymous with encryption c = Enc(k,m)
More informationLecture (04) Classical Encryption Techniques (III)
Lecture (04) Classical Encryption Techniques (III) Dr. Ahmed M. ElShafee ١ Playfair Cipher one approach to improve security was to encrypt multiple letters the Playfair Cipher is an example invented by
More informationone approach to improve security was to encrypt multiple letters invented by Charles Wheatstone in 1854, but named after his
Lecture (04) Classical Encryption Techniques (III) Dr. Ahmed M. ElShafee ١ The rules for filling in this 5x5 matrix are: L to R, top to bottom, first with keyword after duplicate letters have been removed,
More informationCryptanalysis. A walk through time. Arka Rai Choudhuri
Cryptanalysis A walk through time Arka Rai Choudhuri arkarai.choudhuri@gmail.com How many can you identify? History (or how I will give you hope of becoming world famous and earning $70 million along
More informationIntroduction to Cryptography
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A Introduction to Cryptography EECE 412 1 Module Outline Historical background Classic ciphers One-time pad The Random Oracle model Random functions:
More informationClassical Cryptography
JASS 05 Seminar: Algorithms for IT Security Classical Cryptography Ilya Saverchenko June 6, 2005 Abstract Cryptography is a study of secret writing. It allows two people, usually referred to as Alice and
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-27 Recap ADFGX Cipher Block Cipher Modes of Operation Hill Cipher Inverting a Matrix (mod n) Encryption: Hill Cipher Example Multiple
More informationUniversity of Regina Department of Mathematics & Statistics Final Examination (April 21, 2009)
Make sure that this examination has 10 numbered pages University of Regina Department of Mathematics & Statistics Final Examination 200910 (April 21, 2009) Mathematics 124 The Art and Science of Secret
More informationEfficient Cryptanalysis of Homophonic Substitution Ciphers
Efficient Cryptanalysis of Homophonic Substitution Ciphers Amrapali Dhavare Richard M. Low Mark Stamp Abstract Substitution ciphers are among the earliest methods of encryption. Examples of classic substitution
More informationIntroduction to Cryptology. Lecture 2
Introduction to Cryptology Lecture 2 Announcements 2 nd vs. 1 st edition of textbook HW1 due Tuesday 2/9 Readings/quizzes (on Canvas) due Friday 2/12 Agenda Last time Historical ciphers and their cryptanalysis
More informationTHE UNIVERSITY OF CALGARY FACULTY OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS & STATISTICS MIDTERM EXAMINATION 1 FALL 2018
THE UNIVERSITY OF CALGARY FACULTY OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS & STATISTICS MIDTERM EXAMINATION 1 FALL 2018 CPSC 418/MATH 318 L01 October 17, 2018 Time: 50 minutes
More informationCryptography. monoalphabetic. Ciphers. New Cipher Types. Keyword Cipher. Further subdivisions:...
Cryptography Monoalphabetic Ciphers 1 New Cipher Types Further subdivisions:... Classical Stream Block Transposition Substitution polyalphabetic monoalphabetic Each plaintext character is mapped to several
More informationInnovation and Cryptoventures. Cryptology. Campbell R. Harvey. Duke University, NBER and Investment Strategy Advisor, Man Group, plc.
Innovation and Cryptoventures Cryptology Campbell R. Harvey Duke University, NBER and Investment Strategy Advisor, Man Group, plc January 20, 2017 Overview Cryptology Cryptography Cryptanalysis Symmetric
More informationData and information security: 2. Classical cryptography
ICS 423: s Data and information security: 2. Classical cryptography UHM ICS 423 Fall 2014 Outline ICS 423: s s and crypto systems ciphers ciphers Breaking ciphers What did we learn? Outline ICS 423: s
More informationThe Web Cryptology Game CODEBREAKERS.EU edition 2015
Lecture 5 in which we return to the dream about le chiffre indechiffrable. We will see this dream come true and next we will try, step by step, to break this unbreakable cipher. As you might remember,
More informationChapter 2 Classical Cryptosystems
Chapter 2 Classical Cryptosystems Note We will use the convention that plaintext will be lowercase and ciphertext will be in all capitals. 2.1 Shift Ciphers The idea of the Caesar cipher: To encrypt, shift
More informationCryptography Lecture 4 Block ciphers, DES, breaking DES
Cryptography Lecture 4 Block ciphers, DES, breaking DES Breaking a cipher Eavesdropper recieves n cryptograms created from n plaintexts in sequence, using the same key Redundancy exists in the messages
More informationSpecialized Cryptanalytic Machines: Two examples, 60 years apart. Patrick Schaumont ECE Department Virginia Tech
Specialized Cryptanalytic Machines: Two examples, 60 years apart Patrick Schaumont ECE Department Virginia Tech What is cryptanalysis? Cryptography aims to defeat cryptanalysis Cryptanalysis aims to defeat
More informationShift Cipher. For 0 i 25, the ith plaintext character is. E.g. k = 3
Shift Cipher For 0 i 25, the ith plaintext character is shifted by some value 0 k 25 (mod 26). E.g. k = 3 a b c d e f g h i j k l m n o p q r s t u v w x y z D E F G H I J K L M N O P Q R S T U V W X Y
More informationClassical. More Ciphers. By Richard Spillman. Based on slides from the book Classical & Contemporary Cryptology By. & ontempory ryptology
More Ciphers Based on slides from the book Classical Contemporary C By By Richard Spillman 1 A Good Cipher Enciphering and deciphering should be efficient for all keys - it should not take forever to get
More informationAN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY
! """#$# AN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY *Kallam Ravindra Babu 1, Dr. S. Udaya Kumar 2, Dr. A. Vinaya Babu 3 and Dr. M. Thirupathi Reddy 4 1 Research Scholar (JNTUH),
More informationCHAPTER 5 A BLOCK CIPHER INVOLVING A KEY APPLIED ON BOTH THE SIDES OF THE PLAINTEXT
82 CHAPTER 5 A BLOCK CIPHER INVOLVING A KEY APPLIED ON BOTH THE SIDES OF THE PLAINTEXT 83 5.1 Introduction In a pioneering paper, Hill [5] developed a block cipher by using the modular arithmetic inverse
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-22 Recap Two methods for attacking the Vigenère cipher Frequency analysis Dot Product Playfair Cipher Classical Cryptosystems - Section
More informationNumber Theory in Cryptography
Number Theory in Cryptography Introduction September 20, 2006 Universidad de los Andes 1 Guessing Numbers 2 Guessing Numbers (person x) (last 6 digits of phone number of x) 3 Guessing Numbers (person x)
More informationComputer Security. 07. Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 07. Cryptography Paul Krzyzanowski Rutgers University Spring 2018 March 20, 2018 CS 419 2018 Paul Krzyzanowski 1 cryptography κρυπός γραφία hidden writing A secret manner of writing,
More informationCODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES. The questions with a * are extension questions, and will not be included in the assignment.
CODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES A selection of the following questions will be chosen by the lecturer to form the Cryptology Assignment. The Cryptology Assignment is due by 5pm Sunday 1
More informationCSCI3381-Cryptography
CSCI3381-Cryptography Lecture 2: Classical Cryptosystems September 3, 2014 This describes some cryptographic systems in use before the advent of computers. All of these methods are quite insecure, from
More informationHistorical cryptography
Historical cryptography Alice Bob Eve CSCI 470: Web Science Keith Vertanen Overview Historical cryptography Monoalphabetic substitution ciphers Breaking them Some improvements The cipher of Mary Queen
More informationReal scripts backgrounder 3 - Polyalphabetic encipherment - XOR as a cipher - RSA algorithm. David Morgan
Real scripts backgrounder 3 - Polyalphabetic encipherment - XOR as a cipher - RSA algorithm David Morgan XOR as a cipher Bit element encipherment elements are 0 and 1 use modulo-2 arithmetic Example: 1
More informationJay Daigle Occidental College Math 401: Cryptology
3 Block Ciphers Every encryption method we ve studied so far has been a substitution cipher: that is, each letter is replaced by exactly one other letter. In fact, we ve studied stream ciphers, which produce
More informationCPE 776:DATA SECURITY & CRYPTOGRAPHY. Some Number Theory and Classical Crypto Systems
CPE 776:DATA SECURITY & CRYPTOGRAPHY Some Number Theory and Classical Crypto Systems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Some Number Theory
More informationDr Richard Clayton. 8 October 2009
Introducing Cryptanalysis Dr Richard Clayton richard.clayton@cl.cam.ac.ukclayton@cl cam ac Hills Road Sixth Form College 8 October 2009 It s all Greek to me! ΡΙΧΑΡ Secret communication Steganography: hiding
More informationClock Arithmetic and Euclid s Algorithm
Clock Arithmetic and Euclid s Algorithm Lecture notes for Access 2008 by Erin Chamberlain. Earlier we discussed Caesar Shifts and other substitution ciphers, and we saw how easy it was to break these ciphers
More information1/16 2/17 3/17 4/7 5/10 6/14 7/19 % Please do not write in the spaces above.
1/16 2/17 3/17 4/7 5/10 6/14 7/19 % Please do not write in the spaces above. Directions: You have 75 minutes in which to complete this exam. Please make sure that you read through this entire exam before
More informationCryptography. Lecture 2: Perfect Secrecy and its Limitations. Gil Segev
Cryptography Lecture 2: Perfect Secrecy and its Limitations Gil Segev Last Week Symmetric-key encryption (KeyGen, Enc, Dec) Historical ciphers that are completely broken The basic principles of modern
More informationCryptography: A Fairy Tale for Mathematicians and Starring Mathematicians!
Cryptography: A Fairy Tale for Mathematicians and Starring Mathematicians! University of California, Berkeley Mathematics Undergraduate Student Association October 27, 2014 Why Crypto? So why on earth
More informationSol: First, calculate the number of integers which are relative prime with = (1 1 7 ) (1 1 3 ) = = 2268
ò{çd@àt ø 2005.0.3. Suppose the plaintext alphabets include a z, A Z, 0 9, and the space character, therefore, we work on 63 instead of 26 for an affine cipher. How many keys are possible? What if we add
More informationCryptography. P. Danziger. Transmit...Bob...
10.4 Cryptography P. Danziger 1 Cipher Schemes A cryptographic scheme is an example of a code. The special requirement is that the encoded message be difficult to retrieve without some special piece of
More informationSound approaches to cryptography
CHAPTER 4: CLASSICAL (SECRET-KEY) CRYPTOSYSTEMS Part IV Secret-key cryptosystems In this chapter we deal with some of the very old, or quite old, classical (secret-key or symmetric) cryptosystems that
More informationPolyalphabetic Ciphers
Polyalphabetic Ciphers 1 Basic Idea: The substitution alphabet used for enciphering successive letters of plaintext changes. The selection of alphabets may depend on a keyword, a key stream, or electromechanical
More informationPolyalphabetic Substitutions
Polyalphabetic Substitutions Klaus Pommerening Fachbereich Physik, Mathematik, Informatik der Johannes-Gutenberg-Universität Saarstraße 21 D-55099 Mainz October 25, 1999 English version October 13, 2013
More informationCHAPTER 12 CRYPTOGRAPHY OF A GRAY LEVEL IMAGE USING A MODIFIED HILL CIPHER
177 CHAPTER 12 CRYPTOGRAPHY OF A GRAY LEVEL IMAGE USING A MODIFIED HILL CIPHER 178 12.1 Introduction The study of cryptography of gray level images [110, 112, 118] by using block ciphers has gained considerable
More informationWritten examination. Tuesday, August 18, 2015, 08:30 a.m.
Advanced Methods of Cryptography Univ.-Prof. Dr. rer. nat. Rudolf Mathar 1 2 3 4 19 20 11 20 70 Written examination Tuesday, August 18, 2015, 08:30 a.m. Name: Matr.-No.: Field of study: Please pay attention
More informationModified Hill Cipher for a Large Block of Plaintext with Interlacing and Iteration
Journal of Computer Science 4 (1): 15-20, 2008 ISSN 1549-3636 2008 Science Publications Modified Hill Cipher for a Large Block of Plaintext with Interlacing and Iteration V.U.K. Sastry and N. Ravi Shankar
More information2.4 The Autokey cipher and cribs
2.4 The Autokey cipher and cribs 2.4.1 Using a crib One common tool in cryptanalysis is a crib, which is a known or guessed bit of plaintext corresponding to a ciphertext. (The term comes from the phrase
More information... Assignment 3 - Cryptography. Information & Communication Security (WS 2018/19) Abtin Shahkarami, M.Sc.
Assignment 3 - Cryptography Information & Communication Security (WS 2018/19) Abtin Shahkarami, M.Sc. Deutsche Telekom Chair of Mobile Business & Multilateral Security Goethe-University Frankfurt a. M.
More informationSimple Codes MTH 440
Simple Codes MTH 440 Not all codes are for the purpose of secrecy Morse Code ASCII Zip codes Area codes Library book codes Credit Cards ASCII Code Steganography: Hidden in plain sight (example from http://www.bbc.co.uk/news/10
More informationAn Introduction to Cryptography
An Introduction to Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics Spring 2008 What is Cryptography? cryptography: study of methods for sending messages in a form that only
More informationIntroduction to Cryptographic Engineering. Steven M. Bellovin
Introduction to Cryptographic Engineering Steven M. Bellovin https://www.cs.columbia.edu/~smb 1 Cryptographic Engineering? There are lots of introductions to encryption But using encryption in the real
More information2.1 Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.
CHAPTER 2 CLASSICAL ENCRYPTION TECHNIQUES ANSWERS TO QUESTIONS 2.1 Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm. 2.2 Permutation and substitution. 2.3 One key for symmetric
More informationChapter 2 : Perfectly-Secret Encryption
COMP547 Claude Crépeau INTRODUCTION TO MODERN CRYPTOGRAPHY _ Second Edition _ Jonathan Katz Yehuda Lindell Chapter 2 : Perfectly-Secret Encryption 1 2.1 Definitions and Basic Properties We refer to probability
More informationA Low Data Complexity Attack on the GMR-2 Cipher Used in the Satellite Phones
A Low Data Complexity Attack on the GMR-2 Cipher Used in the atellite Phones Ruilin Li, Heng Li, Chao Li, Bing un National University of Defense Technology, Changsha, China FE 2013, ingapore 11 th ~13
More informationCryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering. Apr Cryptography Slide 1
Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering Apr. 2007 Cryptography Slide 1 About This Presentation This presentation belongs to the lecture series
More information19 Lorenz Cipher Machine
9 Lorenz Cipher Machine During the Second World War, the codebreakers at Bletchley Park devised a variety of techniques that enabled the Allies to break the major codes used by the Germans. Not only was
More informationHistorical cryptography. cryptography encryption main applications: military and diplomacy
Historical cryptography cryptography encryption main applications: military and diplomacy ancient times world war II Historical cryptography All historical cryptosystems badly broken! No clear understanding
More informationI.T.I.S. E. DIVINI SAN SEVERINO MARCHE. CRIPTOGRAPHY Monday 9th January 2006
I.T.I.S. E. DIVINI SAN SEVERINO MARCHE CRIPTOGRAPHY Monday 9th January 2006 History of cryptography The history of cryptography dates back thousands of years. Until recent decades, it has been a history
More informationThe Hill Cipher A Linear Algebra Perspective
The Hill Cipher A Linear Algebra Perspective Contents 1 Introduction to Classical Cryptography 3 1.1 Alice, Bob & Eve................................. 3 1.2 Types of Attacks.................................
More informationIntroduction. CSC/ECE 574 Computer and Network Security. Outline. Introductory Remarks Feistel Cipher DES AES
CSC/ECE 574 Computer and Network Security Topic 3.1 Secret Key Cryptography Algorithms CSC/ECE 574 Dr. Peng Ning 1 Outline Introductory Remarks Feistel Cipher DES AES CSC/ECE 574 Dr. Peng Ning 2 Introduction
More informationA Block Cipher using an Iterative Method involving a Permutation
Journal of Discrete Mathematical Sciences & Cryptography Vol. 18 (015), No. 3, pp. 75 9 DOI : 10.1080/097059.014.96853 A Block Cipher using an Iterative Method involving a Permutation Lakshmi Bhavani Madhuri
More informationCOMM1003. Information Theory. Dr. Wassim Alexan Spring Lecture 5
COMM1003 Information Theory Dr. Wassim Alexan Spring 2018 Lecture 5 The Baconian Cipher A mono alphabetic cipher invented by Sir Francis Bacon In this cipher, each letter is replaced by a sequence of five
More informationCryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 08 Shannon s Theory (Contd.)
More informationLecture 8 - Cryptography and Information Theory
Lecture 8 - Cryptography and Information Theory Jan Bouda FI MU April 22, 2010 Jan Bouda (FI MU) Lecture 8 - Cryptography and Information Theory April 22, 2010 1 / 25 Part I Cryptosystem Jan Bouda (FI
More informationThe Two Time Pad Encryption System
Hardware Random Number Generators This document describe the use and function of a one-time-pad style encryption system for field and educational use. You may download sheets free from www.randomserver.dyndns.org/client/random.php
More informationHidden Markov Models for Vigenère Cryptanalysis
Hidden Markov Models for Vigenère Cryptanalysis Mark Stamp Fabio Di Troia Department of Computer Science San Jose State University San Jose, California mark.stamp@sjsu.edu fabioditroia@msn.com Miles Stamp
More information6.080/6.089 GITCS April 8, Lecture 15
6.080/6.089 GITCS April 8, 2008 Lecturer: Scott Aaronson Lecture 15 Scribe: Tiffany Wang 1 Administrivia Midterms have been graded and the class average was 67. Grades will be normalized so that the average
More informationCryptography 2017 Lecture 2
Cryptography 2017 Lecture 2 One Time Pad - Perfect Secrecy Stream Ciphers November 3, 2017 1 / 39 What have seen? What are we discussing today? Lecture 1 Course Intro Historical Ciphers Lecture 2 One Time
More informationDan Boneh. Introduction. Course Overview
Online Cryptography Course Introduction Course Overview Welcome Course objectives: Learn how crypto primitives work Learn how to use them correctly and reason about security My recommendations: Take notes
More informationModified Hill Cipher with Interlacing and Iteration
Journal of Computer Science 3 (11): 854-859, 2007 ISSN 1549-3636 2007 Science Publications Modified Hill Cipher with Interlacing and Iteration 1 V.U.K. Sastry and 2 N. Ravi Shankar 1 Department of R and
More informationCryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering. Apr Cryptography Slide 1
Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering Apr. 2016 Cryptography Slide 1 About This Presentation This presentation belongs to the lecture series
More informationMONOALPHABETIC CIPHERS AND THEIR MATHEMATICS. CIS 400/628 Spring 2005 Introduction to Cryptography
MONOALPHABETIC CIPHERS AND THEIR MATHEMATICS CIS 400/628 Spring 2005 Introduction to Cryptography This is based on Chapter 1 of Lewand and Chapter 1 of Garrett. MONOALPHABETIC SUBSTITUTION CIPHERS These
More informationWhat is Cryptography? by Amit Konar, Dept. of Math and CS, UMSL
What is Cryptography? by Amit Konar, Dept. of Math and CS, UMSL Definition: Cryptosystem Cryptography means secret writing and it is the art of concealing meaning. A Cryptosystem is a 5-tuple(E, D,M,K,C),
More informationIntroduction to Information Security
Introuction to Inforation Security Lecture : Classical Ciphers 007. 6. Prof. Byoungcheon Lee sultan (at) joongbu. ac. kr Inforation an Counications University Contents 1. History of cryptographic research.
More informationComputer Security. 07. Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2017
Computer Security 07. Cryptography Paul Krzyzanowski Rutgers University Spring 2017 March 26, 2017 CS 419 2017 Paul Krzyzanowski 1 cryptography κρυπός γραφία hidden writing A secret manner of writing,
More informationMathematics: Modeling Our World Unit 2: SECRET CODES SUPPLEMENTAL ACTIVITY THE GOLD BUG S2.1
Mathematics: Modeling Our World Unit 2: SECRET CODES SUPPLEMENTAL ACTIVITY THE GOLD BUG S2.1 In The Gold Bug by Edgar Allan Poe, the character William Legrand stumbles across what appears to be a coded
More informationCS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrosky. Lecture 4
CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrosky Lecture 4 Lecture date: January 26, 2005 Scribe: Paul Ray, Mike Welch, Fernando Pereira 1 Private Key Encryption Consider a game between
More informationShannon s Theory of Secrecy Systems
Shannon s Theory of Secrecy Systems See: C. E. Shannon, Communication Theory of Secrecy Systems, Bell Systems Technical Journal, Vol. 28, pp. 656 715, 1948. c Eli Biham - March 1, 2011 59 Shannon s Theory
More informationThe Evolution of Cryptology
California State University, San Bernardino CSUSB ScholarWorks Electronic Theses, Projects, and Dissertations Office of Graduate Studies 6-2016 The Evolution of Cryptology Gwendolyn Rae Souza California
More informationSecurity of Networks (12) Exercises
(12) Exercises 1.1 Below are given four examples of ciphertext, one obtained from a Substitution Cipher, one from a Vigenere Cipher, one from an Affine Cipher, and one unspecified. In each case, the task
More informationCSA E0 235: Cryptography March 16, (Extra) Lecture 3
CSA E0 235: Cryptography March 16, 2015 Instructor: Arpita Patra (Extra) Lecture 3 Submitted by: Ajith S 1 Chosen Plaintext Attack A chosen-plaintext attack (CPA) is an attack model for cryptanalysis which
More informationOutline. Computer Science 418. Number of Keys in the Sum. More on Perfect Secrecy, One-Time Pad, Entropy. Mike Jacobson. Week 3
Outline Computer Science 48 More on Perfect Secrecy, One-Time Pad, Mike Jacobson Department of Computer Science University of Calgary Week 3 2 3 Mike Jacobson (University of Calgary) Computer Science 48
More informationSecret Key Systems (block encoding) Encrypting a small block of text (say 64 bits) General considerations for cipher design:
Secret Key Systems (block encoding) Encrypting a small block of text (say 64 bits) General considerations for cipher design: Secret Key Systems Encrypting a small block of text (say 64 bits) General considerations
More informationNOI 2009 Solutions to Contest Tasks
NOI 2009 Solutions to Contest Tasks Martin Henz March 14, 2009 Martin Henz NOI 2009 Solutions to Contest Tasks 1 The Scientific Committee of NOI 2009 Ben Leong Chang Ee-Chien Colin Tan Frank Stephan Martin
More informationCristina Nita-Rotaru. CS355: Cryptography. Lecture 9: Encryption modes. AES
CS355: Cryptography Lecture 9: Encryption modes. AES Encryption modes: ECB } Message is broken into independent blocks of block_size bits; } Electronic Code Book (ECB): each block encrypted separately.
More information