Transposition Ciphers

Size: px
Start display at page:

Download "Transposition Ciphers"

Transcription

1 Transposition Ciphers A transposition cipher is one in which plaintext symbols are rearranged (that is, permuted or transposed) to produce ciphertext. The method of rearrangement, shared by Alice and Bob, may be typographical or mathematical in nature. 1

2 Simple Columnar Transposition The key information is the number k of columns. Encipherment: Plaintext is written in lines k letters wide and then transcribed column by column left to right to produce ciphertext. 2

3 Decipherment: If n is the length of the ciphertext, it is written column by column left to right down in a k (n DIV k) rectangular array with a tail of length n MOD k as shown. Transcribing row by row produces plaintext. k M E S S A G E... A N D M O R E... A N D S T I L... L A S T n MOD k n DIV k 3

4 Example: Suppose the key (number of columns) is 8. Encipher the plaintext NOTHING IN THE WORLD IS MORE DANGEROUS THAN SINCERE IGNORANCE AND CONSCIENTIOUS STUPIDITY Martin Luther King, Jr. 4

5 Solution: N O T H I N G I N T H E W O R L D I S M O R E D A N G E R O U S T H A N S I N C E R E I G N O R A N C E A N D C O N S C I E N T I O U S S T U P I D I T Y Ciphertext: NNDAT EAOII OTINH RNNOD THSGA ECSUI HEMEN IECST IWORS GAISY NOROI NNETG REUNO DNUIL DSCRC TP 5

6 Example: If the number of columns is 7 and the ciphertext is GPSDO AILTI VRVAA WETEC NITHM EDLHE TALEA ONNE find the plaintext. 6

7 Solution: There are 39 letters in the ciphertext, so there are 39 DIV 7 = 5 full rows and one partial row with 39 MOD 7 = 4 letters. G I V E M E A P L A C E T O S T A N D A N D I W I L L M O V E T H E E A R T H Plaintext: GIVE ME A PLACE TO STAND AND I WILL MOVE THE EARTH Archimedes 7

8 Keyword Columnar Transposition The order of transcription of the columns is determined by the alphabetical order of letters in the keyword. If repeated letters are allowed in the keyword, then the column under the leftmost occurence of the letter is transcribed first, followed successively by those to the right. Decipherment is as for the simple columnar transposition except that columns are written into the template in the order specified by the alphabetical order of the keyword s letters. 8

9 Example: With keyword QUICK, encipher the plaintext DO NOT SEEK THE TRUTH, ONLY CEASE TO CHERISH YOUR OPINIONS Zen Proverb 9

10 Solution Work: Q U I C K D O N O T S E E K T H E T R U T H O N L Y C E A S E T O C H E R I S H Y O U R O P I N I O N S Ciphertext: OKRNA CSRIN ETOEO IUNTT ULSHH OODSH TYEEY PNOEE HCTRO IS 10

11 Example: Decipher NSCRG LEXCT OEFNE HNRTL HOAHT OEICY NOIOT TEEGK SGWAO IHIAA NRWEN OTKRT DDPE if the keyword was k = COMPARE. 11

12 Solution: There are 64 letters in the ciphertext and 7 letters in the keyword, so it fits in a template with 64 DIV 7 = 9 full rows and a short row with 64 MOD 7 = 1 letter. 12

13 C O M P A R E T E C H N O L O G Y I S T H E K N A C K O F S O A R R A N G I N G T H E W O R L D T H A T W E D O N O T E X P E R I E N C E I T 13

14 C O M P A R E T E C H N O L O G Y I S T H E K N A C K O F S O A R R A N G I N G T H E W O R L D T H A T W E D O N O T E X P E R I E N C E I T Plaintext: TECHNOLOGY IS THE KNACK OF SO ARRANGING THE WORLD THAT WE DO NOT EXPERIENCE IT Max Frisch (1911 ), Rollo May, The Cry for Myth, Norton, NY, p

15 Cryptanalysis For a simple columnar transposition, cryptanalysis is relatively easy: try deciphering with various numbers of columns until intelligible plaintext shows up. 15

16 Example: Cryptanalyze this! SISEE RMIHI GHNST SEANA VAGOI MDNGN IRIMM OEDTG N Solution k = 2? S A I G S O E I E M.. gives SAIGSOEIEM..., which is not English. 16

17 k = 3? S T G I S N S E I E A R E N I... gives STGISNSEIEARENI..., which is not English. 17

18 k = 4? S H A R I N G I S S O M E T I M E S M O R E D E M A N D I N G T H A N G I V I N G gives SHARINGISSOMETIMESMOREDEMANDINGTHANGIVING Mary Bateson 18

19 Cryptanalysis of a Keyword Columnar Transposition Basic idea: determine the number of columns and then anagram the columns to find an intelligibile message. Example: Suppose that SRUGE PEDIA SDWXC SATLS NRNMT EAEEE AOMSU ITENI KHBBI IDEER ENEW was produced by a keyword columnar transposition and that EXPERIENCE was part of the plaintext. Find the plaintext. 19

20 Solution: k=2? The plaintext EXPERIENCE would encipher either * E E X X P P E E R as R I or I E E N N C C E E * In either case, the sequences EPREC and XEINE should appear. They do not, so this is not the keyword length. 20

21 k=3? The plaintext EXPERIENCE would encipher either as or * E X P E R I E N C E * or * * E X P E R I E N C E E X P E R I E N C E In any case, the sequences EEEE, XRN, and PIC should appear. They do not, so this is not the keyword length. 21

22 Continuing this way and hoping that the keyword has fewer than 10 letters, we find that assuming k = 7 implies * * * * * * * E X P E R I E N C E * * * * The sequences EN, XC, and PE should appear in the ciphertext. They do! SRUGE PEDIA SDWXC SATLS NRNMT EAEEE AOMSU ITENI KHBBI IDEER ENEW 22

23 7 Columns fit in this template; determine the long and short columns

24 The columns are either M I S A T I E S A R T E K E U S U L A H R I D G S E B E T W E N E B N E X P R E I E N C E N A I W S D M O D if MSU ITEN and EER ENEW are short, or M I S A T I D S A R T E K E U S U L A H E I D G S E B R T W E N E B E E X P R E I N N C E N A I E S D M O W if MSU ITEN and IKHBBII are short, or 24

25 M I S A T K E S A R T E H E U S U L A B R I D G S E B E T W E N E I N E X P R E I E N C E N A D W I S D M O if KHBBI ID and EER ENEW are short. 25

26 Anagramming the third set of columns gives M I S T A K E S A R E T H E U S U A L B R I D G E S B E T W E E N I N E X P E R I E N C E A N D W I S D O M 26

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

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

Polyalphabetic Ciphers

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

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

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

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

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

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

} has dimension = k rank A > 0 over F. For any vector b!

} has dimension = k rank A > 0 over F. For any vector b! FINAL EXAM Math 115B, UCSB, Winter 2009 - SOLUTIONS Due in SH6518 or as an email attachment at 12:00pm, March 16, 2009. You are to work on your own, and may only consult your notes, text and the class

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

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

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

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

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

MATH3302 Cryptography Problem Set 2

MATH3302 Cryptography Problem Set 2 MATH3302 Cryptography Problem Set 2 These questions are based on the material in Section 4: Shannon s Theory, Section 5: Modern Cryptography, Section 6: The Data Encryption Standard, Section 7: International

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

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

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

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

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

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

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

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

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

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

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

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

last name ID 1 c/cmaker/cbreaker 2012 exam version a 6 pages 3 hours 40 marks no electronic devices SHOW ALL WORK

last name ID 1 c/cmaker/cbreaker 2012 exam version a 6 pages 3 hours 40 marks no electronic devices SHOW ALL WORK last name ID 1 c/cmaker/cbreaker 2012 exam version a 6 pages 3 hours 40 marks no electronic devices SHOW ALL WORK 8 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 1 b c d e f g h i j k l m n o p q

More information

Grade 6 Math Circles. History of Cryptography - Solutions

Grade 6 Math Circles. History of Cryptography - Solutions Faculty of Mathematics Waterloo, Ontario N2L 3G1 Problem Set Grade 6 Math Circles November 19/20, 2013 History of Cryptography - Solutions 1. A Caesar Cipher with a shift of 5 is used. ciphertext V W X

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

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

Grade 7 and 8 Math Circles March 19th/20th/21st. Crytography

Grade 7 and 8 Math Circles March 19th/20th/21st. Crytography Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7 and 8 Math Circles March 19th/20th/21st Crytography Introduction Before we begin, it s important

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

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

Classical. More Ciphers. By Richard Spillman. Based on slides from the book Classical & Contemporary Cryptology By. & ontempory ryptology

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

ASSIGNMENT Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9.

ASSIGNMENT Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9. ASSIGNMENT 1 1. Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9. 2. (i) If d a and d b, prove that d (a + b). (ii) More generally,

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

Weaknesses in Hadamard Based Symmetric Key Encryption Schemes

Weaknesses in Hadamard Based Symmetric Key Encryption Schemes Weaknesses in Hadamard Based Symmetric Key Encryption Schemes Gajraj Kuldeep, Devendra Kumar Yadav, A. K. Sharma SAG DRDO In this paper security aspects of the existing symmetric key encryption schemes

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

CHAPTER 12 CRYPTOGRAPHY OF A GRAY LEVEL IMAGE USING A MODIFIED HILL CIPHER

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

19 Lorenz Cipher Machine

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

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

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

Homework 4 for Modular Arithmetic: The RSA Cipher

Homework 4 for Modular Arithmetic: The RSA Cipher Homework 4 for Modular Arithmetic: The RSA Cipher Gregory V. Bard April 25, 2018 This is a practice workbook for the RSA cipher. It is not suitable for learning the RSA cipher from scratch. However, there

More information

question 1: scheduling

question 1: scheduling Iverson exam 2013 3 question 1: scheduling A prereq is a task that must be performed before a particular other task. A schedule is an ordering of all tasks so that so that all prereqs are satisfied. Example:

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

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

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

Module 2 Advanced Symmetric Ciphers

Module 2 Advanced Symmetric Ciphers Module 2 Advanced Symmetric Ciphers Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University E-mail: natarajan.meghanathan@jsums.edu Data Encryption Standard (DES) The DES algorithm

More information

Cryptography: A Fairy Tale for Mathematicians and Starring Mathematicians!

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

CRYPTOGRAPHY AND NUMBER THEORY

CRYPTOGRAPHY AND NUMBER THEORY CRYPTOGRAPHY AND NUMBER THEORY XINYU SHI Abstract. In this paper, we will discuss a few examples of cryptographic systems, categorized into two different types: symmetric and asymmetric cryptography. We

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

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

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

Univ.-Prof. Dr. rer. nat. Rudolf Mathar. Written Examination. Cryptography. Tuesday, August 29, 2017, 01:30 p.m.

Univ.-Prof. Dr. rer. nat. Rudolf Mathar. Written Examination. Cryptography. Tuesday, August 29, 2017, 01:30 p.m. Cryptography Univ.-Prof. Dr. rer. nat. Rudolf Mathar 1 2 3 4 15 15 15 15 60 Written Examination Cryptography Tuesday, August 29, 2017, 01:30 p.m. Name: Matr.-No.: Field of study: Please pay attention to

More information

Examples of Solving Cm Cons*

Examples of Solving Cm Cons* Examples of Solving Cm Cons* Solving E-1 from Sample Cm Route Transposition * Cm Cons means cipher constructions in The Cryptogram -- the bi-monthly publication for members of the American Cryptogram Association

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

10 Modular Arithmetic and Cryptography

10 Modular Arithmetic and Cryptography 10 Modular Arithmetic and Cryptography 10.1 Encryption and Decryption Encryption is used to send messages secretly. The sender has a message or plaintext. Encryption by the sender takes the plaintext and

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

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

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

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

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

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

Introduction on Block cipher Yoyo Game Application on AES Conclusion. Yoyo Game with AES. Navid Ghaedi Bardeh. University of Bergen.

Introduction on Block cipher Yoyo Game Application on AES Conclusion. Yoyo Game with AES. Navid Ghaedi Bardeh. University of Bergen. Yoyo Game with AES Navid Ghaedi Bardeh University of Bergen May 8, 2018 1 / 33 Outline 1 Introduction on Block cipher 2 Yoyo Game 3 Application on AES 4 Conclusion 2 / 33 Classical Model of Symmetric Cryptography

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

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

Stream ciphers I. Thomas Johansson. May 16, Dept. of EIT, Lund University, P.O. Box 118, Lund, Sweden

Stream ciphers I. Thomas Johansson. May 16, Dept. of EIT, Lund University, P.O. Box 118, Lund, Sweden Dept. of EIT, Lund University, P.O. Box 118, 221 00 Lund, Sweden thomas@eit.lth.se May 16, 2011 Outline: Introduction to stream ciphers Distinguishers Basic constructions of distinguishers Various types

More information

4 th Class. Computer Cryptography

4 th Class. Computer Cryptography 4 th Class Computer Cryptography Cryptography: Cipher systems Lectures References: 1- Applied Cryptography, Bruce Schneier, 1996. 2- Cipher Systems: The protection of communication, H.Beker, F.Piper, 1998.

More information

Lattices. A Lattice is a discrete subgroup of the additive group of n-dimensional space R n.

Lattices. A Lattice is a discrete subgroup of the additive group of n-dimensional space R n. Lattices A Lattice is a discrete subgroup of the additive group of n-dimensional space R n. Lattices have many uses in cryptography. They may be used to define cryptosystems and to break other ciphers.

More information

Low Complexity Differential Cryptanalysis and Fault Analysis of AES

Low Complexity Differential Cryptanalysis and Fault Analysis of AES Low Complexity Differential Cryptanalysis and Fault Analysis of AES Michael Tunstall May/June, 2011 Michael Tunstall (University of Bristol) May/June, 2011 1 / 34 Introduction We present a survey of low

More information

ECS 189A Final Cryptography Spring 2011

ECS 189A Final Cryptography Spring 2011 ECS 127: Cryptography Handout F UC Davis Phillip Rogaway June 9, 2011 ECS 189A Final Cryptography Spring 2011 Hints for success: Good luck on the exam. I don t think it s all that hard (I do believe I

More information

Classical Cryptography

Classical Cryptography Outline [1] Introduction: Some Simple Cryptosystems The Shift Cipher The Substitution Cipher The Affine Cipher The Vigenère Cipher The Hill Cipher The Permutation Cipher [2] Cryptanalysis

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

Public-key Cryptography and elliptic curves

Public-key Cryptography and elliptic curves Public-key Cryptography and elliptic curves Dan Nichols nichols@math.umass.edu University of Massachusetts Oct. 14, 2015 Cryptography basics Cryptography is the study of secure communications. Here are

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

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

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague 27 October, CS1800 Discrete Structures Midterm Version A

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague 27 October, CS1800 Discrete Structures Midterm Version A CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague 27 October, 2016 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes.

More information

Private-key Systems. Block ciphers. Stream ciphers

Private-key Systems. Block ciphers. Stream ciphers Chapter 2 Stream Ciphers Further Reading: [Sim92, Chapter 2] 21 Introduction Remember classication: Private-key Systems Block ciphers Stream ciphers Figure 21: Private-key cipher classication Block Cipher:

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

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

One can use elliptic curves to factor integers, although probably not RSA moduli.

One can use elliptic curves to factor integers, although probably not RSA moduli. Elliptic Curves Elliptic curves are groups created by defining a binary operation (addition) on the points of the graph of certain polynomial equations in two variables. These groups have several properties

More information

In fact, 3 2. It is not known whether 3 1. All three problems seem hard, although Shor showed that one can solve 3 quickly on a quantum computer.

In fact, 3 2. It is not known whether 3 1. All three problems seem hard, although Shor showed that one can solve 3 quickly on a quantum computer. Attacks on RSA, some using LLL Recall RSA: N = pq hard to factor. Choose e with gcd(e,φ(n)) = 1, where φ(n) = (p 1)(q 1). Via extended Euclid, find d with ed 1 (mod φ(n)). Discard p and q. Public key is

More information

Cryptography. pieces from work by Gordon Royle

Cryptography. pieces from work by Gordon Royle Cryptography pieces from work by Gordon Royle The set-up Cryptography is the mathematics of devising secure communication systems, whereas cryptanalysis is the mathematics of breaking such systems. We

More information

Outline. 1 Arithmetic on Bytes and 4-Byte Vectors. 2 The Rijndael Algorithm. 3 AES Key Schedule and Decryption. 4 Strengths and Weaknesses of Rijndael

Outline. 1 Arithmetic on Bytes and 4-Byte Vectors. 2 The Rijndael Algorithm. 3 AES Key Schedule and Decryption. 4 Strengths and Weaknesses of Rijndael Outline CPSC 418/MATH 318 Introduction to Cryptography Advanced Encryption Standard Renate Scheidler Department of Mathematics & Statistics Department of Computer Science University of Calgary Based in

More information

Perfectly-Secret Encryption

Perfectly-Secret Encryption Perfectly-Secret Encryption CSE 5351: Introduction to Cryptography Reading assignment: Read Chapter 2 You may sip proofs, but are encouraged to read some of them. 1 Outline Definition of encryption schemes

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

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

The Turing Bombe and its Role in Breaking Enigma

The Turing Bombe and its Role in Breaking Enigma he uring Bombe and its Role in Breaking Enigma Neil igmon npsigmon@radford.edu Department of Mathematics and tatistics Radford University U..A. Rick Klima klimare@appstate.edu Department of Mathematical

More information

Winter 2008 Introduction to Modern Cryptography Benny Chor and Rani Hod. Assignment #2

Winter 2008 Introduction to Modern Cryptography Benny Chor and Rani Hod. Assignment #2 0368.3049.01 Winter 2008 Introduction to Modern Cryptography Benny Chor and Rani Hod Assignment #2 Published Sunday, February 17, 2008 and very slightly revised Feb. 18. Due Tues., March 4, in Rani Hod

More information

Written examination. Tuesday, August 18, 2015, 08:30 a.m.

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

Secret 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 (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 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