Substitution Codes By Sarah Bonnell.

Slides:



Advertisements
Similar presentations
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Advertisements

 Caesar used to encrypt his messages using a very simple algorithm, which could be easily decrypted if you know the key.  He would take each letter.
Solving Word Problems. “Word Problems scare me!”
DPEFT, DJQIFST boe TFDSFU XSJUJOH.. If for each letter, you instead write the letter before it in the alphabet, you will discover what we are doing this.
Creating Secret Messages. 2 Why do we need to keep things secret? Historically, secret messages were used in wars and battles For example, the Enigma.
Polyalphabetic Substitution Ciphers. First Steps Towards Complexity  If one alphabet is good, then two alphabets must be better!  By doubling the number.
Section 2.1: Shift Ciphers and Modular Arithmetic The purpose of this section is to learn about modular arithmetic, which is one of the fundamental mathematical.
The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Encryption: A Brief History Author: Margery Waldron.
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
Categories of Ciphers Substitution ciphers - replace letters in the plaintext with other letters or symbols, keeping the order in which the symbols fall.
Produced in conjunction with Tom Briggs, Education and Outreach Officer at Bletchley Park.
Objectives – The Student will: 1.Name and explain the steps in the problem- solving process. 2.Solve a problem by applying the problem-solving process.
Melissa Rickman St Brigid’s College, Lesmurdie Year Three.
Sight Words.
Question 7 Looking back at your preliminary task, what do you feel that you have learnt in the progression from it to the full product? BY PHOEBE FARRINGTON.
Lecture 3 Page 1 CS 236 Online Basic Encryption Methods Substitutions –Monoalphabetic –Polyalphabetic Permutations.
Code Making/Breaking. What methods have you seen for encoding secret messages?
Week 3. Day 1 – Meet the Word Part “Divide and Conquer” Day 1.
1)Glue Standards for Unit 4 onto page 91 2) Page 93 Make the following table on the WHOLE sheet of paper :
AP CSP: Sending Binary Messages
Codename: ULTRA Can your mathematical skills save the United Kingdom from defeat and invasion?
Encryption with Keys and Passwords
The problem you have samples for has been edited to reduce the amount of reading for the students. We gave the original late in the year. As we were working.
JavaScript/ App Lab Programming:
Egyptian Writing Hieroglyphics.
Modular Arithmetic with Applications to Cryptography
ENCODING AND SENDING FORMATTED TEXT
Introduction To Cryptography
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
You will use these two a lot. Make sure you know them.
Forensic Science Questioned Documents: Part 3
What are Computers? G Use this tutorial alongside the numbers coded in your workbook and answer the related questions in each section.
Core Focus on Linear Equations
Identifying Equivalent Expressions
UNIT 3 – LESSON 5 Creating Functions.
Basic Encryption Methods
Networks Encryption.
Lesson 4-5 AP Computer Science Principles
Evaluation By Donna Clapp.
In this lesson we will understand:
Lesson 5: Simple Encryption
Adding and Subtracting Equations
History of Cryptography
Enigma Machine.
Pigpen Cipher A = Q = T = Z = A B C D E F G H I J K L M N O P Q R S T
Rome Becomes an Empire.
Codename: ULTRA Can your mathematical skills save the United Kingdom from defeat and invasion?
Pigpen Cipher A = Q = T = Z = A B C D E F G H I J K L M N O P Q R S T
WE ALL NEED…….
Encryption and Decryption
Solving Word Problems.
LO: Use logic and frequency analysis to read and write in code.
Cryptography “The Secret Code Language”
National Cipher Challenge
Computational Thinking for KS3
Simple Encryption- Lesson 5
Cryptography Cryptography is derived from the Green word ‘kryptos’
Encryption with Keys and Passwords
Half Term 1 Please type your name here:.
Lesson 7: Simple Encryption
The of and to in is you that it he for was.
Cryptography: Cesar Cipher
Reading Math to Promote Fluency and Recall
What have you learned from your audience feedback?
20 Days of Number Sense & Rich Math Talk #20DaysNS Steve Wyborney
Bell Ringer August 20, 2014 On a clean sheet of paper in the writing section of your binder, write the heading above. Then, take a few minutes to examine.
Modern Cryptography.
Presentation transcript:

Substitution Codes By Sarah Bonnell

History of Codes Throughout history, codes have been used to hide or keep messages secret. There are many different types of codes that have been invented and used, although lots have been broken after a while. A famous type of code that was used and eventually broken, was the ENIGMA CODE used by the German army during the Second World War. An Enigma Machine, used to generate this code, can be seen on the next slide.

This is an Enigma Machine This is an Enigma Machine. It generates codes by substituting each letter typed for another. However, the code is made harder to break as the same letter can be substituted to any random letter, unless the machine is used in the same setting as when the message was first typed. For example, A could come out as C the first time, and F the second.

The code can only be broken when the right size stick is used Other Types of Codes Not all codes are substitution codes. Codes can be broken by using objects, like the Spartans did 2500 years ago. A long strip of any material was used to wrap around a piece of wood. A message was written, that could only be decoded by using exactly the same size wood. This code was good, but it was eventually broken. One example is shown below: The code can only be broken when the right size stick is used There are many other types of codes that have been used throughout history, and for many different purposes.

The Problem The Problem we were given was a substitution code, whereby we had a number of symbols which substituted for each letter in the alphabet. The problem was, we didn’t know what symbol corresponded to what letter.

Our Method When we saw the problem we were given, we decided to try and see if it was written in Wingdings, a coded font. We typed out the Wingdings alphabet (left) and realised that the symbols matched up. We deciphered the message, which you can see on the next slide. a b c d e f g A b c d e f g h i j k l m n h I j k l m n o p q r s o p q r s t u v w x y z t u v w x y z

The Solution The message we deciphered was: The Substitution Cipher was originated by Julius Caesar, so it is said. Julius Caesar was born in 100 BC, and was Emperor of the Roma Empire. He invaded France in about 55 BC, and used a lot of codes to communicate with his generals. The Caeser Cipher was the first substitution cipher to be used for military purposes.

More Methods Although it was easier for us to break the code because we knew where to find the answer, we decided to try to use the symbols as clues to breaking the code. When we first broke the words “Julius Ceaser,” we could easily see the symbol order of this name and see if it came up any more in the symbolized text. As you could see from the solution slide, it did. Also, looking for symbols that occurred frequently in the text, gave us a clue to what they might be. For example, a symbol that appears on its own in a sentence is either an ‘a’ or an ‘I.’ Also, the numbers were not substituted, which helped us to recognize the symbols behind them could either have been : “AD” or “BC.”

Code breaking is cool!

This seems interesting. Our Second step We became more interested and decided to look at other challenges; Brailer and Guesswork we found very easy. Then we came across the Knapsack challenge and found this an interesting challenge . Here is what we came up with. This seems interesting.

How did we solve the knapsack challenge? Once we all went through the challenge on our own, we discussed what the best and easiest way would be to decode the message. One member from our group suggested the best way would be for some of us to sit around the computer solving the first half while the others were writing the solution on paper. We had the following numbers to decode: 33,18, 20, 1, 31, 20, 30, 31. We first worked out each number using the sticks which meant we had to see what sticks add up to make the number. 1cm 3cm 5cm 10cm 20cm

The solutions So using the stick 1, 3 , 5, 10 and 20, we thought that we should use 3, 10 and 20 to make 33 so our binary code is 01011 because we didn’t use 1or 5 which meant we had to use 0 to replace them with their number. We got the number 1 because we used the sticks 3, 10 and 20 once. 01011 represents k in the chart we was given. ( shown on the next page). So went on using the same the method through out task one and ended up with KNAPSACK.

LOOK UP TABLE TO DECODE THE MESSAGE. Letter Binary Reference a 00001 n 01110 b 00010 o 01111 c 00011 p 10000 d 00100 q 10001 e 00101 r 10010 f 00110 s 10011 g 00111 t 10100 h 01000 u 10101 i 01001 v 10110 j 01010 w 10111 k 01011 x 11000 l 01100 y 11001 m 01101 z 11010

This is how we decoded the messages: PROBLEM 2 The next problem was using the same method to decode the message but there was more than one solution. The sticks we were given were 1, 2, 3, 4,5. The numbers we had to decode were 1, 5, 14 ,4 ,5, 8, 10, 5, 4 ,7,9. The challenge was that there was more than one answer which meant that some numbers had two different ways of adding the sticks. Like for example; 2+3=5 and so does 4+1=5 so this meant that there was more than one binary code. So we all thought how the best way to work out the problem was and some of us decoded the message and some of us wrote all the different ways the solution will be. This is how we decoded the messages:

Method of working out the solution: To decode the number 1 the binary code was:10000 which is P. To decode 5 the binary code is either 10010 or 01100 which is either R or L. To decode 14 the binary code is: 01111 which is O. To decode 4 the binary code is either: 10100 or 00010 which is either T or B. As you may have realized we went on using the same technique and ended up with many possibilities some of them didn’t make sense but the solution looked like the word PROBLEM. Next we had to find the ending meaning what ending fitted in with problem this was really confusing at first but we soon realized that some endings did not make sense like: RTI, RBI , ABIU. It took us quite some time on the ending and we fitted each ending with problem and the answer was:PROBLEMATIC which made sense to us. Method of working out the solution:

Can you explain why super increasing series are so much easier to decode? Super increasing series are easier to decode because there are many different possibilities to make a word. We as a group found knapsack very challenging especially problem 2 but we found it really interesting to do. The most difficult part was to find which one made sense and that was the method. While solving this KNAPSACK we really enjoying the task it took us a lot of time but we enjoyed each and every minute of the problem.

Can You Work Out Our Code? – – – · – – · – – · – · · · – – – – – · – – – · – – · · · – – · · – · – · · – – · · · · · – – · · – – – · – – · · · – · · · – – – – –