Polyalphabetic Ciphers

Size: px
Start display at page:

Download "Polyalphabetic Ciphers"

Transcription

1 Polyalphabetic Ciphers 1

2 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 means (e.g., Enigma). 2

3 Vigenère Keyword Cipher Setup: Correspondents agree on a keyword Encryption: Write keyword repeatedly alongside the plaintext, adding corresponding plaintext and key letters modulo 26 by finding the letter where the plain letter column and the key letter row intersect in the Vigenère square. 3

4 Decryption: Write keyword repeatedly alongside the ciphertext, subtracting corresponding key letters modulo 26 by finding the cipher letter in the key row and looking up the plaintext letter at the head of the column in which the cipher letter appears. 4

5 Example: If keyword is WIND and plaintext is GO AHEAD MAKE MY DAY, then encipherment is plain key cipher G O A H E A D M A K E M Y D A Y W I N D W I N D W I N D W I N D 5

6 Example: If keyword is WIND and plaintext is GO AHEAD MAKE MY DAY, then encipherment is plain key cipher G O A H E A D M A K E M Y D A Y W I N D W I N D W I N D W I N D C 6

7 Example: If keyword is WIND and plaintext is GO AHEAD MAKE MY DAY, then encipherment is plain key cipher G O A H E A D M A K E M Y D A Y W I N D W I N D W I N D W I N D C W 7

8 Example: If keyword is WIND and plaintext is GO AHEAD MAKE MY DAY, then encipherment is plain key cipher G O A H E A D M A K E M Y D A Y W I N D W I N D W I N D W I N D C W N 8

9 Example: If keyword is WIND and plaintext is GO AHEAD MAKE MY DAY, then encipherment is plain key cipher G O A H E A D M A K E M Y D A Y W I N D W I N D W I N D W I N D C W N K A I Q P W S R P U L N B 9

10 Example: Suppose the keyword is NUMBER. The punch line of the joke, There are three kinds of mathematicians... isthe decipherment of GBATI NUIOB RTBOZ UEEQN TPWVJ BADEE G. Weget cipher key plain G B A T I N U I O B R T B O Z U E E Q N T P W V J B A D E E G N U M B E R N U M B E R N U M B E R N U M B E R N U M B E R N 10

11 Example: Suppose the keyword is NUMBER. The punch line of the joke, There are three kinds of mathematicians... isthe decipherment of GBATI NUIOB RTBOZ UEEQN TPWVJ BADEE G. Weget cipher key plain G B A T I N U I O B R T B O Z U E E Q N T P W V J B A D E E G N U M B E R N U M B E R N U M B E R N U M B E R N U M B E R N T H O S E W H O C A N C O U N T A N D T H O S E W H O C A N T 11

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 AA AB AC AD AE AF AG N U M B E R N U M B E R N U M B E R N U M B E R N U M B E R N T H O S E W H O C A N C O U N T A N D T H O S E W H O C A N T G B A T I N U I O B R T B O Z U E E Q N T P W V J B A D E E G =CHAR(MOD(CODE(A2)-CODE("A") + CODE(A1)-CODE("A"),26)+CODE("A")) =A9 G B A T I N U I O B R T B O Z U E E Q N T P W V J B A D E E G N U M B E R N U M B E R N U M B E R N U M B E R N U M B E R N T H O S E W H O C A N C O U N T A N D T H O S E W H O C A N T =CHAR(MOD(CODE(A8)-CODE("A") - (CODE(A9)-CODE("A")),26)+CODE("A")) Vigenere encipherment and decipherment using an Excel spreadsheet 12

13 Property: Vigenère encipherments with longer keywords tend to even out the distribution of letters in the ciphertexts. Thus the statistics in the underlying plaintext are obscured. A 1565-letter plaintext was enciphered using the keywords A, IF, VOW, ZEAL, MARKS,COUPLE,CORNELL,CONSIDER. Here are the letter distributions. 13

14 ABCDEFGHIJKLMNOPQRSTUVWXYZ CORNELL ABCDEFGHIJKLMNOPQRSTUVWXYZ CONSIDER ABCDEFGHIJKLMNOPQRSTUVWXYZ MARKS ABCDEFGHIJKLMNOPQRSTUVWXYZ COUPLE ABCDEFGHIJKLMNOPQRSTUVWXYZ VOW ABCDEFGHIJKLMNOPQRSTUVWXYZ ZEAL ABCDEFGHIJKLMNOPQRSTUVWXYZ A ABCDEFGHIJKLMNOPQRSTUVWXYZ IF 14

15 Cryptanalysis of Vigenere-enciphered Text Ciphertext: CTMYR DOIBS RESRR RIJYR EBYLD IYMLC CYQXS RRMLQ FSDXF OWFKT CYJRR IQZSM X Assumption: keyword is a 3-letter English word. 15

16 Basic idea: three monoalphabetic shifts are used to get C Y O S..., _ T R I R _..., M D B E... Determine the likely shift values and try out the corresponding possible keywords. 16

17 Work: set 1 set 2 set 3 let. freq. let. freq. let. freq. C 2 T 2 M 2 Y 3 R 4 D 1 O 2 I 4 B 1 S 2 Y 2 E 2 R 3 L 1 R 3 B 1 S 2 J 1 D 2 M 1 L 2 M 1 F 1 Y 1 X 2 X 1 C 2 Q 1 W 1 Q 2 K 1 J 1 S 1 Z 1 F 2 17

18 If E Y, shift 24 4=20; key letter U. If T Y, shift = 5; key letter F. If N Y, shift = 11; key letter L.. 18

19 likely likely likely first second third letter letter letter U N N F Y Y L E E K D D H A A Q J J Y R R G Z Z Likely keywords: HER, GAY,... FAD, FAN, FAR, FED, FEN, LEE, LEA, KEN, KEY, Knowledge that the key word is a real 3-letter English word vastly reduces the amount of work from trying out all 3-letter strings or all 2-, 3-, 4-letter,... strings. 19

20 key cipher plain FEDFEDFED... CTMYRDOIB... XPJTN... key KEYKEYKEYKEY... cipher CTMYRDOIBSRE... plain SPOONFEEDING... 20

21 key cipher plain FEDFEDFED... CTMYRDOIB... XPJTN... key KEYKEYKEYKEY... cipher CTMYRDOIBSRE... plain SPOONFEEDING... SPOONFEEDING IN THE LONG RUN TEACHES US NOTHING BUT THE SHAPE OF THE SPOON 21

22 Brute-force Cryptanalysis of a Vigenere Cipher The following two slides show how a spreadsheet can be used to help with cryptanalysis of a Vigenere cipher where the length of the keyword is known to be 2. 22

23 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 AA AB AC AD AE AF AG The ciphertext X B M E E H D L M P D L J E Y K W A E R R Q I K E Q X F D D was produced by a Vigenere cipher using a two-letter keyword. To cryptanalyze by brute force, try out decipherments with two-letter keywords as shown here. Readable plaintext will correspond to the correct keyword. With the cell formulas as indicated, fill down from cells A9-B9 through A33-B33, and fill across and down from cells D8-E8 through AF33-AG33. Successively entering A, B, C,... in cell A8 will yield all the 676 decipherments = A8 =CHAR(MOD(CODE(B8)-65+1,26)+65) =CHAR(MOD(CODE(D$7)-65 -( CODE($A8)-65),26)+65) =CHAR(MOD(CODE(E$7)-65 - (CODE($B8)-65),26)+65) X B M E E H D L M P D L J E Y K W A E R R Q I K E Q X F D D A A X B M E E H D L M P D L J E Y K W A E R R Q I K E Q X F D D A B X A M D E G D K M O D K J D Y J W Z E Q R P I J E P X E D C A C X Z M C E F D J M N D J J C Y I W Y E P R O I I E O X D D B A D X Y M B E E D I M M D I J B Y H W X E O R N I H E N X C D A A E X X M A E D D H M L D H J A Y G W W E N R M I G E M X B D Z A F X W M Z E C D G M K D G J Z Y F W V E M R L I F E L X A D Y A G X V M Y E B D F M J D F J Y Y E W U E L R K I E E K X Z D X A H X U M X E A D E M I D E J X Y D W T E K R J I D E J X Y D W A I X T M W E Z D D M H D D J W Y C W S E J R I I C E I X X D V A J X S M V E Y D C M G D C J V Y B W R E I R H I B E H X W D U A K X R M U E X D B M F D B J U Y A W Q E H R G I A E G X V D T A L X Q M T E W D A M E D A J T Y Z W P E G R F I Z E F X U D S A M X P M S E V D Z M D D Z J S Y Y W O E F R E I Y E E X T D R A N X O M R E U D Y M C D Y J R Y X W N E E R D I X E D X S D Q A O X N M Q E T D X M B D X J Q Y W W M E D R C I W E C X R D P A P X M M P E S D W M A D W J P Y V W L E C R B I V E B X Q D O A Q X L M O E R D V M Z D V J O Y U W K E B R A I U E A X P D N A R X K M N E Q D U M Y D U J N Y T W J E A R Z I T E Z X O D M A S X J M M E P D T M X D T J M Y S W I E Z R Y I S E Y X N D L A T X I M L E O D S M W D S J L Y R W H E Y R X I R E X X M D K A U X H M K E N D R M V D R J K Y Q W G E X R W I Q E W X L D J A V X G M J E M D Q M U D Q J J Y P W F E W R V I P E V X K D I A W X F M I E L D P M T D P J I Y O W E E V R U I O E U X J D H A X X E M H E K D O M S D O J H Y N W D E U R T I N E T X I D G A Y X D M G E J D N M R D N J G Y M W C E T R S I M E S X H D F A Z X C M F E I D M M Q D M J F Y L W B E S R R I L E R X G D E 23

24 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 AA AB AC AD AE AF AG The ciphertext X B M E E H D L M P D L J E Y K W A E R R Q I K E Q X F D D was produced by a Vigenere cipher using a two-letter keyword. To cryptanalyze by brute force, try out decipherments with two-letter keywords as shown here. Readable plaintext will correspond to the correct keyword. With the cell formulas as indicated, fill down from cells A9-B9 through A33-B33, and fill across and down from cells D8-E8 through AF33-AG33. Successively entering A, B, C,... in cell A8 will yield all the 676 decipherments = A8 =CHAR(MOD(CODE(B8)-65+1,26)+65) =CHAR(MOD(CODE(D$7)-65 -( CODE($A8)-65),26)+65) =CHAR(MOD(CODE(E$7)-65 - (CODE($B8)-65),26)+65) X B M E E H D L M P D L J E Y K W A E R R Q I K E Q X F D D Q A H B W E O H N L W P N L T E I K G A O R B Q S K O Q H F N D Q B H A W D O G N K W O N K T D I J G Z O Q B P S J O P H E N C Q C H Z W C O F N J W N N J T C I I G Y O P B O S I O O H D N B Q D H Y W B O E N I W M N I T B I H G X O O B N S H O N H C N A Q E H X W A O D N H W L N H T A I G G W O N B M S G O M H B N Z Q F H W W Z O C N G W K N G T Z I F G V O M B L S F O L H A N Y Q G H V W Y O B N F W J N F T Y I E G U O L B K S E O K H Z N X Q H H U W X O A N E W I N E T X I D G T O K B J S D O J H Y N W Q I H T W W O Z N D W H N D T W I C G S O J B I S C O I H X N V Q J H S W V O Y N C W G N C T V I B G R O I B H S B O H H W N U Q K H R W U O X N B W F N B T U I A G Q O H B G S A O G H V N T Q L H Q W T O W N A W E N A T T I Z G P O G B F S Z O F H U N S Q M H P W S O V N Z W D N Z T S I Y G O O F B E S Y O E H T N R Q N H O W R O U N Y W C N Y T R I X G N O E B D S X O D H S N Q Q O H N W Q O T N X W B N X T Q I W G M O D B C S W O C H R N P Q P H M W P O S N W W A N W T P I V G L O C B B S V O B H Q N O Q Q H L W O O R N V W Z N V T O I U G K O B B A S U O A H P N N Q R H K W N O Q N U W Y N U T N I T G J O A B Z S T O Z H O N M Q S H J W M O P N T W X N T T M I S G I O Z B Y S S O Y H N N L Q T H I W L O O N S W W N S T L I R G H O Y B X S R O X H M N K Q U H H W K O N N R W V N R T K I Q G G O X B W S Q O W H L N J Q V H G W J O M N Q W U N Q T J I P G F O W B V S P O V H K N I Q W H F W I O L N P W T N P T I I O G E O V B U S O O U H J N H Q X H E W H O K N O W S N O T H I N G D O U B T S N O T H I N G Q Y H D W G O J N N W R N N T G I M G C O T B S S M O S H H N F Q Z H C W F O I N M W Q N M T F I L G B O S B R S L O R H G N E 24

25 Running-key Cipher Instead of repeating a single keyword, use a text 25

26 Illustration of a Perfectly Secure Cipher Assumptions: keyword consisting of 24 random letters messages are 24 characters long Intercepted ciphertext: XPQACOPJMFTSSKYEMCUNHDOR 26

27 The key word can be any of the keywords AAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAB. ZZZZZZZZZZZZZZZZZZZZZZZY ZZZZZZZZZZZZZZZZZZZZZZZZ 27

28 E.g., keyword BLQHVKYCIOPLERYRJHQWJAXT gives plaintext WEATHERHEREHOTANDVERYDRY Keyword IBFSJGNJBLGBOSFCYPFUJKZ gives plaintext POLITICALUNRESTCONTINUES 28

29 Another keyword gives plaintext POLITICALUNRESTNOWWANING As Eve tries out keywords, she will produce every sensible English sentence containing 24 letters, along with every sensible 24-letter sentence in any language that uses the Roman alphabet! She will also produce all the nonsense strings of 24 characters as well. No knowledge about keyword implies no knowledge about plaintext. Eve might as well guess. 29

30 Perfect Security Principle If correspondents have agreed on random keys of some length and if messages do not exceed this length, then intercepted ciphertext is unbreakable provided a new key is used with each message. 30

Final 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 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 information

CSCI3381-Cryptography

CSCI3381-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 information

Sol: First, calculate the number of integers which are relative prime with = (1 1 7 ) (1 1 3 ) = = 2268

Sol: 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 information

Cryptography CS 555. Topic 2: Evolution of Classical Cryptography CS555. Topic 2 1

Cryptography 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 information

Data and information security: 2. Classical cryptography

Data 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 information

Classical Cryptography

Classical 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 information

CODING 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. 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 information

CPSC 467b: Cryptography and Computer Security

CPSC 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 information

University of Regina Department of Mathematics & Statistics Final Examination (April 21, 2009)

University 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 information

Real 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 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 information

Security of Networks (12) Exercises

Security 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 information

Introduction to Cryptology. Lecture 2

Introduction 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 information

Lecture (04) Classical Encryption Techniques (III)

Lecture (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 information

one approach to improve security was to encrypt multiple letters invented by Charles Wheatstone in 1854, but named after his

one 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 information

Shift 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. 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 information

Innovation 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. 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 information

Math 1350 (FALL 2008) Prelim 1 (10/6/2008) 1. Solution. For the Atbash cipher for the Roman alphabet we have

Math 1350 (FALL 2008) Prelim 1 (10/6/2008) 1. Solution. For the Atbash cipher for the Roman alphabet we have Math 1350 (FALL 2008) Prelim 1 (10/6/2008) 1 1. (8 pts) Decrypt the following message, which was enciphered using the Atbash cipher. GSVYZ WMVDH RHGRN VUORV HGSVT LLWMV DHRHB LFIVG SVKRO LG Solution. For

More information

Chapter 2 Classical Cryptosystems

Chapter 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 information

Public Key Cryptography

Public Key Cryptography Public Key Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics 2011 What is Cryptography? cryptography: study of methods for sending messages in a form that only be understood

More information

Cryptography 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 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 information

Outline. CPSC 418/MATH 318 Introduction to Cryptography. Information Theory. Partial Information. Perfect Secrecy, One-Time Pad

Outline. CPSC 418/MATH 318 Introduction to Cryptography. Information Theory. Partial Information. Perfect Secrecy, One-Time Pad Outline CPSC 418/MATH 318 Introduction to Cryptography, One-Time Pad Renate Scheidler Department of Mathematics & Statistics Department of Computer Science University of Calgary Based in part on slides

More information

The Vigenère cipher is a stronger version of the Caesar cipher The encryption key is a word/sentence/random text ( and )

The Vigenère cipher is a stronger version of the Caesar cipher The encryption key is a word/sentence/random text ( and ) A Better Cipher The Vigenère cipher is a stronger version of the Caesar cipher The encryption key is a word/sentence/random text ( and ) To the first letter, add 1 To the second letter, add 14 To the third

More information

What is Cryptography? by Amit Konar, Dept. of Math and CS, UMSL

What 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 information

monoalphabetic cryptanalysis Character Frequencies (English) Security in Computing Common English Digrams and Trigrams Chapter 2

monoalphabetic 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 information

5. Classical Cryptographic Techniques from modular arithmetic perspective

5. 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 information

Cryptography. Lecture 2: Perfect Secrecy and its Limitations. Gil Segev

Cryptography. 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 information

THE 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 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 information

Introduction to Cryptography

Introduction 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 information

Using Matrices for Cryptography

Using Matrices for Cryptography Using Matrices for Cryptography In the newspaper, usually on the comics page, there will be a puzzle that looks similar to this: BRJDJ WT X BWUJ AHD PJYXDBODJ JQJV ZRJV GRJDJ T VH EJDBXWV YSXEJ BH FH 1

More information

1/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. 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 information

Jay Daigle Occidental College Math 401: Cryptology

Jay 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 information

The Web Cryptology Game CODEBREAKERS.EU edition 2015

The 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 information

A Quick Look at some Mathematics and Cryptography A Talk for CLIR at UConn

A Quick Look at some Mathematics and Cryptography A Talk for CLIR at UConn A Quick Look at some Mathematics and Cryptography A Talk for CLIR at UConn Jeremy Teitelbaum September 5, 2014 Secret Key Ciphers A cipher is a method of communication in which the letters making up the

More information

An Introduction to Cryptography

An 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 information

COS433/Math 473: Cryptography. Mark Zhandry Princeton University Spring 2017

COS433/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 information

A block cipher enciphers each block with the same key.

A block cipher enciphers each block with the same key. Ciphers are classified as block or stream ciphers. All ciphers split long messages into blocks and encipher each block separately. Block sizes range from one bit to thousands of bits per block. A block

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. 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 information

Ciphers: Making and Breaking

Ciphers: 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 information

Outline. Computer Science 418. Number of Keys in the Sum. More on Perfect Secrecy, One-Time Pad, Entropy. Mike Jacobson. Week 3

Outline. 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 information

MONOALPHABETIC 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 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 information

Cook-Levin Theorem. SAT is NP-complete

Cook-Levin Theorem. SAT is NP-complete Cook-Levin Theorem SAT is NP-complete In other words SAT NP A NP A P SAT 1 Consider any A NP NTM N that decides A in polytime n k For any input w Σ * valid tableau of configurations 2 Properties of an

More information

2.4 The Autokey cipher and cribs

2.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

Lecture Notes. Advanced Discrete Structures COT S

Lecture 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 information

The Hill Cipher A Linear Algebra Perspective

The 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 information

About Vigenere cipher modifications

About Vigenere cipher modifications Proceedings of the Workshop on Foundations of Informatics FOI-2015, August 24-29, 2015, Chisinau, Republic of Moldova About Vigenere cipher modifications Eugene Kuznetsov Abstract TheaimofthisworkisamodificationoftheclassicalVigenere

More information

CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrosky. Lecture 4

CS 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 information

CLASSICAL ENCRYPTION. Mihir Bellare UCSD 1

CLASSICAL ENCRYPTION. Mihir Bellare UCSD 1 CLASSICAL ENCRYPTION Mihir Bellare UCSD 1 Syntax A symmetric encryption scheme SE = (K, E, D) consists of three algorithms: (Adversary) Mihir Bellare UCSD 2 Correct decryption requirement For all K, M

More information

1/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. 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 information

2.1 Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.

2.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 information

PERFECT SECRECY AND ADVERSARIAL INDISTINGUISHABILITY

PERFECT SECRECY AND ADVERSARIAL INDISTINGUISHABILITY PERFECT SECRECY AND ADVERSARIAL INDISTINGUISHABILITY BURTON ROSENBERG UNIVERSITY OF MIAMI Contents 1. Perfect Secrecy 1 1.1. A Perfectly Secret Cipher 2 1.2. Odds Ratio and Bias 3 1.3. Conditions for Perfect

More information

CHAPTER 5 A BLOCK CIPHER INVOLVING A KEY APPLIED ON BOTH THE SIDES OF THE PLAINTEXT

CHAPTER 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 information

Cryptography. P. Danziger. Transmit...Bob...

Cryptography. 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 information

Candidates must show on each answer book the type of calculator used. Only calculators permitted under UEA Regulations may be used.

Candidates must show on each answer book the type of calculator used. Only calculators permitted under UEA Regulations may be used. UNIVERSITY OF EAST ANGLIA School of Mathematics May/June UG Examination 2010 2011 CRYPTOGRAPHY Time allowed: 2 hours Attempt THREE questions. Candidates must show on each answer book the type of calculator

More information

Efficient Cryptanalysis of Homophonic Substitution Ciphers

Efficient 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 information

Historical cryptography

Historical 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 information

UNIVERSITY OF CALIFORNIA Santa Barbara. Cryptanalysis of the SIGABA

UNIVERSITY OF CALIFORNIA Santa Barbara. Cryptanalysis of the SIGABA UNIVERSITY OF CALIFORNIA Santa Barbara Cryptanalysis of the SIGABA A Thesis submitted in partial satisfaction of the requirements for the degree Master of Science in Computer Science by Michael Lee Committee

More information

Simple Codes MTH 440

Simple 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 information

MODULAR ARITHMETIC. Suppose I told you it was 10:00 a.m. What time is it 6 hours from now?

MODULAR ARITHMETIC. Suppose I told you it was 10:00 a.m. What time is it 6 hours from now? MODULAR ARITHMETIC. Suppose I told you it was 10:00 a.m. What time is it 6 hours from now? The time you use everyday is a cycle of 12 hours, divided up into a cycle of 60 minutes. For every time you pass

More information

Cryptography and Number Theory

Cryptography and Number Theory Chapter 2 Cryptography and Number Theory 2.1 Cryptography and Modular Arithmetic 2.1.1 Introduction to Cryptography For thousands of years people have searched for ways to send messages in secret. For

More information

Classical Cryptography

Classical 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 information

Lecture 8 - Cryptography and Information Theory

Lecture 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 information

Chapter 2. A Look Back. 2.1 Substitution ciphers

Chapter 2. A Look Back. 2.1 Substitution ciphers Chapter 2 A Look Back In this chapter we take a quick look at some classical encryption techniques, illustrating their weakness and using these examples to initiate questions about how to define privacy.

More information

Polyalphabetic Substitutions

Polyalphabetic 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 information

Shannon s Theory of Secrecy Systems

Shannon 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 information

Unveiling the Chaocipher. Born in Dublin, Ireland on February 11, 1880, John F. Byrne created a cipher called the

Unveiling the Chaocipher. Born in Dublin, Ireland on February 11, 1880, John F. Byrne created a cipher called the Strickland 1 Tanner Strickland Dr. Bruff Math 115F 2 November 2010 Unveiling the Chaocipher Born in Dublin, Ireland on February 11, 1880, John F. Byrne created a cipher called the Chaocipher that has long

More information

ISSN: Received: Year: 2016, Number: 14, Pages: Published: Original Article **

ISSN: Received: Year: 2016, Number: 14, Pages: Published: Original Article ** http://www.newtheory.org ISSN: 2149-1402 Received: 14.01.2016 Year: 2016, Number: 14, Pages: 58-72 Published: 24.07.2016 Original Article ** FRAGMENTED POLYALPHABETIC CIPHER Yunus Aydoğan Naim Çağman Irfan

More information

Cryptanalysis. A walk through time. Arka Rai Choudhuri

Cryptanalysis. 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 information

Lecture Notes. Advanced Discrete Structures COT S

Lecture 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 information

Video intypedia001en EXERCISES

Video intypedia001en EXERCISES Video intypedia001en LESSON 1: HISTORY OF CRYPTOGRAPHY AND ITS EARLY STAGES IN EUROPE EXERCISES Dr. Arturo Ribagorda Garnacho, Carlos III University of Madrid, Spain. EXERCISE 1 The discovery that in each

More information

Public-Key Cryptosystems CHAPTER 4

Public-Key Cryptosystems CHAPTER 4 Public-Key Cryptosystems CHAPTER 4 Introduction How to distribute the cryptographic keys? Naïve Solution Naïve Solution Give every user P i a separate random key K ij to communicate with every P j. Disadvantage:

More information

15 Adjusting the Columns of a Disk Cipher

15 Adjusting the Columns of a Disk Cipher K. Pommerening, Language Statistics 69 15 Adjusting the Columns of a Disk Cipher As a last application in this chapter we look at the problem: How to adjust the alphabets in the columns of a disk cipher?

More information

Journal of Babylon University/Pure and Applied Sciences/ No.(3)/ Vol.(22): 2014

Journal of Babylon University/Pure and Applied Sciences/ No.(3)/ Vol.(22): 2014 Journal of Babylon University/Pure and Applied Sciences/ No.(3)/ Vol.(): 014 A Study of Different Complexity Evaluation Approaches for Some Cryptosystems Sabiha F. Jawad Al-Mustansyria University Iraq-

More information

Practice Assignment 2 Discussion 24/02/ /02/2018

Practice Assignment 2 Discussion 24/02/ /02/2018 German University in Cairo Faculty of MET (CSEN 1001 Computer and Network Security Course) Dr. Amr El Mougy 1 RSA 1.1 RSA Encryption Practice Assignment 2 Discussion 24/02/2018-29/02/2018 Perform encryption

More information

Modern symmetric encryption

Modern symmetric encryption 56 CHAPTER 2 MODERN SYMMETRIC ENCRYPTION Chapter 2 Modern symmetric encryption 21 Binary numbers and message streams For all the classical ciphers covered in the previous chapter, we dealt with encryption

More information

AN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY

AN 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 information

Hidden Markov Models for Vigenère Cryptanalysis

Hidden 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 information

THE ZODIAC KILLER CIPHERS. 1. Background

THE ZODIAC KILLER CIPHERS. 1. Background Tatra Mt. Math. Publ. 45 (2010), 75 91 DOI: 10.2478/v10127-010-0007-8 t m Mathematical Publications THE ZODIAC KILLER CIPHERS Håvard Raddum Marek Sýs ABSTRACT. We describe the background of the Zodiac

More information

COMM1003. Information Theory. Dr. Wassim Alexan Spring Lecture 5

COMM1003. 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 information

Chapter 2 : Perfectly-Secret Encryption

Chapter 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 information

Cryptography and Secure Communication Protocols

Cryptography and Secure Communication Protocols Cryptography and Secure Communication Protocols Jayadev Misra The University of Texas at Austin October 1, 2003 Contents 1 Introduction 1 2 Early Encryption Schemes 2 2.1 Substitution cyphers.........................

More information

History of Maths andx

History of Maths andx History of Maths andx where x Cryptography Substitution ciphers: Ancient - Renaissance A talk at the University of Nottingham by Peter Rowlett "The history of codes and ciphers is the story of the centuries-old

More information

Week 7 An Application to Cryptography

Week 7 An Application to Cryptography SECTION 9. EULER S GENERALIZATION OF FERMAT S THEOREM 55 Week 7 An Application to Cryptography Cryptography the study of the design and analysis of mathematical techniques that ensure secure communications

More information

CPE 776:DATA SECURITY & CRYPTOGRAPHY. Some Number Theory and Classical Crypto Systems

CPE 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 information

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states

More information

Lecture 12: Block ciphers

Lecture 12: Block ciphers Lecture 12: Block ciphers Thomas Johansson T. Johansson (Lund University) 1 / 19 Block ciphers A block cipher encrypts a block of plaintext bits x to a block of ciphertext bits y. The transformation is

More information

Solution to Midterm Examination

Solution to Midterm Examination YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Handout #13 Xueyuan Su November 4, 2008 Instructions: Solution to Midterm Examination This is a closed book

More information

Cryptography 2017 Lecture 2

Cryptography 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 information

NHMZK LWOGM PLMXG OBMLE LLOXA RURRJ MIZKL OGYHM KL

NHMZK LWOGM PLMXG OBMLE LLOXA RURRJ MIZKL OGYHM KL Math 139 Solution Final Exam May 2003 1. Decrypt the following, which has been enchipered using a shift cipher. CQNCA XDKUN FRCQC QNAJC AJLNR BCQJC NENWR OHXDF RWHXD ANBCR UUJAJ C Solution: Here s a frequency

More information

Attacks on DES , K 2. ) L 3 = R 2 = L 1 f ( R 1, K 2 ) R 4 R 2. f (R 1 = L 1 ) = L 1. ) f ( R 3 , K 4. f (R 3 = L 3

Attacks on DES , K 2. ) L 3 = R 2 = L 1 f ( R 1, K 2 ) R 4 R 2. f (R 1 = L 1 ) = L 1. ) f ( R 3 , K 4. f (R 3 = L 3 Attacks on DES 1 Attacks on DES Differential cryptanalysis is an attack on DES that compares the differences (that is, XOR values between ciphertexts of certain chosen plaintexts to discover information

More information

Computer Security. 07. Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2018

Computer 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 information

Solutions for week 1, Cryptography Course - TDA 352/DIT 250

Solutions for week 1, Cryptography Course - TDA 352/DIT 250 Solutions for week, Cryptography Course - TDA 352/DIT 250 In this weekly exercise sheet: you will use some historical ciphers, the OTP, the definition of semantic security and some combinatorial problems.

More information

secretsaremadetobefoundoutwithtime UGETGVUCTGOCFGVQDGHQWPFQWVYKVJVKOG Breaking the Code

secretsaremadetobefoundoutwithtime UGETGVUCTGOCFGVQDGHQWPFQWVYKVJVKOG Breaking the Code Breaking the Code To keep your secret is wisdom; but to expect others to keep it is folly. Samuel Johnson Secrets are made to be found out with time Charles Sanford Codes have been used by the military

More information

Cryptography Lecture 4 Block ciphers, DES, breaking DES

Cryptography 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 information

ECE 646 Lecture 5. Motivation: Mathematical Background: Modular Arithmetic. Public-key ciphers. RSA keys. RSA as a trap-door one-way function

ECE 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 information

Cristina Nita-Rotaru. CS355: Cryptography. Lecture 4: Enigma.

Cristina 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 information

Solutions to the Midterm Test (March 5, 2011)

Solutions to the Midterm Test (March 5, 2011) MATC16 Cryptography and Coding Theory Gábor Pete University of Toronto Scarborough Solutions to the Midterm Test (March 5, 2011) YOUR NAME: DO NOT OPEN THIS BOOKLET UNTIL INSTRUCTED TO DO SO. INSTRUCTIONS:

More information

Secrecy and the Quantum

Secrecy and the Quantum Secrecy and the Quantum Benjamin Schumacher Department of Physics Kenyon College Bright Horizons 35 (July, 2018) Keeping secrets Communication Alice sound waves, photons, electrical signals, paper and

More information

Lecture 1: Perfect Secrecy and Statistical Authentication. 2 Introduction - Historical vs Modern Cryptography

Lecture 1: Perfect Secrecy and Statistical Authentication. 2 Introduction - Historical vs Modern Cryptography CS 7880 Graduate Cryptography September 10, 2015 Lecture 1: Perfect Secrecy and Statistical Authentication Lecturer: Daniel Wichs Scribe: Matthew Dippel 1 Topic Covered Definition of perfect secrecy One-time

More information

CHAPTER 10 A GENERALIZED PLAYFAIR CIPHER INVOLVING INTERTWINING, INTERWEAVING AND ITERATION

CHAPTER 10 A GENERALIZED PLAYFAIR CIPHER INVOLVING INTERTWINING, INTERWEAVING AND ITERATION 151 CHAPTE 10 A GENEALIZED PLAYFAI CIPHE INVOLVING INTETWINING, INTEWEAVING AND ITEATION 152 10.1. INTODUCTION The Playfair cipher, which enjoyed its prominence during the Second World War, encrypts data

More information

Sound approaches to cryptography

Sound 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 information