Governor’s School for the Sciences Mathematics Day 5.

Slides:



Advertisements
Similar presentations
Diffie-Hellman Diffie-Hellman is a public key distribution scheme First public-key type scheme, proposed in 1976.
Advertisements

Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
Chapter 4 Systems of Linear Equations; Matrices
Computer Science 101 Data Encryption And Computer Networks.
Digital Signatures. Anononymity and the Internet.
Section 3.8: More Modular Arithmetic and Public-Key Cryptography
 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.
What is Elliptic Curve Cryptography?
Race Car Integers October 18, Race Car Rules / Positive numbers mean “forward” / Negative numbers mean “reverse” / Add means “keep going” / Subtract.
An Introduction to Cryptography TEA fellows February 9, 2012 Dr. Kristen Abernathy.
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.
CC3.12 Erdal KOSE Privacy & Digital Security Encryption.
ENGG2013 Unit 10 n  n determinant and an application to cryptography Feb, 2011.
Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.
1 Introduction to Codes, Ciphers, and Cryptography Michael A. Karls Ball State University.
Cryptography Week-6.
Section 3.6: An Introduction to Cryptography
A Cryptography Education Tool Anna Yu Department of Computer Science College of Engineering North Carolina A&T State University June 18, 2009.
Section 2.2: Affine Ciphers; More Modular Arithmetic Practice HW (not to hand in) From Barr Textbook p. 80 # 2a, 3e, 3f, 4, 5a, 7, 8 9, 10 (Use affinecipherbreaker.
Welcome back! It’s spring…or supposed to be MAT199: Math Alive Cryptography Ian Griffiths Mathematical Institute, University of Oxford, Department of.
MAT 1000 Mathematics in Today's World Winter 2015.
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.
Systems of Equations as Matrices and Hill Cipher.
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15.
What you will learn 1. What an identity matrix is
CRYPTOGRAPHY AND THE MATH MAJOR Dr. Mihai Caragiu Mathematics Department Ohio Northern University.
Operations with Positive Fractions
Cryptography Dave Feinberg. Suppose I send an from to Who has access to that ? What if I want the.
 Why the course?  Introduction to Number Theory  The make-up of the seminar  Interdisciplinary collaboration 1.
1 Simple and Unbreakable: The Mathematics of Internet Security Dr. Monica Nevins Department of Mathematics and Statistics University of Ottawa University.
CSCI 391: Practical Cryptology Substitution Monoalphabetic Ciphers.
Algebra II Honors Properties Review Chapter 1. We will solve 2x + 4 = 6x – 12 Showing all of the properties used So Let’s go!
Rules for Fractions Addition, Subtraction, Multiplication and Division.
Section 2.2: Affine Ciphers; More Modular Arithmetic Shift ciphers use an additive key. To increase security, we can add a multiplicative parameter. –For.
MAT 1000 Mathematics in Today's World Winter 2015.
Learning Objectives for Section 4.5 Inverse of a Square Matrix
Why don’t I get these, “Properties of Integers” Associative for Addition Associative for Multiplication Commutative for Addition Commutative for Multiplication.
Unit 2 Modular Arithmetic and Cryptography IT Disicipline ITD1111 Discrete Mathematics & Statistics STDTLP 1 Unit 2 Modular Arithmetic and Cryptography.
An Introduction to Cryptology
Cryptography Cryptography is the use of mathematics to encode messages and prevent them from being read by anyone who doesn’t know the code. One way that.
Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.
Future Middle School Teachers Janet Beissinger and Bonnie Saunders University of Illinois at Chicago
Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim
CRYPTOGRAPHY Cryptography is art or science of transforming intelligible message to unintelligible and again transforming that message back to the original.
CRCT Domain Review Numbers and Operations. Key Vocabulary  Rational Numbers  Any number that can be made by dividing one integer by another. The word.
Adding, Subtracting, Multiplying and Dividing Fractions
Binary 1 Basic conversions.
Encryption.
Affine Cipher.
THE DISTRIBUTIVE PROPERTY
Warm-up 1. Find A-1 , A = 2. Solve AX = B when B =
Prepared by: Sameer Ali Aljaroodi, Tutor: Mr. Ahmad Kananh
Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Solving Two- Step Equations
Applications of Inverse Matrices
National Cipher Challenge
Day 5 Objective: I can multiply fractions and mixed numbers.
Commutative Property Associative Property A. Addition
Simple Encryption- Lesson 5
National Cipher Challenge
Commutative Property Associative Property A. Addition
Decode the message: (1, -5) (-5, -3) (5, -5) (-2, -3) (4, 5) (1, 3) (4, 5) (1, -3) (-4, 4) (3, 2) (-5, -3) (5,-5) Write your own message!
Rational numbers Mixed
Presentation transcript:

Governor’s School for the Sciences Mathematics Day 5

MOTD: Carl Friedrich Gauss (Germany) Genius, worked in many areas of math and physics

Question: Suppose you have a box of valuable stuff you want to send to a friend You and your friend each has a lock and several keys You have to use an untrustworthy messenger service to exchange the box How can you send the contents of your box safely to your friend?

Writing Secret Messages Transform a text message for safe transmission Must have simple rule for encoding and decoding Should be tough to break, eg. by mixing up the letter distribution

Substitution Cipher Make a rule or table giving the replacement for each letter Must be 1-1; thus reversable Doesn’t change the letter distribution Simple rules: additive and multiplicative ciphers

Additive (Shift) Cipher Pick a number P from 1-25 For each letter in the message shift it forward by P letters wrapping around from Z back to A P = 7: A -> H, L -> S, T -> A, Z -> G ILOVEMATH -> PSVCLTHAO Decode by moving backward by P letters or forward by 26-P letters

Cipher Wheel

Modular (Clock) Arithmetic Let S ={0, 1, 2, …, 25} For any number n there is a number r in S and an integer m such that n = 26*m + r We write n = r (mod 26) 32 = 6 (mod 26), -12 = 14 (mod 26) For x,y in S define x + y to be (x+y) (mod 26) x * y to be (x*y) (mod 26) = 1, 13*2 = 0, 4*7 = 2, 3 3 = 1 (Almost) All the rules of arithmetic still work

Additive Cipher II Convert each letter to its position in the alphabet, A->0, B->1, …, Z -> 25 Given shift P use modular arithmetic and add P to each value Convert back to text using the same scheme as above To decode, use –P (or 26-P) as the shift

Example Message: GSS ROCKS Convert: 6,18,18,17,14,2,10,18 Add 11: 17,3,3,2,25,13,21,3 Convert: RDDCZNVD Secret Message: RDDCZ NVD To decode, add 15 (or subtract 11)

Multiplicative Cipher Just like additive, but you multiply by the factor P To decode need Q = P -1, Q*P = 1 Determine Q by trial and error, some P don’t have inverses 5*21 = 105 = 1 (mod 26), 7*15 = 1 All the even numbers and 13 don’t have inverses

Example Message: GSS ROCKS Convert: 6,18,18,17,14,2,10,18 Multiply by 5: 4,12,12,7,18,10,24,12 Convert: EMMHS KYM To decode, multiply by 21

Quiz Bowl Time  vs. Dr. Collins Team 3 vs. Denominators of Doom