Video intypedia001en EXERCISES

Size: px
Start display at page:

Download "Video intypedia001en EXERCISES"

Transcription

1 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 language the letters appeared with a different frequency, allowed the deciphering of Caesar type ciphertexts and, specially, monoalphabetic ciphertexts. For this reason, since the Renaissance, cryptographers exerted in finding new ciphering methods and hence came up with the polyalphabetic systems. These use several alphabets for ciphering, so that each ciphertext letter of another letter depends on the position of the plaintext letter. The simplest of these methods uses two cipher alphabets: one for letters occupying even positions of the plaintext and the other alphabet for the letters in odd positions. An example of this would be: Alphabet for odd positions 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 e i m p t x b f j n q u y g k c r v z d h l o s w Alphabet for even positions 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 n r w b g l p u z e j c s x h m q v a f k o t y d i Use this polyalphabetic method to encipher the following plaintext: POLYALPHABETIC SUBSTITUTION Exercises intypedia001en 1

2 SOLUTION Following the given instructions leads to this substitution: P O L Y A L P H A B E T I C S U B S T I T U T I O N k h q d a c k u a r p f f w v k e a z z z k z z g x So the final result would be: k h q y a c k u a r p f f w v k e a z z z k z z g x EXERCISE A transposition method, which was commonly used in ancient times, was the COLUMNAR TRANSPOSITION. First of all, the plaintext is written out, from left to right and top to bottom, in a table with a certain amount of columns. Each letter fits into a cell of the table, which has as many rows as necessary. Then, the ciphertext is obtained by writing the letters in the first column, afterwards the letters in the second column, and so on, until all the letters in the table have been written. Using the columnar transposition method, with five columns, encipher the following plaintext: A COLUMNAR TRANSPOSITION EXERCISE 2.- In order to complicate this process a little, a keyword formed by non-repeating letters and as many letters that you wish the table to have can be used. By writing the keyword on top of the table the first letter of the keyword on top of the first column, the second letter on top of the second column, etc - the ciphertext is obtained by writing out the column whose first letter (that of the keyword) is first in alphabetical order, then the column whose first letter is the following in alphabetical order and so on. Using the columnar transposition method, with the keyword CIPHER, encrypt the following plaintext: I HAVE A COMPLETE EXAM WITH SOLUTION SOLUTION 1.- The plaintext is written in a table with five columns: A C O L U M N A R T R A N S P O S I T I O N E X E Exercises intypedia001en 2

3 R C I S E Extracting the letters following the column order (first the letters in the first column, then the letters in the second column, then the ones in the third and so on) the ciphertext reads as follows: a m r o o r c n a s n c o a n i e i l r s t x s u t p i e e 2.- Since the keyword has six letters, there should also be six columns. So the plaintext written out in six columns looks as follows: With the keyword written on top: C I P H E R I H A V E A C O M P L E T E E X A M W I T H S O L U T I O N So writing the letters of the columns, according to the alphabetical order of the letters of the keyword (first the C, then the E, then the H, then the I, then the P and finally the R), the ciphertext should look like this: i c t w l e l a s o v p x h i h o e i u a m e t t a e m o n EXERCISE 3 I H A V E A C O M P L E T E E X A M W I T H S O L U T I O N With the monoalphabetic substitution methods broken by the Arabs discovery of cryptanalysis, at the end of the Late Middle Ages, specifically since the Renaissance, new encryption methods began to arise, like the polyalphabetic and nomenclator methods. The latter consisted of a catalogue of names that were going to be ciphered, so each one of them appeared associated with a word, a number or a group of symbols that would substitute the original name in the ciphertext. Exercises intypedia001en 3

4 Often, polyalphabetic and nomenclator methods were combined, like in the Alberti cipher disk. Looking at the following Alberti cipher disk: and the nomenclator: Phillip II 123 King 124 Walshingam 122 Decipher the following text: b aavqnpgnvsvoiycekcel NOTE 1: For each ten deciphered letters, the outer ring (the one with the uppercase alphabet) has to rotate two positions clockwise. NOTE 2: When enciphering with the Alberti disk, the u corresponds to the v. And when deciphering, the meaning of the sentence is used to figure out which of the letters should it be. SOLUTION: With the rings in their original position: b a a v q n p g n v I S D E A D I With the outer ring rotated 2 positions clockwise: s v o i y c e k c e N F O R M With the outer ring rotated another 2 positions clockwise: l 3 This way, the plaintext (without taking into account the nomenclator) results in: Exercises intypedia001en 4

5 122ISDEADINFORM So, if we take the nomenclator into account (and adding a space between words in order to read it properly) the deciphered text reads as follows: Walshingam is dead Inform King Phillip II EXERCISE 4 Substitution methods like Caesar replace each letter of the alphabet in the plaintext for another letter in a fixed position down the alphabet (in the Caesar methods this number is three). Knowing that the following ciphertext was obtained using the Caesar method, decipher the message knowing that the English letter frequency is as shown in the table below: drscsckxohkwzvoypmkockbdizoypwyxykvzrklodsmmszrob E T A O I N 10% 7% 6,5% 6% 5,6% 5,5% SOLUTION First of all we have to find the ciphertext letter that corresponds to the e, so we can know how many positions down the alphabet are the ciphertext letters in relation to the plaintext letters. Then the deciphering will be nearly automatic. If we count how many times the letters appear in the ciphertext, there are: O K S Y Z The cipher letter o (the one that appears most times, along with the k ) corresponds to the plaintext letter e. So the alphabet used must be: 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 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 Exercises intypedia001en 5

6 This is confirmed, because the following most frequent ciphertext letter is k which corresponds to the a. Since the ciphertext is very short, the rest of the letters don t follow the typical frequency. The bigger the text, the closer it is to the aforementioned percentage. Considering the ciphertext: drscsckxohkwzvoypk mkockbdizoypwyxykvzrklodsmmszrob And using the attained alphabet: D R S C S C K X O H K W Z V O Y P K M K O C K B T H I S I S A N E X A M P L E O F A C A E S A R D I Z O Y P W Y X Y K V Z R K L O D S M M S Z R O B T Y P E O F M O N O A L P H A B E T I C C I P H E R Results in the following plaintext: This is an example of a Caesar type of monoalphabetic cipher EXERCISE 5 When cryptanalysing a ciphertext, one of the first problems we face is finding out whether a transposition or substitution method has been used. In the first case, the letters haven t changed their meaning, only the position, so the number of times each letter appears will probably correspond to the frequency in which it appears in the relevant language. Therefore, the method would be transposition. Knowing that the distribution of letters in Spanish is approximately: E A O L S N Please reason out if the following ciphertext has been produced using a monoalphabetic substitution method or a permutation method: Is modí es unovedad porquean te slos hombrñe spodan divid irs es encillamf, igu rac i nhum an asi nparentoda l ahist, oriaele. Sp ecial ist ano ssi rveheaquunpór ecioso eje mpl ar dees te extraoho. Mb renuevoquehe int entad ente ensabiose igénorantesen ms omenoss a biosymso men osig no rantesoporu na yo tradesu. Sverti entes yha cesdefi niríhe dichoquee, raunaconparac, on cretar e nrgicament, el aáe s pecie yhacer n oás v ertod oelradical. Exercises intypedia001en 6

7 SOLUTION There is approximately the following amount of letters: e = 49 a = 44 o =32 l =9 s =29 n =28 Total letters = 368 That makes: e= 13%; a=12%; 0=9%; l=2%; s= 8%; n = 8%, which is more or less the same as the natural frequency of letters in Spanish, therefore, this is a transposition cipher. Madrid, Spain, September Exercises intypedia001en 7

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

26 HIDDEN MARKOV MODELS

26 HIDDEN MARKOV MODELS 26 HIDDEN MARKOV MODELS techniques to HMMs. Consequently, a clear understanding of the material in this chapter is crucial before proceeding with the remainder of the book. The homework problem will help

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

} 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

17.1 Binary Codes Normal numbers we use are in base 10, which are called decimal numbers. Each digit can be 10 possible numbers: 0, 1, 2, 9.

17.1 Binary Codes Normal numbers we use are in base 10, which are called decimal numbers. Each digit can be 10 possible numbers: 0, 1, 2, 9. ( c ) E p s t e i n, C a r t e r, B o l l i n g e r, A u r i s p a C h a p t e r 17: I n f o r m a t i o n S c i e n c e P a g e 1 CHAPTER 17: Information Science 17.1 Binary Codes Normal numbers we use

More information

Powers in Modular Arithmetic, and RSA Public Key Cryptography

Powers in Modular Arithmetic, and RSA Public Key Cryptography 1 Powers in Modular Arithmetic, and RSA Public Key Cryptography Lecture notes for Access 2006, by Nick Korevaar. It was a long time from Mary Queen of Scotts and substitution ciphers until the end of the

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

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

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

Classic Cryptography Tutorial. c Eli Biham - May 3, Classic Cryptography Tutorial (3)

Classic Cryptography Tutorial. c Eli Biham - May 3, Classic Cryptography Tutorial (3) Classic Cryptography Tutorial c Eli Biham - May 3, 2005 68 Classic Cryptography Tutorial (3) Ciphertext-Only Attack on Substitution Cipher Monoalphabetic substitution ciphers cannot protect against known

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

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

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

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

Polybius s square. History ancient Greece. Short history. Polybius, Ancient Greece : communication with torches

Polybius s square. History ancient Greece. Short history. Polybius, Ancient Greece : communication with torches CRYPTOLOGY : CRYPTOGRAPHY + CRYPTANALYSIS Polybius s square Cryptology = science of secrecy. How : encipher a plaintext into a ciphertext to protect its secrecy. The recipient deciphers the ciphertext

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

Number Theory in Cryptography

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

Know the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].

Know the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x]. The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive

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

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

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

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

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

Study Guide and Intervention. Solving Systems of Equations Using Inverse Matrices

Study Guide and Intervention. Solving Systems of Equations Using Inverse Matrices -8 Study Guide and Intervention Identity and Inverse Matrices The identity matrix for matrix multiplication is a square matrix with s for every element of the main diagonal and zeros elsewhere. Identity

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

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

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

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

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

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

STATISTICAL TOOLS USED IN CRYPTOGRAPHIC EVALUATION

STATISTICAL TOOLS USED IN CRYPTOGRAPHIC EVALUATION Bulletin of the Transilvania University of Braşov Vol 4(53) No. 2-2011 Series III: Mathematics, Informatics, Physics, 129-140 STATISTICAL TOOLS USED IN CRYPTOGRAPHIC EVALUATION Adela GEORGESCU 1 Ruxandra

More information

On adaptive of classical and public key cryptography by using E- and - laws

On adaptive of classical and public key cryptography by using E- and - laws On adaptive of classical and public key cryptography by using E- and - laws AMEER A.J. AL-SWIDI University of Babylon,Collage of Education for pure sciences, Math. Department. Waleedabd73@yahoo.com Abstract:

More information

Parallel Implementation of Proposed One Way Hash Function

Parallel Implementation of Proposed One Way Hash Function UDC:004.421.032.24:003.26 Parallel Implementation of Proposed One Way Hash Function Berisha A 1 1 University of Prishtina, Faculty of Mathematics and Natural Sciences, Kosovo artan.berisha@uni-pr.edu Abstract:

More information

Cryptography. monoalphabetic. Ciphers. New Cipher Types. Keyword Cipher. Further subdivisions:...

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

Transposition Ciphers

Transposition Ciphers 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,

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

Linear Ciphers. Klaus Pommerening Fachbereich Physik, Mathematik, Informatik der Johannes-Gutenberg-Universität Saarstraße 21 D Mainz

Linear Ciphers. Klaus Pommerening Fachbereich Physik, Mathematik, Informatik der Johannes-Gutenberg-Universität Saarstraße 21 D Mainz Linear Ciphers Klaus Pommerening Fachbereich Physik, Mathematik, Informatik der Johannes-Gutenberg-Universität Saarstraße 21 D-55099 Mainz January 16, 2000 English version July 28, 2014 last change August

More information

CHAPTER 4 REDUCTION OF VARIABLE LENGTH KEY SEARCH TIME OF VIGENERE CIPHER USING FIREFLY ALGORITHM

CHAPTER 4 REDUCTION OF VARIABLE LENGTH KEY SEARCH TIME OF VIGENERE CIPHER USING FIREFLY ALGORITHM 64 CHAPTER 4 REDUCTION OF VARIABLE LENGTH KEY SEARCH TIME OF VIGENERE CIPHER USING FIREFLY ALGORITHM 4.1 INTRODUCTION Any Cryptanalyst should focus on the two basic needs of cryptanalysis such as 1. To

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

Number theory (Chapter 4)

Number theory (Chapter 4) EECS 203 Spring 2016 Lecture 12 Page 1 of 8 Number theory (Chapter 4) Review Compute 6 11 mod 13 in an efficient way What is the prime factorization of 100? 138? What is gcd(100, 138)? What is lcm(100,138)?

More information

A Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix

A Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix A Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix S. Udaya Kumar V. U. K. Sastry A. Vinaya babu Abstract In this paper, we have developed a block cipher

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

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