A Taste of Pi: Clocks, Set, and the Secret Math of Spies
|
|
|
- Hubert Garrett
- 6 years ago
- Views:
Transcription
1 A Taste of Pi: Clocks, Set, and the Secret Math of Spies Katherine E. Stange SFU / PIMS-UBC October 16, 2010
2 The Math of Clocks Here is a picture of a clock.
3 The Math of Clocks Here is a picture of a clock. 3 pm
4 The Math of Clocks Here is a picture of a clock. 3 pm + 2 hours =
5 The Math of Clocks Here is a picture of a clock. 3 pm + 2 hours = 5 pm
6 The Math of Clocks Here is a picture of a clock. 3 pm + 2 hours = 5 pm mod 12
7 The Math of Clocks Here is a picture of a clock. 3 pm + 2 hours = 5 pm 2 pm +11 hours = mod 12
8 The Math of Clocks Here is a picture of a clock. 3 pm + 2 hours = 5 pm mod 12 2 pm +11 hours = 1 am
9 The Math of Clocks Here is a picture of a clock. 3 pm + 2 hours = 5 pm mod 12 2 pm +11 hours = 1 am mod 12
10 The Math of Clocks It s a little like rolling up a long line of the integers into a circle:
11 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours.
12 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours =
13 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours = 6 o clock
14 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours = 6 o clock mod 7
15 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours = 6 o clock 1 o clock 24 hours = mod 7
16 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours = 6 o clock mod 7 1 o clock 24 hours = 5 o clock
17 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours = 6 o clock mod 7 1 o clock 24 hours = 5 o clock mod 7
18 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours = 6 o clock mod 7 1 o clock 24 hours = 5 o clock mod 7 2 o clock 4 =
19 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours = 6 o clock mod 7 1 o clock 24 hours = 5 o clock mod 7 2 o clock 4 = 1 o clock
20 The Math of Clocks We could have a clock with any number of hours on it. Here is a picture of a clock with 7 hours. 2 o clock +11 hours = 6 o clock mod 7 1 o clock 24 hours = 5 o clock mod 7 2 o clock 4 = 1 o clock mod 7 We could label these with days of the week...
21 The Math of Clocks We call the N-hour clock Z N, and it has N elements: Z N = {0, 1, 2, 3,..., N 1} We can add, subtract and multiply elements of Z N (and get back elements of Z N ).
22 The Math of Clocks The math of clocks is called Modular Arithmetic and N is called the modulus. Two numbers A and B are the same modulo N if A and B differ by adding N some number of times.
23 The Math of Clocks The math of clocks is called Modular Arithmetic and N is called the modulus. Two numbers A and B are the same modulo N if A and B differ by adding N some number of times. We could say that a hamburger and a cheeseburger are the same modulo cheese.
24 The Math of Clocks The math of clocks is called Modular Arithmetic and N is called the modulus. Two numbers A and B are the same modulo N if A and B differ by adding N some number of times. We could say that a hamburger and a cheeseburger are the same modulo cheese. Some people say Gauss invented modular arithmetic, but humans have used it as long as we ve had... clocks weeks gears money... It s the beginning of the study of Number Theory.
25 The Math of Clocks Let the festivities begin!
26 The Math of Clocks - Multiplication Tables Z Z
27 The Math of Clocks - Multiplication Tables Z Z
28 The Math of Clocks - Multiplication Tables Z
29 The Math of Clocks - Multiplication Tables Z
30 The Math of Clocks - Multiplication Tables Z
31 The Math of Clocks - Multiplication Tables Z
32 The Math of Clocks - Multiplication Tables Z
33 The Math of Clocks
34 The Math of Clocks 1. When N is a prime number, then you can divide in Z N.
35 The Math of Clocks 1. When N is a prime number, then you can divide in Z N. 2. This makes Z N a really great number system: it has +,, and.
36 The Math of Clocks 1. When N is a prime number, then you can divide in Z N. 2. This makes Z N a really great number system: it has +,, and. 3. It s even better than the integers (there s no 1/2 in the integers!).
37 The Math of Set The graph of the line y = x + 2 in Z 5 : 2 X 1 X 0 X 4 X 3 X
38 The Math of Set The graph of the line y = x + 2 in Z 5 : 2 X 1 X 0 X 4 X 3 X The graph is a little like Asteroids!
39 The Math of Set The graph of the line y = 3x + 4 in Z 5 : 2 X 1 X 0 X 4 X 3 X
40 The Math of Set
41 The Math of Set Set images due to Diane Maclagan and Ben Davis
42 The Math of Set
43 Here s the graph of y 2 = x 3 3x + 6 in the usual world (real numbers):
44 Adding two points to get another: P + Q + R = O.
45 Adding a point and its negative: P + Q + Q = O.
46 Adding a point and its negative: P + P = O.
47 A point which adds with itself to zero: P + P = O.
48 The graph of y 2 = x 3 + 2x + 1 in Z 5 : 2 X X 1 X 0 4 X 3 X X This is called an Elliptic Curve
49 Here s an elliptic curve in Z
50 2 A C 1 B 0 4 -B 3 -A -C
51 2 A C 1 X B 0 X 4 -B 3 -A -C
52 2 A C 1 X B 0 X 4 -B 3 -A -C A + B + C = 0
53 2 A C 1 X B 0 X 4 -B 3 -A -C A + B + C = 0 A + B = C
54 2 A C 1 B 0 4 -B 3 -A -C
55 2 A C 1 B X 0 X 4 -B 3 -A X -C
56 2 A C 1 B X 0 X 4 -B 3 -A X -C A + A + B = 0
57 2 A C 1 B X 0 X 4 -B 3 -A X -C A + A + B = 0 A + A = B
58 2 A C 1 2A 0 4-2A 3 -A -C A + A + B = 0 A + A = B So B = 2A
59 2 A C 1 2A 0 4-2A 3 -A -C A + A + B = 0 A + A = B So B = 2A From last slide: C = A + B = A + 2A = 3A
60 2 A 3A 1 2A 0 4-2A 3 -A -3A A + A + B = 0 A + A = B So B = 2A From last slide: C = A + B = A + 2A = 3A So C = 3A
61 2 A 3A 1 2A 0 4 5A 3 6A 4A With a little more work, we find out that 3A = 4A, 2A = 5A and A = 6A, and finally that 7A = O.
62 - Elliptic Curve Addition Table E O A 2A 3A 4A 5A 6A O O A 2A 3A 4A 5A 6A A A 2A 3A 4A 5A 6A O 2A 2A 3A 4A 5A 6A O A 3A 3A 4A 5A 6A O A 2A 4A 4A 5A 6A O A 2A 3A 5A 5A 6A O A 2A 3A 4A 6A 6A O A 2A 3A 4A 5A
63 - Modular Arithmetic Addition Table Z 7 O O
64 Suppose I gave you two numbers, P = 9 and Q = 45 and I said,
65 Suppose I gave you two numbers, P = 9 and Q = 45 and I said, How many times need I add P to itself to get Q?
66 Suppose I gave you two numbers, P = 9 and Q = 45 and I said, How many times need I add P to itself to get Q? You would divide 45 by 9 and get the answer: 5. Division is fairly easy for integers!
67 Suppose I gave you two numbers, P = 9 and Q = 45 and I said, How many times need I add P to itself to get Q? You would divide 45 by 9 and get the answer: 5. Division is fairly easy for integers! It takes more time as the numbers get bigger, but the time it takes grows with the number of digits of the numbers.
68 Suppose I gave you two numbers modulo 5, P = 2 and Q = 3 and I said,
69 Suppose I gave you two numbers modulo 5, P = 2 and Q = 3 and I said, How many times need I add P to itself to get Q?
70 Suppose I gave you two numbers modulo 5, P = 2 and Q = 3 and I said, How many times need I add P to itself to get Q? This is trickier. You could complete a multiplication table and look in it to search for the answer. It turns out there are faster ways.
71 Suppose I gave you two numbers modulo 5, P = 2 and Q = 3 and I said, How many times need I add P to itself to get Q? This is trickier. You could complete a multiplication table and look in it to search for the answer. It turns out there are faster ways. The smartest algorithms (can you come up with one?), are about as fast as division for the integers. The time it takes grows with the number of digits of the modulus.
72 2 P X 1 X 0 4 Q 3 X X Suppose I gave you the points P and Q and I said How many times need I add P to itself to get Q?
73 2 P X 1 X 0 4 Q 3 X X Suppose I gave you the points P and Q and I said How many times need I add P to itself to get Q? You might remember that we found Q = 5P from our multiplication table.
74 2 P X 1 X 0 4 Q 3 X X Suppose I gave you the points P and Q and I said How many times need I add P to itself to get Q? You might remember that we found Q = 5P from our multiplication table. But it was a lot of work! Is there an easy way to do this?
75 No one knows any efficient way to solve this problem!!
76 No one knows any efficient way to solve this problem!! The time taken by good algorithms grows with about the square root of the size of the modulus.
77 Modern cryptography is based on mathematical operations that are easy to do and hard to undo. Example:
78 Modern cryptography is based on mathematical operations that are easy to do and hard to undo. Example: Getting pregnant.
79 Modern cryptography is based on mathematical operations that are easy to do and hard to undo. Example: Getting pregnant. Multiplying numbers is easy, but factoring them is hard.
80 Modern cryptography is based on mathematical operations that are easy to do and hard to undo. Example: Getting pregnant. Multiplying numbers is easy, but factoring them is hard. On an elliptic curve, adding a point P to itself many times is easy. Figuring out how many times it was added (if you weren t watching) is hard. This is the elliptic curve discrete logarithm problem.
81 Alice and Bob want to share a secret.
82 Alice and Bob want to share a secret. A point P on an elliptic curve is general knowledge. Alice Bob
83 Alice and Bob want to share a secret. A point P on an elliptic curve is general knowledge. Alice Bob secret a b
84 Alice and Bob want to share a secret. A point P on an elliptic curve is general knowledge. Alice Bob secret a b public ap bp
85 Alice and Bob want to share a secret. A point P on an elliptic curve is general knowledge. Alice Bob secret a b public ap bp Alice and Bob can both compute abp.
86 Alice and Bob want to share a secret. A point P on an elliptic curve is general knowledge. Alice Bob secret a b public ap bp Alice and Bob can both compute abp. No one else can compute it!
87 Here the size of the modulus N we use for this algorithm in your web browser, when you log onto a secure site: N =
88 The hard problem of factoring is used for cryptography called RSA.
89 The hard problem of factoring is used for cryptography called RSA. The elliptic curve discrete logarithm problem is used for elliptic curve cryptography (ECC).
90 The hard problem of factoring is used for cryptography called RSA. The elliptic curve discrete logarithm problem is used for elliptic curve cryptography (ECC). Together, these two hard problems are used for pretty nearly all the cryptography in the modern world: your bank, your cell phone, your computer.
91 The hard problem of factoring is used for cryptography called RSA. The elliptic curve discrete logarithm problem is used for elliptic curve cryptography (ECC). Together, these two hard problems are used for pretty nearly all the cryptography in the modern world: your bank, your cell phone, your computer. (No one has come up with a security method based on pregnancy.)
92 The hard problem of factoring is used for cryptography called RSA. The elliptic curve discrete logarithm problem is used for elliptic curve cryptography (ECC). Together, these two hard problems are used for pretty nearly all the cryptography in the modern world: your bank, your cell phone, your computer. (No one has come up with a security method based on pregnancy.) If you can come up with a fast algorithm for these hard problems,
93 The hard problem of factoring is used for cryptography called RSA. The elliptic curve discrete logarithm problem is used for elliptic curve cryptography (ECC). Together, these two hard problems are used for pretty nearly all the cryptography in the modern world: your bank, your cell phone, your computer. (No one has come up with a security method based on pregnancy.) If you can come up with a fast algorithm for these hard problems, you would immediately become hugely famous,
94 The hard problem of factoring is used for cryptography called RSA. The elliptic curve discrete logarithm problem is used for elliptic curve cryptography (ECC). Together, these two hard problems are used for pretty nearly all the cryptography in the modern world: your bank, your cell phone, your computer. (No one has come up with a security method based on pregnancy.) If you can come up with a fast algorithm for these hard problems, you would immediately become hugely famous, you would get job offers from every government in the world,
95 The hard problem of factoring is used for cryptography called RSA. The elliptic curve discrete logarithm problem is used for elliptic curve cryptography (ECC). Together, these two hard problems are used for pretty nearly all the cryptography in the modern world: your bank, your cell phone, your computer. (No one has come up with a security method based on pregnancy.) If you can come up with a fast algorithm for these hard problems, you would immediately become hugely famous, you would get job offers from every government in the world, and would get invited on Oprah.
96 Thank you! Thanks to SFU, Veselin Jungic, Malgorzata Dubiel and Nadia Nosrati, and Jonathan Wise. And to you! Feel free to me anytime ( on my website).
8 Elliptic Curve Cryptography
8 Elliptic Curve Cryptography 8.1 Elliptic Curves over a Finite Field For the purposes of cryptography, we want to consider an elliptic curve defined over a finite field F p = Z/pZ for p a prime. Given
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
Number Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
6. ELLIPTIC CURVE CRYPTOGRAPHY (ECC)
6. ELLIPTIC CURVE CRYPTOGRAPHY (ECC) 6.0 Introduction Elliptic curve cryptography (ECC) is the application of elliptic curve in the field of cryptography.basically a form of PKC which applies over the
Q 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today?
2 Mod math Modular arithmetic is the math you do when you talk about time on a clock. For example, if it s 9 o clock right now, then it ll be 1 o clock in 4 hours. Clearly, 9 + 4 1 in general. But on a
Clock Arithmetic. 1. If it is 9 o clock and you get out of school in 4 hours, when do you get out of school?
Clock Arithmetic We are going to learn all about clock addition and the relationship to remainders when you divide numbers. 1 Standard Clock Addition 1. If it is 9 o clock and you get out of school in
Elliptic Nets How To Catch an Elliptic Curve Katherine Stange USC Women in Math Seminar November 7,
Elliptic Nets How To Catch an Elliptic Curve Katherine Stange USC Women in Math Seminar November 7, 2007 http://www.math.brown.edu/~stange/ Part I: Elliptic Curves are Groups Elliptic Curves Frequently,
Cosc 412: Cryptography and complexity Lecture 7 (22/8/2018) Knapsacks and attacks
1 Cosc 412: Cryptography and complexity Lecture 7 (22/8/2018) Knapsacks and attacks Michael Albert michael.albert@cs.otago.ac.nz 2 This week Arithmetic Knapsack cryptosystems Attacks on knapsacks Some
Introduction to Elliptic Curve Cryptography. Anupam Datta
Introduction to Elliptic Curve Cryptography Anupam Datta 18-733 Elliptic Curve Cryptography Public Key Cryptosystem Duality between Elliptic Curve Cryptography and Discrete Log Based Cryptography Groups
The Elliptic Curve in https
The Elliptic Curve in https Marco Streng Universiteit Leiden 25 November 2014 Marco Streng (Universiteit Leiden) The Elliptic Curve in https 25-11-2014 1 The s in https:// HyperText Transfer Protocol
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
Number Theory. Modular Arithmetic
Number Theory The branch of mathematics that is important in IT security especially in cryptography. Deals only in integer numbers and the process can be done in a very fast manner. Modular Arithmetic
Homework 4 for Modular Arithmetic: The RSA Cipher
Homework 4 for Modular Arithmetic: The RSA Cipher Gregory V. Bard April 25, 2018 This is a practice workbook for the RSA cipher. It is not suitable for learning the RSA cipher from scratch. However, there
Security Issues in Cloud Computing Modern Cryptography II Asymmetric Cryptography
Security Issues in Cloud Computing Modern Cryptography II Asymmetric Cryptography Peter Schwabe October 21 and 28, 2011 So far we assumed that Alice and Bob both have some key, which nobody else has. How
MEETING 6 - MODULAR ARITHMETIC AND INTRODUCTORY CRYPTOGRAPHY
MEETING 6 - MODULAR ARITHMETIC AND INTRODUCTORY CRYPTOGRAPHY In this meeting we go through the foundations of modular arithmetic. Before the meeting it is assumed that you have watched the videos and worked
Number Theory & Modern Cryptography
Number Theory & Modern Cryptography Week 12 Stallings: Ch 4, 8, 9, 10 CNT-4403: 2.April.2015 1 Introduction Increasing importance in cryptography Public Key Crypto and Signatures Concern operations on
Public Key Cryptography
Public Key Cryptography Introduction Public Key Cryptography Unlike symmetric key, there is no need for Alice and Bob to share a common secret Alice can convey her public key to Bob in a public communication:
Public-key cryptography and the Discrete-Logarithm Problem. Tanja Lange Technische Universiteit Eindhoven. with some slides by Daniel J.
Public-key cryptography and the Discrete-Logarithm Problem Tanja Lange Technische Universiteit Eindhoven with some slides by Daniel J. Bernstein Cryptography Let s understand what our browsers do. Schoolbook
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
Elliptic Curve Cryptography
Elliptic Curve Cryptography Elliptic Curves An elliptic curve is a cubic equation of the form: y + axy + by = x 3 + cx + dx + e where a, b, c, d and e are real numbers. A special addition operation is
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)?
Encryption: The RSA Public Key Cipher
Encryption: The RSA Public Key Cipher Michael Brockway March 5, 2018 Overview Transport-layer security employs an asymmetric public cryptosystem to allow two parties (usually a client application and a
An Introduction to Elliptic Curve Cryptography
Harald Baier An Introduction to Elliptic Curve Cryptography / Summer term 2013 1/22 An Introduction to Elliptic Curve Cryptography Harald Baier Hochschule Darmstadt, CASED, da/sec Summer term 2013 Harald
basics of security/cryptography
RSA Cryptography basics of security/cryptography Bob encrypts message M into ciphertext C=P(M) using a public key; Bob sends C to Alice Alice decrypts ciphertext back into M using a private key (secret)
Sharing a Secret in Plain Sight. Gregory Quenell
Sharing a Secret in Plain Sight Gregory Quenell 1 The Setting: Alice and Bob want to have a private conversation using email or texting. Alice Bob 2 The Setting: Alice and Bob want to have a private conversation
Numbers. Çetin Kaya Koç Winter / 18
Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2016 1 / 18 Number Systems and Sets We represent the set of integers as Z = {..., 3, 2, 1,0,1,2,3,...} We denote the set of positive integers modulo n as
Review. CS311H: Discrete Mathematics. Number Theory. Computing GCDs. Insight Behind Euclid s Algorithm. Using this Theorem. Euclidian Algorithm
Review CS311H: Discrete Mathematics Number Theory Instructor: Işıl Dillig What does it mean for two ints a, b to be congruent mod m? What is the Division theorem? If a b and a c, does it mean b c? What
COT 3100 Applications of Discrete Structures Dr. Michael P. Frank
University of Florida Dept. of Computer & Information Science & Engineering COT 3100 Applications of Discrete Structures Dr. Michael P. Frank Slides for a Course Based on the Text Discrete Mathematics
Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation
Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate
CS483 Design and Analysis of Algorithms
CS483 Design and Analysis of Algorithms Lectures 2-3 Algorithms with Numbers Instructor: Fei Li lifei@cs.gmu.edu with subject: CS483 Office hours: STII, Room 443, Friday 4:00pm - 6:00pm or by appointments
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
SEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 10-1 Chapter 10 Mathematical Systems 10.1 Groups Definitions A mathematical system consists of a set of elements and at least one binary operation. A
Overview. Background / Context. CSC 580 Cryptography and Computer Security. March 21, 2017
CSC 580 Cryptography and Computer Security Math for Public Key Crypto, RSA, and Diffie-Hellman (Sections 2.4-2.6, 2.8, 9.2, 10.1-10.2) March 21, 2017 Overview Today: Math needed for basic public-key crypto
Modular Arithmetic (Read Sections 4.1 thro 4.4)
Modular Arithmetic (Read Sections 4.1 thro 4.4) Set of all integers Set of positive integers less than m We want to perform arithmetic in Z m Equivalence Classes Say m = 5 Z m ={0,1,2,3,... m 1} EC of
Discrete Mathematics GCD, LCM, RSA Algorithm
Discrete Mathematics GCD, LCM, RSA Algorithm Abdul Hameed http://informationtechnology.pk/pucit abdul.hameed@pucit.edu.pk Lecture 16 Greatest Common Divisor 2 Greatest common divisor The greatest common
CPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 8 February 1, 2012 CPSC 467b, Lecture 8 1/42 Number Theory Needed for RSA Z n : The integers mod n Modular arithmetic GCD Relatively
1 Modular Arithmetic Grade Level/Prerequisites: Time: Materials: Preparation: Objectives: Navajo Nation Math Circle Connection
1 Modular Arithmetic Students will explore a type of arithmetic that results from arranging numbers in circles instead of on a number line. Students make and prove conjectures about patterns relating to
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,
Carmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 8 1 The following are equivalent (TFAE) 2 Inverses 3 More on Multiplicative Inverses 4 Linear Congruence Theorem 2 [LCT2] 5 Fermat
LECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS
LECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS Modular arithmetics that we have discussed in the previous lectures is very useful in Cryptography and Computer Science. Here we discuss several
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
Today. Polynomials. Secret Sharing.
Today. Polynomials. Secret Sharing. A secret! I have a secret! A number from 0 to 10. What is it? Any one of you knows nothing! Any two of you can figure it out! Example Applications: Nuclear launch: need
The RSA public encryption scheme: How I learned to stop worrying and love buying stuff online
The RSA public encryption scheme: How I learned to stop worrying and love buying stuff online Anthony Várilly-Alvarado Rice University Mathematics Leadership Institute, June 2010 Our Goal Today I will
9 Modular Exponentiation and Square-Roots
9 Modular Exponentiation and Square-Roots Modular arithmetic is used in cryptography. In particular, modular exponentiation is the cornerstone of what is called the RSA system. 9. Modular Exponentiation
Arithmétique et Cryptographie Asymétrique
Arithmétique et Cryptographie Asymétrique Laurent Imbert CNRS, LIRMM, Université Montpellier 2 Journée d inauguration groupe Sécurité 23 mars 2010 This talk is about public-key cryptography Why did mathematicians
CPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer 1 Lecture 13 October 16, 2017 (notes revised 10/23/17) 1 Derived from lecture notes by Ewa Syta. CPSC 467, Lecture 13 1/57 Elliptic Curves
Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes wish to work over a
Public Key Cryptography. All secret key algorithms & hash algorithms do the same thing but public key algorithms look very different from each other.
Public Key Cryptography All secret key algorithms & hash algorithms do the same thing but public key algorithms look very different from each other. The thing that is common among all of them is that each
Math 299 Supplement: Modular Arithmetic Nov 8, 2013
Math 299 Supplement: Modular Arithmetic Nov 8, 2013 Numbers modulo n. We have previously seen examples of clock arithmetic, an algebraic system with only finitely many numbers. In this lecture, we make
MATCHING. Match the correct vocabulary word with its definition
Name Algebra I Block UNIT 2 STUDY GUIDE Ms. Metzger MATCHING. Match the correct vocabulary word with its definition 1. Whole Numbers 2. Integers A. A value for a variable that makes an equation true B.
CPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 14 October 23, 2017 CPSC 467, Lecture 14 1/42 Computing in Z n Modular multiplication Modular inverses Extended Euclidean algorithm
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
Modular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
Integers and Division
Integers and Division Notations Z: set of integers N : set of natural numbers R: set of real numbers Z + : set of positive integers Some elements of number theory are needed in: Data structures, Random
CPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 13 March 3, 2013 CPSC 467b, Lecture 13 1/52 Elliptic Curves Basics Elliptic Curve Cryptography CPSC
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 33 The Diffie-Hellman Problem
Math 8 Notes Units 1B: One-Step Equations and Inequalities
Math 8 Notes Units 1B: One-Step Equations and Inequalities Solving Equations Syllabus Objective: (1.10) The student will use order of operations to solve equations in the real number system. Equation a
Number theory (Chapter 4)
EECS 203 Spring 2016 Lecture 10 Page 1 of 8 Number theory (Chapter 4) Review Questions: 1. Does 5 1? Does 1 5? 2. Does (129+63) mod 10 = (129 mod 10)+(63 mod 10)? 3. Does (129+63) mod 10 = ((129 mod 10)+(63
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
Lecture 6: Introducing Complexity
COMP26120: Algorithms and Imperative Programming Lecture 6: Introducing Complexity Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2015 16 You need this book: Make sure you use the up-to-date
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
Topics in Cryptography. Lecture 5: Basic Number Theory
Topics in Cryptography Lecture 5: Basic Number Theory Benny Pinkas page 1 1 Classical symmetric ciphers Alice and Bob share a private key k. System is secure as long as k is secret. Major problem: generating
Elliptic Curve Cryptography
Areas for Discussion Elliptic Curve Cryptography Joseph Spring Department of Computer Science 7COM1027 - Distributed Systems Security Lecture - Elliptic Curves 1 1 Motivation Elliptic Curves Security of
Simple Math: Cryptography
1 Introduction Simple Math: Cryptography This section develops some mathematics before getting to the application. The mathematics that I use involves simple facts from number theory. Number theory is
Mathematics of Public Key Cryptography
Mathematics of Public Key Cryptography Eric Baxter April 12, 2014 Overview Brief review of public-key cryptography Mathematics behind public-key cryptography algorithms What is Public-Key Cryptography?
Mathematics of Cryptography
UNIT - III Mathematics of Cryptography Part III: Primes and Related Congruence Equations 1 Objectives To introduce prime numbers and their applications in cryptography. To discuss some primality test algorithms
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
Cryptography and RSA. Group (1854, Cayley) Upcoming Interview? Outline. Commutative or Abelian Groups
Great Theoretical Ideas in CS V. Adamchik CS 15-251 Upcoming Interview? Lecture 24 Carnegie Mellon University Cryptography and RSA How the World's Smartest Company Selects the Most Creative Thinkers Groups
Lecture 1: Introduction to Public key cryptography
Lecture 1: Introduction to Public key cryptography Thomas Johansson T. Johansson (Lund University) 1 / 44 Key distribution Symmetric key cryptography: Alice and Bob share a common secret key. Some means
Chapter 4 Mathematics of Cryptography
Chapter 4 Mathematics of Cryptography Part II: Algebraic Structures Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4.1 Chapter 4 Objectives To review the concept
Public Key 9/17/2018. Symmetric Cryptography Review. Symmetric Cryptography: Shortcomings (1) Symmetric Cryptography: Analogy
Symmetric Cryptography Review Alice Bob Public Key x e K (x) y d K (y) x K K Instructor: Dr. Wei (Lisa) Li Department of Computer Science, GSU Two properties of symmetric (secret-key) crypto-systems: The
Innovation and Cryptoventures. Cryptography 101. Campbell R. Harvey. Duke University, NBER and Investment Strategy Advisor, Man Group, plc
Innovation and Cryptoventures Cryptography 101 Campbell R. Harvey Duke University, NBER and Investment Strategy Advisor, Man Group, plc Revised February 6, 2017 1 Definition Cryptography is the science
Introduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor RSA Public Key Encryption Factoring Algorithms Lecture 7 Tel-Aviv University Revised March 1st, 2008 Reminder: The Prime Number Theorem Let π(x) denote the
INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.
INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b
9 Knapsack Cryptography
9 Knapsack Cryptography In the past four weeks, we ve discussed public-key encryption systems that depend on various problems that we believe to be hard: prime factorization, the discrete logarithm, and
Discrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6
CS 70 Discrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6 1 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes
Lecture Notes, Week 6
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467b: Cryptography and Computer Security Week 6 (rev. 3) Professor M. J. Fischer February 15 & 17, 2005 1 RSA Security Lecture Notes, Week 6 Several
Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013
RSA Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013 Recap Recap Number theory o What is a prime number? o What is prime factorization? o What is a GCD? o What does relatively prime
CPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 9 September 30, 2015 CPSC 467, Lecture 9 1/47 Fast Exponentiation Algorithms Number Theory Needed for RSA Elementary Number Theory
Q: How can quantum computers break ecryption?
Q: How can quantum computers break ecryption? Posted on February 21, 2011 by The Physicist Physicist: What follows is the famous Shor algorithm, which can break any RSA encryption key. The problem: RSA,
Continuing discussion of CRC s, especially looking at two-bit errors
Continuing discussion of CRC s, especially looking at two-bit errors The definition of primitive binary polynomials Brute force checking for primitivity A theorem giving a better test for primitivity Fast
Elliptic Curves and an Application in Cryptography
Parabola Volume 54, Issue 1 (2018) Elliptic Curves and an Application in Cryptography Jeremy Muskat 1 Abstract Communication is no longer private, but rather a publicly broadcast signal for the entire
One can use elliptic curves to factor integers, although probably not RSA moduli.
Elliptic Curves Elliptic curves are groups created by defining a binary operation (addition) on the points of the graph of certain polynomial equations in two variables. These groups have several properties
arxiv: v3 [cs.cr] 15 Jun 2017
![arxiv: v3 [cs.cr] 15 Jun 2017](/thumbs/95/126251828.jpg "arxiv: v3 [cs.cr] 15 Jun 2017")
Use of Signed Permutations in Cryptography arxiv:1612.05605v3 [cs.cr] 15 Jun 2017 Iharantsoa Vero RAHARINIRINA ihvero@yahoo.fr Department of Mathematics and computer science, Faculty of Sciences, BP 906
MODULAR ARITHMETIC I
MODULAR ARITHMETIC I. Modular Arithmetic and Check Digit Schemes The check digit schemes that we have been studying have some features in common. Certain information (book title publisher etc., personal
Overview. Public Key Algorithms II
Public Key Algorithms II Dr. Arjan Durresi Louisiana State University Baton Rouge, LA 70810 Durresi@csc.lsu.Edu These slides are available at: http://www.csc.lsu.edu/~durresi/csc4601-04/ Louisiana State
Asymmetric Encryption
-3 s s Encryption Comp Sci 3600 Outline -3 s s 1-3 2 3 4 5 s s Outline -3 s s 1-3 2 3 4 5 s s Function Using Bitwise XOR -3 s s Key Properties for -3 s s The most important property of a hash function
Elliptic curves: Theory and Applications. Day 4: The discrete logarithm problem.
Elliptic curves: Theory and Applications. Day 4: The discrete logarithm problem. Elisa Lorenzo García Université de Rennes 1 14-09-2017 Elisa Lorenzo García (Rennes 1) Elliptic Curves 4 14-09-2017 1 /
Discrete mathematics I - Number theory
Discrete mathematics I - Number theory Emil Vatai (based on hungarian slides by László Mérai) 1 January 31, 2018 1 Financed from the financial support ELTE won from the Higher Education
Information Security
SE 4472 / ECE 9064 Information Security Week 12: Random Number Generators and Picking Appropriate Key Lengths Fall 2015 Prof. Aleksander Essex Random Number Generation Where do keys come from? So far we
Theme : Cryptography. Instructor : Prof. C Pandu Rangan. Speaker : Arun Moorthy CS
1 C Theme : Cryptography Instructor : Prof. C Pandu Rangan Speaker : Arun Moorthy 93115 CS 2 RSA Cryptosystem Outline of the Talk! Introduction to RSA! Working of the RSA system and associated terminology!
CPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 9 February 14, 2013 CPSC 467b, Lecture 9 1/42 Integer Division (cont.) Relatively prime numbers, Z n, and φ(n) Computing in Z n
Applied Cryptography and Computer Security CSE 664 Spring 2018
Applied Cryptography and Computer Security Lecture 17: Elliptic Curves and Applications Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline We previously looked at discrete
APA: Estep, Samuel (2018) "Elliptic Curves" The Kabod 4( 2 (2018)), Article 1. Retrieved from vol4/iss2/1
The Kabod Volume 4 Issue 2 Spring 2018 Article 1 February 2018 Elliptic Curves Samuel Estep Liberty University, sestep@liberty.edu Follow this and additional works at: http://digitalcommons.liberty.edu/kabod
Evidence that the Diffie-Hellman Problem is as Hard as Computing Discrete Logs
Evidence that the Diffie-Hellman Problem is as Hard as Computing Discrete Logs Jonah Brown-Cohen 1 Introduction The Diffie-Hellman protocol was one of the first methods discovered for two people, say Alice
CSE 311: Foundations of Computing. Lecture 10: Set Operations & Representation, Modular Arithmetic
CSE 311: Foundations of Computing Lecture 10: Set Operations & Representation, Modular Arithmetic Definitions A and B are equal if they have the same elements A = B x (x A x B) A is a subset of B if every
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
Modular Arithmetic Investigation
The basics Modular Arithmetic Investigation Definition: Two numbers are considered congruent, modulo n if they are exactly a multiple of n apart. Equivalently, if the two numbers are the same distance
This is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.
8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only
Grade 11/12 Math Circles Rational Points on an Elliptic Curves Dr. Carmen Bruni November 11, Lest We Forget
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 11/12 Math Circles Rational Points on an Elliptic Curves Dr. Carmen Bruni November 11, 2015 - Lest