Facts & Myths of Enigma

Size: px
Start display at page:

Download "Facts & Myths of Enigma"

Transcription

1 Facts & Myths of Enigma Breaking Stereotypes Arkadiusz Orłowski & Kris Gaj

2 How should we begin? Begin at the beginning, and go on till you come to the end: then stop. The King to the White Rabbit Lewis Carroll, Alice s Adventures in Wonderland

3 Who invented the wheel?

4 Who reinvented the wheel? Eduard Hugh Hebern ( ) first patent from 1915 Arthur Scherbius ( ) German patent filed in Hugo Alexander Koch ( ) The Netherlandish patent for Geheimschrijftsmachine Arvid Gerhard Damm ( ) Swedish patent

5 Who reinvented the wheel? Eduard Hugh Hebern ( ) first patent from 1915 Arthur Scherbius ( ) German patent filed in Hugo Alexander Koch ( ) The Netherlandish patent for Geheimschrijftsmachine Arvid Gerhard Damm ( ) Swedish patent

6

7 Life is brutal...

8 Scherbius Enigma German patent filed in ; issued as Second German patent issued as (priority from ) U.S. patent issued Koch s patent from 1919 bought in 1927

9 Drawing from Scherbius U.S. patent

10 Military Enigma

11

12

13

14

15

16

17

18

19

20

21

22

23 Functional diagram & dataflow

24 Enigma Daily Keys

25 Four Components of the Daily Key

26 Order of rotors (Walzenlage) 6 combinations

27 Positions of rings (Ringstellung) 26 3 combinations

28 Plugboard Connections (Steckerverbindung) ~ combinations

29 Initial Positions of Rotors (Grundstellung) 26 3 combinations

30 Total Number of Keys Was Enigma more secure than DES?

31 After Jun After Feb After Oct How often did the daily keys change? Rotors Rings Plugs Every quarter Every month 24 hrs 24 hrs 24 hrs 24 hrs 24 hrs 24 hrs 24 hrs hrs 24 hrs 24 hrs

32 Message Key: Enigma s Achilles Foot

33 Message Key Three letters (or numbers) selected randomly by every operator Determines the positions of rotors where the message encryption starts

34 Message Key cont. Protects against the separate frequency analysis of all first letters, all second letters, etc abcdefghijklmnopqrstuvwxyz Could be possibly sent in clear (the same as IVs in modern ciphers)

35 Message Key cont. Encrypted TWICE using initial positions of rotors Sent in the encrypted form in the message header

36

37

38 Polish Signal Interception Stations Starogard Poznan Krzeslawice

39 Marian Rejewski (born 1905)

40

41 Jerzy Różycki (born 1909)

42 Henryk Zygalski (born 1907)

43 Headers of messages intercepted on the same day 1. c h m g r t 2. x r w r g s 3. o w o q k k 4. f k r x o a 5. o u v q a y 6. c r x g g g 7. v v b z s e 8. u u z y a u 9. n n k m l d o a k q w d 71. q o f d y q 72. k s m p c t 73. u x u y p w 74. u n k y l d 75. x c o r b k 76. r j j h i r 77. t t g b u c 78. w x g a p c

44 Encryption as a permutation Message key q w e q w e A B C D E F Encrypted message key d m q v b n

45 How the reflecting rotor helps? Message key q w e q w e A B C D E F Encrypted message key d m q v b n

46 Determining a product of permutations Message key q w e q w e A B C D E F Encrypted message key d m q v b n AD contains d v BE contains m b CF contains q n

47 Rejewski s theorem If 2 permutations of the same degree are involutions then their product contains an even number of disjoint cycles of the same length.

48 How German clerks helped Polish to find A, B, C, D, E, F? Preference for message keys of the form: 1. qqq, aaa, etc. 2. qwe, asd, etc. 3. with all letters different

49 What remains is just to solve these equations A = S H R T R -1 H -1 S -1 B = SHQ R Q -1 T Q R Q -1 H -1 S -1 C = SHQ 2 R Q -2 T Q 2 R -1 Q -2 H -1 S -1 D = SHQ 3 R Q -3 T Q 3 R -1 Q -3 H -1 S -1 E = SHQ 4 R Q -4 T Q 4 R -1 Q -4 H -1 S -1 F = SHQ 5 R Q -5 T Q 5 R -1 Q -5 H -1 S -1

50 How to reduce the number of unknowns? T R H S

51 Gustave Bertrand

52 Hans Thilo Schmidt (H vel Asche)

53 Rodolphe Lemoine (Rex)

54 Six equations, two unknowns How difficult can it be? A = S H R T R -1 H -1 S -1 B = S H Q R Q -1 T Q R Q -1 H -1 S -1 C = S H Q 2 R Q -2 T Q 2 R -1 Q -2 H -1 S -1 D = S H Q 3 R Q -3 T Q 3 R -1 Q -3 H -1 S -1 E = S H Q 4 R Q -4 T Q 4 R -1 Q -4 H -1 S -1 F = S H Q 5 R Q -5 T Q 5 R -1 Q -5 H -1 S -1

55 Theorem that won the WWII If G & P are permutations then a permutation PGP -1 has the same cycle structure as permutation G.

56 Cyclometer

57 Polish Bomba

58

59 Zygalski s sheet

60 Zygalski s sheet

61 What has changed?

62 Pyry

63

64

65

66

67

68

69

70 Y - station

71

72

73

74

75

76

77

78

79 Alan Turing

80 Gordon Welchman

81

82

83

84

85

86

87

88

89

90

91 Joseph R. Desch ( )

92

93

94

95

96

97

98 Howdo we knowallthat?! Well... W. Kozaczuk, 1967 M. Rejewski, 1967 G. Bertrand, 1973 F. Winterbotham, 1974

99

100

101 All s well that ends well? Well...

102

103

104

105

106

107

108

109

110 1979,

111 Available Translations Yugoslavia 1977 Poland 1979, 1986 U.S.A East Germany 1987 West Germany 1989 Bulgaria 1990 Germany

112 Enigma Cipher Methods of Breaking, 1989

113

114 1996 (2 nd ed) 1999

115 2000

116 Question: So the Polish stuff was a god send. David Kahn: The Polish stuff was essential and an absolute god send to the British, and to the French.

117 The Enigma codes would not have been broken if it were not for the knowledge of Polish mathematicians Prince Andrew, the Duke of York

118 Enigma Lessons 1. Keeping machine secret did not help 2. Large number of keys did not help 3. Known-plaintext attack was easy to mount 4. Do not let people to generate keys 5. Key management is the weakest link

119 Take-home messages 1. Never underestimate the amount of money, time, people, attention, and risk the opponent can use 2. Train and educate your people 3. Don t worry 4. Be happy

120 "I have made this letter longer than usual because I lack the time to make it shorter." - Blaise Pascal

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

Algebra for Cryptology

Algebra for Cryptology Algebra for Cryptology Arkadii Slinko Department of Mathematics The University of Auckland Auckland, 6 April, 2013 What is cryptology? Cryptology is about communication in the presence of adversaries or

More information

1999 version 2001 simplified version

1999 version 2001 simplified version 香港中文大學讀書會 1999 version 2001 simplified version Author Simon Singh http://simonsingh.net/ 1. Fermat s Last Theorem the epic quest to Solve the World's Greatest Mathematical Problem(2007) 2. The Code Book(1999)

More 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

Historical Ciphers. Required Reading. W. Stallings, Cryptography and Network Security, Chapter 2, Classical Encryption Techniques

Historical Ciphers. Required Reading. W. Stallings, Cryptography and Network Security, Chapter 2, Classical Encryption Techniques ECE 646 - Lecture 6 Historical Ciphers Required Reading W tallings, Cryptography and Network ecurity, Chapter, Classical Encryption Techniques A Menezes et al, Handbook of Applied Cryptography, Chapter

More information

Historical Ciphers. ECE Lecture 6. Why (not) to study historical ciphers? Required Reading. Secret Writing. Mary, Queen of Scots

Historical Ciphers. ECE Lecture 6. Why (not) to study historical ciphers? Required Reading. Secret Writing. Mary, Queen of Scots ECE - Lecture Required Reading W tallings, Cryptography and Network ecurity, Historical Ciphers Chapter, Classical Encryption Techniques A Menezes et al, Handbook of Applied Cryptography, Chapter 73 Classical

More information

Cryptography. The Making and Breaking of Secret Codes. 5/29/2009 John C. Polking, Rice University 1

Cryptography. The Making and Breaking of Secret Codes. 5/29/2009 John C. Polking, Rice University 1 Cryptography The Making and Breaking of Secret Codes. 5/29/2009 John C. Polking, Rice University 1 Need for Cryptography Many areas of human endeavor require secret communication. Modern methods of communication

More 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

Specialized Cryptanalytic Machines: Two examples, 60 years apart. Patrick Schaumont ECE Department Virginia Tech

Specialized Cryptanalytic Machines: Two examples, 60 years apart. Patrick Schaumont ECE Department Virginia Tech Specialized Cryptanalytic Machines: Two examples, 60 years apart Patrick Schaumont ECE Department Virginia Tech What is cryptanalysis? Cryptography aims to defeat cryptanalysis Cryptanalysis aims to defeat

More information

NOI 2009 Solutions to Contest Tasks

NOI 2009 Solutions to Contest Tasks NOI 2009 Solutions to Contest Tasks Martin Henz March 14, 2009 Martin Henz NOI 2009 Solutions to Contest Tasks 1 The Scientific Committee of NOI 2009 Ben Leong Chang Ee-Chien Colin Tan Frank Stephan Martin

More information

Dan Boneh. Introduction. Course Overview

Dan Boneh. Introduction. Course Overview Online Cryptography Course Introduction Course Overview Welcome Course objectives: Learn how crypto primitives work Learn how to use them correctly and reason about security My recommendations: Take notes

More 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

Historical cryptography

Historical cryptography Historical cryptography CSCI 470: Web Science Keith Vertanen Copyright 2013 Overview Historical cryptography Monoalphabetic substitution ciphers Breaking them Some improvements The cipher of Mary Queen

More information

Enigma machine and cryptography. by Chris Davis

Enigma machine and cryptography. by Chris Davis Enigma machine and cryptography by Chris Davis Greeks rearranging words Hello world -> ehlol owrdl Caesar Cipher Hello Charlie qmttw Kpiztqm 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

More information

Introduction to Cryptographic Engineering. Steven M. Bellovin

Introduction to Cryptographic Engineering. Steven M. Bellovin Introduction to Cryptographic Engineering Steven M. Bellovin https://www.cs.columbia.edu/~smb 1 Cryptographic Engineering? There are lots of introductions to encryption But using encryption in the real

More 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

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

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

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 Two Time Pad Encryption System

The Two Time Pad Encryption System Hardware Random Number Generators This document describe the use and function of a one-time-pad style encryption system for field and educational use. You may download sheets free from www.randomserver.dyndns.org/client/random.php

More 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

Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering. Apr Cryptography Slide 1

Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering. Apr Cryptography Slide 1 Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering Apr. 2007 Cryptography Slide 1 About This Presentation This presentation belongs to the lecture series

More information

Pre- Calculus CP 1 Section 8.5 Matrix Application: Cryptography

Pre- Calculus CP 1 Section 8.5 Matrix Application: Cryptography Name: Matrix operations, inverses, and determinants have several applications including performing a geometric transformation, solving a system, organizing data, and finding the area of a triangle. In

More information

My brief introduction to cryptography

My brief introduction to cryptography My brief introduction to cryptography David Thomson dthomson@math.carleton.ca Carleton University September 7, 2013 introduction to cryptography September 7, 2013 1 / 28 Outline 1 The general framework

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

Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering. Apr Cryptography Slide 1

Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering. Apr Cryptography Slide 1 Cryptography A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering Apr. 2016 Cryptography Slide 1 About This Presentation This presentation belongs to the lecture series

More 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

Historical cryptography. cryptography encryption main applications: military and diplomacy

Historical cryptography. cryptography encryption main applications: military and diplomacy Historical cryptography cryptography encryption main applications: military and diplomacy ancient times world war II Historical cryptography All historical cryptosystems badly broken! No clear understanding

More 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

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

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

ENEE 457: Computer Systems Security 09/19/16. Lecture 6 Message Authentication Codes and Hash Functions

ENEE 457: Computer Systems Security 09/19/16. Lecture 6 Message Authentication Codes and Hash Functions ENEE 457: Computer Systems Security 09/19/16 Lecture 6 Message Authentication Codes and Hash Functions Charalampos (Babis) Papamanthou Department of Electrical and Computer Engineering University of Maryland,

More information

Mathematics: Modeling Our World Unit 2: SECRET CODES SUPPLEMENTAL ACTIVITY THE GOLD BUG S2.1

Mathematics: Modeling Our World Unit 2: SECRET CODES SUPPLEMENTAL ACTIVITY THE GOLD BUG S2.1 Mathematics: Modeling Our World Unit 2: SECRET CODES SUPPLEMENTAL ACTIVITY THE GOLD BUG S2.1 In The Gold Bug by Edgar Allan Poe, the character William Legrand stumbles across what appears to be a coded

More 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

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

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

Enigma Marian Rejewski, Jerzy Róz ycki, Henryk Zygalski

Enigma Marian Rejewski, Jerzy Róz ycki, Henryk Zygalski 1 Enigma Marian Rejewski, Jerzy Róz ycki, Henryk Zygalski What is the problem with classical cryptography? Secret key cryptography Requires secure channel for key distribution In principle every

More information

Clock Arithmetic and Euclid s Algorithm

Clock Arithmetic and Euclid s Algorithm Clock Arithmetic and Euclid s Algorithm Lecture notes for Access 2008 by Erin Chamberlain. Earlier we discussed Caesar Shifts and other substitution ciphers, and we saw how easy it was to break these ciphers

More 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

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

CSE 105 Theory of Computation

CSE 105 Theory of Computation CSE 105 Theory of Computation http://www.jflap.org/jflaptmp/ Professor Jeanne Ferrante 1 Today s Agenda Quick Review of CFG s and PDA s Introduction to Turing Machines and their Languages Reminders and

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

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

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

CRYPTOGRAPHY AND LARGE PRIMES *

CRYPTOGRAPHY AND LARGE PRIMES * CRYPTOGRAPHY AND LARGE PRIMES * B. Hartley University of Manchester, England, and National University of Singapore The word "cryptography" derives from Greek and means "secret writing". Since ancient times,

More information

On the Legacy of Quantum Computation and Communication to Cryptography

On the Legacy of Quantum Computation and Communication to Cryptography On the Legacy of Quantum Computation and Communication to Cryptography 1 X. Li, L. Leung, A. Kwan, X. Zhang, D. Kahanda, K. Tang, and M. Anshel Department of Computer Science, Graduate Center of The City

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

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

U.C. Berkeley CS276: Cryptography Luca Trevisan February 5, Notes for Lecture 6

U.C. Berkeley CS276: Cryptography Luca Trevisan February 5, Notes for Lecture 6 U.C. Berkeley CS276: Cryptography Handout N6 Luca Trevisan February 5, 2009 Notes for Lecture 6 Scribed by Ian Haken, posted February 8, 2009 Summary The encryption scheme we saw last time, based on pseudorandom

More information

QUANTUM CRYPTOGRAPHY. BCS, Plymouth University, December 1, Professor Kurt Langfeld Centre for Mathematical Sciences, Plymouth University

QUANTUM CRYPTOGRAPHY. BCS, Plymouth University, December 1, Professor Kurt Langfeld Centre for Mathematical Sciences, Plymouth University QUANTUM CRYPTOGRAPHY BCS, Plymouth University, December 1, 2015 Professor Kurt Langfeld Centre for Mathematical Sciences, Plymouth University OUTLOOK: Quantum Physics Essentials: particles and light are

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

18733: Applied Cryptography Anupam Datta (CMU) Course Overview

18733: Applied Cryptography Anupam Datta (CMU) Course Overview 18733: Applied Cryptography Anupam Datta (CMU) Course Overview Logistics Introductions Instructor: Anupam Datta Office hours: SV Bldg 23, #208 + Google Hangout (id: danupam) Office hours: Mon 1:30-2:30

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

RSA RSA public key cryptosystem

RSA RSA public key cryptosystem RSA 1 RSA As we have seen, the security of most cipher systems rests on the users keeping secret a special key, for anyone possessing the key can encrypt and/or decrypt the messages sent between them.

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

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

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

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

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

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

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

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

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

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

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

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

Ping Pong Protocol & Auto-compensation

Ping Pong Protocol & Auto-compensation Ping Pong Protocol & Auto-compensation Adam de la Zerda For QIP seminar Spring 2004 02.06.04 Outline Introduction to QKD protocols + motivation Ping-Pong protocol Security Analysis for Ping-Pong Protocol

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

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

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

1 Indistinguishability for multiple encryptions

1 Indistinguishability for multiple encryptions CSCI 5440: Cryptography Lecture 3 The Chinese University of Hong Kong 26 September 2012 1 Indistinguishability for multiple encryptions We now have a reasonable encryption scheme, which we proved is message

More information

Please Note. These pdf slides are configured for viewing on a computer screen.

Please Note. These pdf slides are configured for viewing on a computer screen. Please Note These pdf slides are configured for viewing on a computer screen. Viewing them on hand-held devices may be difficult as they require a slideshow mode. Do not try to print them out as there

More information

Introduction to Cryptography k. Lecture 5. Benny Pinkas k. Requirements. Data Integrity, Message Authentication

Introduction to Cryptography k. Lecture 5. Benny Pinkas k. Requirements. Data Integrity, Message Authentication Common Usage of MACs for message authentication Introduction to Cryptography k Alice α m, MAC k (m) Isα= MAC k (m)? Bob k Lecture 5 Benny Pinkas k Alice m, MAC k (m) m,α Got you! α MAC k (m )! Bob k Eve

More information

Lattice Reduction Attack on the Knapsack

Lattice Reduction Attack on the Knapsack Lattice Reduction Attack on the Knapsack Mark Stamp 1 Merkle Hellman Knapsack Every private in the French army carries a Field Marshal wand in his knapsack. Napoleon Bonaparte The Merkle Hellman knapsack

More information

Modern symmetric-key Encryption

Modern symmetric-key Encryption Modern symmetric-key Encryption Citation I would like to thank Claude Crepeau for allowing me to use his slide from his crypto course to mount my course. Some of these slides are taken directly from his

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

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

Computational and Statistical Learning Theory

Computational and Statistical Learning Theory Computational and Statistical Learning Theory TTIC 31120 Prof. Nati Srebro Lecture 6: Computational Complexity of Learning Proper vs Improper Learning Efficient PAC Learning Definition: A family H n of

More information

Definition: For a positive integer n, if 0<a<n and gcd(a,n)=1, a is relatively prime to n. Ahmet Burak Can Hacettepe University

Definition: For a positive integer n, if 0<a<n and gcd(a,n)=1, a is relatively prime to n. Ahmet Burak Can Hacettepe University Number Theory, Public Key Cryptography, RSA Ahmet Burak Can Hacettepe University abc@hacettepe.edu.tr The Euler Phi Function For a positive integer n, if 0

More information

Chapter 7: Signature Schemes. COMP Lih-Yuan Deng

Chapter 7: Signature Schemes. COMP Lih-Yuan Deng Chapter 7: Signature Schemes COMP 7120-8120 Lih-Yuan Deng lihdeng@memphis.edu Overview Introduction Security requirements for signature schemes ElGamal signature scheme Variants of ElGamal signature scheme

More information

Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )

Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. ) Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson

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 Takeaway: Crypto is Hard Designing crypto is hard, even experts get it wrong Just because I don t know

More information

5199/IOC5063 Theory of Cryptology, 2014 Fall

5199/IOC5063 Theory of Cryptology, 2014 Fall 5199/IOC5063 Theory of Cryptology, 2014 Fall Homework 2 Reference Solution 1. This is about the RSA common modulus problem. Consider that two users A and B use the same modulus n = 146171 for the RSA encryption.

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

CSA E0 235: Cryptography March 16, (Extra) Lecture 3

CSA E0 235: Cryptography March 16, (Extra) Lecture 3 CSA E0 235: Cryptography March 16, 2015 Instructor: Arpita Patra (Extra) Lecture 3 Submitted by: Ajith S 1 Chosen Plaintext Attack A chosen-plaintext attack (CPA) is an attack model for cryptanalysis which

More 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

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

CPSC 91 Computer Security Fall Computer Security. Assignment #3 Solutions

CPSC 91 Computer Security Fall Computer Security. Assignment #3 Solutions CPSC 91 Computer Security Assignment #3 Solutions 1. Show that breaking the semantic security of a scheme reduces to recovering the message. Solution: Suppose that A O( ) is a message recovery adversary

More information

VIDEO Intypedia008en LESSON 8: SECRET SHARING PROTOCOL. AUTHOR: Luis Hernández Encinas. Spanish Scientific Research Council in Madrid, Spain

VIDEO Intypedia008en LESSON 8: SECRET SHARING PROTOCOL. AUTHOR: Luis Hernández Encinas. Spanish Scientific Research Council in Madrid, Spain VIDEO Intypedia008en LESSON 8: SECRET SHARING PROTOCOL AUTHOR: Luis Hernández Encinas Spanish Scientific Research Council in Madrid, Spain Hello and welcome to Intypedia. We have learned many things about

More information

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

Alan Turing and the Foundations of Computer Science

Alan Turing and the Foundations of Computer Science Alan Turing and the Foundations of Computer Science Waseda University, SILS, History of Mathematics Outline Introduction Hilbert s Program Foundations and Crisis Alan Turing and the Decidability Problem

More information

Public-key Cryptography and elliptic curves

Public-key Cryptography and elliptic curves Public-key Cryptography and elliptic curves Dan Nichols University of Massachusetts Amherst nichols@math.umass.edu WINRS Research Symposium Brown University March 4, 2017 Cryptography basics Cryptography

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

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

LECTURE NOTES ON Quantum Cryptography

LECTURE NOTES ON Quantum Cryptography Department of Software The University of Babylon LECTURE NOTES ON Quantum Cryptography By Dr. Samaher Hussein Ali College of Information Technology, University of Babylon, Iraq Samaher@itnet.uobabylon.edu.iq

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

First-Order DPA Attack Against AES in Counter Mode w/ Unknown Counter. DPA Attack, typical structure

First-Order DPA Attack Against AES in Counter Mode w/ Unknown Counter. DPA Attack, typical structure Josh Jaffe CHES 2007 Cryptography Research, Inc. www.cryptography.com 575 Market St., 21 st Floor, San Francisco, CA 94105 1998-2007 Cryptography Research, Inc. Protected under issued and/or pending US

More information