Discrete Mathematics & Mathematical Reasoning Multiplicative Inverses and Some Cryptography

Size: px
Start display at page:

Download "Discrete Mathematics & Mathematical Reasoning Multiplicative Inverses and Some Cryptography"

Transcription

1 Discrete Mathematics & Mathematical Reasoning Multiplicative Inverses and Some Cryptography Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 1 / 13

2 Multiplicative inverses Theorem If m, x are positive integers and gcd(m, x) = 1 then x has a multiplicative inverse modulo m (and it is unique modulo m) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 2 / 13

3 Multiplicative inverses Theorem If m, x are positive integers and gcd(m, x) = 1 then x has a multiplicative inverse modulo m (and it is unique modulo m) Proof. Consider the sequence of m numbers 0, x, 2x,..., (m 1)x. We first show that these are all distinct modulo m. To verify the above claim, suppose that ax mod m = bx mod m for two distinct values a, b in the range 0 a, b m 1. Then we would have (a b)x 0(mod m), or equivalently, (a b)x = km for some integer k. But since x and m are relatively prime, it follows that a b must be an integer multiple of m. This is not possible since a,b are distinct non-negative integers less than m. Now, since there are only m distinct values modulo m, it must then be the case that ax 1(mod m) for exactly one a (modulo m). This a is the unique multiplicative inverse. Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 2 / 13

4 Chinese remainder theorem Theorem Let m 1, m 2,..., m n be pairwise relatively prime positive integers greater than 1 and a 1, a 2,..., a n be arbitrary integers. Then the system x a 1 (mod m 1 ) x a 2 (mod m 2 ). x a n (mod m n ) has a unique solution modulo m = m 1 m 2 m n Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 3 / 13

5 Chinese remainder theorem Theorem Let m 1, m 2,..., m n be pairwise relatively prime positive integers greater than 1 and a 1, a 2,..., a n be arbitrary integers. Then the system x a 1 (mod m 1 ) x a 2 (mod m 2 ). x a n (mod m n ) has a unique solution modulo m = m 1 m 2 m n Proof. In the book Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 3 / 13

6 Example x 2 (mod 3) x 3 (mod 5) x 5 (mod 7) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 4 / 13

7 Example x 2 (mod 3) x 3 (mod 5) x 5 (mod 7) m = = 105 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 4 / 13

8 Example m = = 105 x 2 (mod 3) x 3 (mod 5) x 5 (mod 7) M 1 = 35 and 2 is an inverse of M 1 mod 3 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 4 / 13

9 Example m = = 105 x 2 (mod 3) x 3 (mod 5) x 5 (mod 7) M 1 = 35 and 2 is an inverse of M 1 mod 3 M 2 = 21 and 1 is an inverse of M 2 mod 5 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 4 / 13

10 Example m = = 105 x 2 (mod 3) x 3 (mod 5) x 5 (mod 7) M 1 = 35 and 2 is an inverse of M 1 mod 3 M 2 = 21 and 1 is an inverse of M 2 mod 5 M 3 = 15 and 1 is an inverse of M 3 mod 7 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 4 / 13

11 Example m = = 105 x 2 (mod 3) x 3 (mod 5) x 5 (mod 7) M 1 = 35 and 2 is an inverse of M 1 mod 3 M 2 = 21 and 1 is an inverse of M 2 mod 5 M 3 = 15 and 1 is an inverse of M 3 mod 7 x = Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 4 / 13

12 Example m = = 105 x 2 (mod 3) x 3 (mod 5) x 5 (mod 7) M 1 = 35 and 2 is an inverse of M 1 mod 3 M 2 = 21 and 1 is an inverse of M 2 mod 5 M 3 = 15 and 1 is an inverse of M 3 mod 7 x = x = = (mod 105) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 4 / 13

13 Fermat s little theorem Theorem If p is prime and p a, then a p 1 1 (mod p). Furthermore, for every integer a we have a p a (mod p) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 5 / 13

14 Fermat s little theorem Theorem If p is prime and p a, then a p 1 1 (mod p). Furthermore, for every integer a we have a p a (mod p) Proof. Assume p a and so, therefore, gcd(p, a) = 1. Then a, 2a,..., (p 1)a are not pairwise congruent modulo p; if ia ja (mod p) then (i j)a = pm for some m which is impossible (as then i j (mod p) using last result from slides of Lecture 11). Therefore, each element ja mod p is a distinct element in the set {1,..., p 1}. This means that the product a 2a (p 1)a 1 2 p 1 (mod p). Therefore, (p 1)!a p 1 (p 1)! (mod p). Now because gcd(p, q) = 1 for 1 q p 1 it follows that a p 1 1 (mod p). Therefore, also a p a (mod p) and when p a then clearly a p a (mod p). Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 5 / 13

15 Computing the remainders modulo prime p Find mod 11 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 6 / 13

16 Computing the remainders modulo prime p Find mod 11 By Fermat s little theorem, we know that (mod 11), and so (7 10 ) k 1 (mod 11) for every positive integer k. Therefore, = = (7 10 ) (mod 11). Hence, mod 11 = 5 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 6 / 13

17 Computing the remainders modulo prime p Find mod 11 By Fermat s little theorem, we know that (mod 11), and so (7 10 ) k 1 (mod 11) for every positive integer k. Therefore, = = (7 10 ) (mod 11). Hence, mod 11 = (mod 11) because (mod 11) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 6 / 13

18 Private key cryptography Bob wants to send Alice a secret message M Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 7 / 13

19 Private key cryptography Bob wants to send Alice a secret message M Alice sends Bob a private key En (which has an inverse De) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 7 / 13

20 Private key cryptography Bob wants to send Alice a secret message M Alice sends Bob a private key En (which has an inverse De) Bob encrypts M and sends Alice En(M) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 7 / 13

21 Private key cryptography Bob wants to send Alice a secret message M Alice sends Bob a private key En (which has an inverse De) Bob encrypts M and sends Alice En(M) Alice decrypts En(M), De(En(M)) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 7 / 13

22 Private key cryptography Bob wants to send Alice a secret message M Alice sends Bob a private key En (which has an inverse De) Bob encrypts M and sends Alice En(M) Alice decrypts En(M), De(En(M)) Important property De(En(M)) = M Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 7 / 13

23 Private key cryptography Bob wants to send Alice a secret message M Alice sends Bob a private key En (which has an inverse De) Bob encrypts M and sends Alice En(M) Alice decrypts En(M), De(En(M)) Important property De(En(M)) = M Alice and Bob share a secret which could be intercepted by a third party Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 7 / 13

24 Private key cryptography Bob wants to send Alice a secret message M Alice sends Bob a private key En (which has an inverse De) Bob encrypts M and sends Alice En(M) Alice decrypts En(M), De(En(M)) Important property De(En(M)) = M Alice and Bob share a secret which could be intercepted by a third party Example use En(p) = (p + 3) mod 26 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 7 / 13

25 Private key cryptography Bob wants to send Alice a secret message M Alice sends Bob a private key En (which has an inverse De) Bob encrypts M and sends Alice En(M) Alice decrypts En(M), De(En(M)) Important property De(En(M)) = M Alice and Bob share a secret which could be intercepted by a third party Example use En(p) = (p + 3) mod 26 What is WKLV LV D VHFSHW? Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 7 / 13

26 Public key cryptography Bob wants to send Alice a secret message M Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 8 / 13

27 Public key cryptography Bob wants to send Alice a secret message M Without Alice and Bob sharing a secret Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 8 / 13

28 Public key cryptography Bob wants to send Alice a secret message M Without Alice and Bob sharing a secret Alice sends Bob a public key En (and keeps her inverse private key De secret from everyone including Bob) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 8 / 13

29 Public key cryptography Bob wants to send Alice a secret message M Without Alice and Bob sharing a secret Alice sends Bob a public key En (and keeps her inverse private key De secret from everyone including Bob) Bob encrypts M and sends Alice En(M) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 8 / 13

30 Public key cryptography Bob wants to send Alice a secret message M Without Alice and Bob sharing a secret Alice sends Bob a public key En (and keeps her inverse private key De secret from everyone including Bob) Bob encrypts M and sends Alice En(M) Alice decrypts En(M), De(En(M)) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 8 / 13

31 Public key cryptography Bob wants to send Alice a secret message M Without Alice and Bob sharing a secret Alice sends Bob a public key En (and keeps her inverse private key De secret from everyone including Bob) Bob encrypts M and sends Alice En(M) Alice decrypts En(M), De(En(M)) Important property De(En(M)) = M Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 8 / 13

32 Public key cryptography Bob wants to send Alice a secret message M Without Alice and Bob sharing a secret Alice sends Bob a public key En (and keeps her inverse private key De secret from everyone including Bob) Bob encrypts M and sends Alice En(M) Alice decrypts En(M), De(En(M)) Important property De(En(M)) = M The challenge: De can t be feasibly computed from En; and given En(M) one can t feasibly compute M Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 8 / 13

33 RSA Cryptosystem Named after 3 researchers: Rivest, Shamir and Adleman Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 9 / 13

34 RSA Cryptosystem Named after 3 researchers: Rivest, Shamir and Adleman There are quick algorithms for testing whether a large integer is prime Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 9 / 13

35 RSA Cryptosystem Named after 3 researchers: Rivest, Shamir and Adleman There are quick algorithms for testing whether a large integer is prime There is no known quick algorithm that can factorise a large integer Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 9 / 13

36 RSA Cryptosystem Named after 3 researchers: Rivest, Shamir and Adleman There are quick algorithms for testing whether a large integer is prime There is no known quick algorithm that can factorise a large integer Very significant open problem: how hard is it to factorise integers? Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 9 / 13

37 RSA: key generation Choose two distinct prime numbers p and q Let n = pq and k = (p 1)(q 1) Choose integer e where 1 < e < k and gcd(e, k) = 1 (n, e) is released as the public key Let d be the multiplicative inverse of e modulo k, so de 1 (mod k) (n, d) is the private key and kept secret Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 10 / 13

38 RSA: encryption and decryption Alice transmits her public key (n, e) to Bob and keeps the private key secret Encryption If Bob wishes to send message M to Alice. 1 He turns M into an integer m, such that 0 m < n by using an agreed-upon reversible protocol known as a padding scheme 2 He computes the ciphertext c corresponding to c = m e mod n. (This can be done quickly) 3 Bob transmits c to Alice. Decryption Alice can recover m from c by 1 Using her private key exponent d via computing m = c d mod n 2 Given m, she can recover the original message M by reversing the padding scheme Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 11 / 13

39 Unrealistic example n = = 2537 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 12 / 13

40 Unrealistic example n = = 2537 gcd(13, 42 58) = 1, so public key is (2537, 13) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 12 / 13

41 Unrealistic example n = = 2537 gcd(13, 42 58) = 1, so public key is (2537, 13) d = 937 is inverse of 13 modulo 2436 = 42 58; private key (2537, 937) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 12 / 13

42 Unrealistic example n = = 2537 gcd(13, 42 58) = 1, so public key is (2537, 13) d = 937 is inverse of 13 modulo 2436 = 42 58; private key (2537, 937) Encrypt STOP as two blocks 1819 for ST and 1415 for OP (padding scheme) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 12 / 13

43 Unrealistic example n = = 2537 gcd(13, 42 58) = 1, so public key is (2537, 13) d = 937 is inverse of 13 modulo 2436 = 42 58; private key (2537, 937) Encrypt STOP as two blocks 1819 for ST and 1415 for OP (padding scheme) So, mod 2537 = 2081 and mod 2537 = 2182 Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 12 / 13

44 Unrealistic example n = = 2537 gcd(13, 42 58) = 1, so public key is (2537, 13) d = 937 is inverse of 13 modulo 2436 = 42 58; private key (2537, 937) Encrypt STOP as two blocks 1819 for ST and 1415 for OP (padding scheme) So, mod 2537 = 2081 and mod 2537 = 2182 So encrypted message is Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 12 / 13

45 RSA: correctness of decryption Given that c = m e mod n, is m = c d mod n? c d = (m e ) d m ed (mod n) By construction, d and e are each others multiplicative inverses modulo k, i.e. ed 1 (mod k). Also k = (p 1)(q 1). Thus ed 1 = h(p 1)(q 1) for some integer h. We consider m ed mod p If p m then m ed = m h(p 1)(q 1) m = (m p 1 ) h(q 1) m 1 h(q 1) m m (mod p) (by Fermat s little theorem) Otherwise m ed 0 m (mod p) Symmetrically, m ed m (mod q) Since p, q are distinct primes, we have m ed m (mod pq). Since n = pq, we have c d = m ed m (mod n) Colin Stirling (Informatics) Discrete Mathematics (Chap 4) Today 13 / 13

Fermat s little theorem. RSA.

Fermat s little theorem. RSA. .. Computing large numbers modulo n (a) In modulo arithmetic, you can always reduce a large number to its remainder a a rem n (mod n). (b) Addition, subtraction, and multiplication preserve congruence:

More information

Lecture 32. Handout or Document Camera or Class Exercise. Which of the following is equal to [53] [5] 1 in Z 7? (Do not use a calculator.

Lecture 32. Handout or Document Camera or Class Exercise. Which of the following is equal to [53] [5] 1 in Z 7? (Do not use a calculator. Lecture 32 Instructor s Comments: This is a make up lecture. You can choose to cover many extra problems if you wish or head towards cryptography. I will probably include the square and multiply algorithm

More information

The number theory behind cryptography

The number theory behind cryptography The University of Vermont May 16, 2017 What is cryptography? Cryptography is the practice and study of techniques for secure communication in the presence of adverse third parties. What is cryptography?

More information

Linear Congruences. The solutions to a linear congruence ax b (mod m) are all integers x that satisfy the congruence.

Linear Congruences. The solutions to a linear congruence ax b (mod m) are all integers x that satisfy the congruence. Section 4.4 Linear Congruences Definition: A congruence of the form ax b (mod m), where m is a positive integer, a and b are integers, and x is a variable, is called a linear congruence. The solutions

More information

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 7 Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 Cryptography studies techniques for secure communication in the presence of third parties. A typical

More information

Assignment 2. Due: Monday Oct. 15, :59pm

Assignment 2. Due: Monday Oct. 15, :59pm Introduction To Discrete Math Due: Monday Oct. 15, 2012. 11:59pm Assignment 2 Instructor: Mohamed Omar Math 6a For all problems on assignments, you are allowed to use the textbook, class notes, and other

More information

Cryptography, Number Theory, and RSA

Cryptography, Number Theory, and RSA Cryptography, Number Theory, and RSA Joan Boyar, IMADA, University of Southern Denmark November 2015 Outline Symmetric key cryptography Public key cryptography Introduction to number theory RSA Modular

More information

L29&30 - RSA Cryptography

L29&30 - RSA Cryptography L29&30 - RSA Cryptography CSci/Math 2112 20&22 July 2015 1 / 13 Notation We write a mod n for the integer b such that 0 b < n and a b (mod n). 2 / 13 Calculating Large Powers Modulo n Example 1 What is

More information

Data security (Cryptography) exercise book

Data security (Cryptography) exercise book University of Debrecen Faculty of Informatics Data security (Cryptography) exercise book 1 Contents 1 RSA 4 1.1 RSA in general.................................. 4 1.2 RSA background.................................

More information

Cryptography. 2. decoding is extremely difficult (for protection against eavesdroppers);

Cryptography. 2. decoding is extremely difficult (for protection against eavesdroppers); 18.310 lecture notes September 2, 2013 Cryptography Lecturer: Michel Goemans 1 Public Key Cryptosystems In these notes, we will be concerned with constructing secret codes. A sender would like to encrypt

More information

MA/CSSE 473 Day 9. The algorithm (modified) N 1

MA/CSSE 473 Day 9. The algorithm (modified) N 1 MA/CSSE 473 Day 9 Primality Testing Encryption Intro The algorithm (modified) To test N for primality Pick positive integers a 1, a 2,, a k < N at random For each a i, check for a N 1 i 1 (mod N) Use the

More information

Algorithmic Number Theory and Cryptography (CS 303)

Algorithmic Number Theory and Cryptography (CS 303) Algorithmic Number Theory and Cryptography (CS 303) Modular Arithmetic and the RSA Public Key Cryptosystem Jeremy R. Johnson 1 Introduction Objective: To understand what a public key cryptosystem is and

More information

Diffie-Hellman key-exchange protocol

Diffie-Hellman key-exchange protocol Diffie-Hellman key-exchange protocol This protocol allows two users to choose a common secret key, for DES or AES, say, while communicating over an insecure channel (with eavesdroppers). The two users

More information

CHAPTER 2. Modular Arithmetic

CHAPTER 2. Modular Arithmetic CHAPTER 2 Modular Arithmetic In studying the integers we have seen that is useful to write a = qb + r. Often we can solve problems by considering only the remainder, r. This throws away some of the information,

More information

Xor. Isomorphisms. CS70: Lecture 9. Outline. Is public key crypto possible? Cryptography... Public key crypography.

Xor. Isomorphisms. CS70: Lecture 9. Outline. Is public key crypto possible? Cryptography... Public key crypography. CS70: Lecture 9. Outline. 1. Public Key Cryptography 2. RSA system 2.1 Efficiency: Repeated Squaring. 2.2 Correctness: Fermat s Theorem. 2.3 Construction. 3. Warnings. Cryptography... m = D(E(m,s),s) Alice

More information

Application: Public Key Cryptography. Public Key Cryptography

Application: Public Key Cryptography. Public Key Cryptography Application: Public Key Cryptography Suppose I wanted people to send me secret messages by snail mail Method 0. I send a padlock, that only I have the key to, to everyone who might want to send me a message.

More information

Public Key Encryption

Public Key Encryption Math 210 Jerry L. Kazdan Public Key Encryption The essence of this procedure is that as far as we currently know, it is difficult to factor a number that is the product of two primes each having many,

More information

Mathematics Explorers Club Fall 2012 Number Theory and Cryptography

Mathematics Explorers Club Fall 2012 Number Theory and Cryptography Mathematics Explorers Club Fall 2012 Number Theory and Cryptography Chapter 0: Introduction Number Theory enjoys a very long history in short, number theory is a study of integers. Mathematicians over

More information

Related Ideas: DHM Key Mechanics

Related Ideas: DHM Key Mechanics Related Ideas: DHM Key Mechanics Example (DHM Key Mechanics) Two parties, Alice and Bob, calculate a key that a third person Carl will never know, even if Carl intercepts all communication between Alice

More information

p 1 MAX(a,b) + MIN(a,b) = a+b n m means that m is a an integer multiple of n. Greatest Common Divisor: We say that n divides m.

p 1 MAX(a,b) + MIN(a,b) = a+b n m means that m is a an integer multiple of n. Greatest Common Divisor: We say that n divides m. Great Theoretical Ideas In Computer Science Steven Rudich CS - Spring Lecture Feb, Carnegie Mellon University Modular Arithmetic and the RSA Cryptosystem p- p MAX(a,b) + MIN(a,b) = a+b n m means that m

More information

Cryptography Math 1580 Silverman First Hour Exam Mon Oct 2, 2017

Cryptography Math 1580 Silverman First Hour Exam Mon Oct 2, 2017 Name: Cryptography Math 1580 Silverman First Hour Exam Mon Oct 2, 2017 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name legibly at the top of this page. No calculators

More information

Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

More information

CS70: Lecture 8. Outline.

CS70: Lecture 8. Outline. CS70: Lecture 8. Outline. 1. Finish Up Extended Euclid. 2. Cryptography 3. Public Key Cryptography 4. RSA system 4.1 Efficiency: Repeated Squaring. 4.2 Correctness: Fermat s Theorem. 4.3 Construction.

More information

EE 418: Network Security and Cryptography

EE 418: Network Security and Cryptography EE 418: Network Security and Cryptography Homework 3 Solutions Assigned: Wednesday, November 2, 2016, Due: Thursday, November 10, 2016 Instructor: Tamara Bonaci Department of Electrical Engineering University

More information

1 Introduction to Cryptology

1 Introduction to Cryptology U R a Scientist (CWSF-ESPC 2017) Mathematics and Cryptology Patrick Maidorn and Michael Kozdron (Department of Mathematics & Statistics) 1 Introduction to Cryptology While the phrase making and breaking

More information

DUBLIN CITY UNIVERSITY

DUBLIN CITY UNIVERSITY DUBLIN CITY UNIVERSITY SEMESTER ONE EXAMINATIONS 2013 MODULE: (Title & Code) CA642 Cryptography and Number Theory COURSE: M.Sc. in Security and Forensic Computing YEAR: 1 EXAMINERS: (Including Telephone

More information

TMA4155 Cryptography, Intro

TMA4155 Cryptography, Intro Trondheim, December 12, 2006. TMA4155 Cryptography, Intro 2006-12-02 Problem 1 a. We need to find an inverse of 403 modulo (19 1)(31 1) = 540: 540 = 1 403 + 137 = 17 403 50 540 + 50 403 = 67 403 50 540

More information

Final exam. Question Points Score. Total: 150

Final exam. Question Points Score. Total: 150 MATH 11200/20 Final exam DECEMBER 9, 2016 ALAN CHANG Please present your solutions clearly and in an organized way Answer the questions in the space provided on the question sheets If you run out of room

More information

6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method

6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method Exercises Exercises 1. Show that 15 is an inverse of 7 modulo 26. 2. Show that 937 is an inverse of 13 modulo 2436. 3. By inspection (as discussed prior to Example 1), find an inverse of 4 modulo 9. 4.

More information

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand. Midterm #2: practice MATH 311 Intro to Number Theory midterm: Thursday, Oct 20 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating

More information

NUMBER THEORY AMIN WITNO

NUMBER THEORY AMIN WITNO NUMBER THEORY AMIN WITNO.. w w w. w i t n o. c o m Number Theory Outlines and Problem Sets Amin Witno Preface These notes are mere outlines for the course Math 313 given at Philadelphia

More information

Discrete Math Class 4 ( )

Discrete Math Class 4 ( ) Discrete Math 37110 - Class 4 (2016-10-06) 41 Division vs congruences Instructor: László Babai Notes taken by Jacob Burroughs Revised by instructor DO 41 If m ab and gcd(a, m) = 1, then m b DO 42 If gcd(a,

More information

Number Theory/Cryptography (part 1 of CSC 282)

Number Theory/Cryptography (part 1 of CSC 282) Number Theory/Cryptography (part 1 of CSC 282) http://www.cs.rochester.edu/~stefanko/teaching/11cs282 1 Schedule The homework is due Sep 8 Graded homework will be available at noon Sep 9, noon. EXAM #1

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem The Chinese Remainder Theorem Theorem. Let n 1,..., n r be r positive integers relatively prime in pairs. (That is, gcd(n i, n j ) = 1 whenever 1 i < j r.) Let a 1,..., a r be any r integers. Then the

More information

Classical Cryptography

Classical Cryptography Classical Cryptography CS 6750 Lecture 1 September 10, 2009 Riccardo Pucella Goals of Classical Cryptography Alice wants to send message X to Bob Oscar is on the wire, listening to all communications Alice

More information

Solutions for the Practice Final

Solutions for the Practice Final Solutions for the Practice Final 1. Ian and Nai play the game of todo, where at each stage one of them flips a coin and then rolls a die. The person who played gets as many points as the number rolled

More information

Cryptography CS 555. Topic 20: Other Public Key Encryption Schemes. CS555 Topic 20 1

Cryptography CS 555. Topic 20: Other Public Key Encryption Schemes. CS555 Topic 20 1 Cryptography CS 555 Topic 20: Other Public Key Encryption Schemes Topic 20 1 Outline and Readings Outline Quadratic Residue Rabin encryption Goldwasser-Micali Commutative encryption Homomorphic encryption

More information

DUBLIN CITY UNIVERSITY

DUBLIN CITY UNIVERSITY DUBLIN CITY UNIVERSITY SEMESTER ONE EXAMINATIONS 2013/2014 MODULE: CA642/A Cryptography and Number Theory PROGRAMME(S): MSSF MCM ECSA ECSAO MSc in Security & Forensic Computing M.Sc. in Computing Study

More information

MAT 302: ALGEBRAIC CRYPTOGRAPHY. Department of Mathematical and Computational Sciences University of Toronto, Mississauga.

MAT 302: ALGEBRAIC CRYPTOGRAPHY. Department of Mathematical and Computational Sciences University of Toronto, Mississauga. MAT 302: ALGEBRAIC CRYPTOGRAPHY Department of Mathematical and Computational Sciences University of Toronto, Mississauga February 27, 2013 Mid-term Exam INSTRUCTIONS: The duration of the exam is 100 minutes.

More information

Solutions for the Practice Questions

Solutions for the Practice Questions Solutions for the Practice Questions Question 1. Find all solutions to the congruence 13x 12 (mod 35). Also, answer the following questions about the solutions to the above congruence. Are there solutions

More information

MA 111, Topic 2: Cryptography

MA 111, Topic 2: Cryptography MA 111, Topic 2: Cryptography Our next topic is something called Cryptography, the mathematics of making and breaking Codes! In the most general sense, Cryptography is the mathematical ideas behind changing

More information

Cryptography Lecture 1: Remainders and Modular Arithmetic Spring 2014 Morgan Schreffler Office: POT 902

Cryptography Lecture 1: Remainders and Modular Arithmetic Spring 2014 Morgan Schreffler Office: POT 902 Cryptography Lecture 1: Remainders and Modular Arithmetic Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Topic Idea: Cryptography Our next topic is something called Cryptography,

More information

Math 319 Problem Set #7 Solution 18 April 2002

Math 319 Problem Set #7 Solution 18 April 2002 Math 319 Problem Set #7 Solution 18 April 2002 1. ( 2.4, problem 9) Show that if x 2 1 (mod m) and x / ±1 (mod m) then 1 < (x 1, m) < m and 1 < (x + 1, m) < m. Proof: From x 2 1 (mod m) we get m (x 2 1).

More information

ElGamal Public-Key Encryption and Signature

ElGamal Public-Key Encryption and Signature ElGamal Public-Key Encryption and Signature Çetin Kaya Koç koc@cs.ucsb.edu Çetin Kaya Koç http://koclab.org Winter 2017 1 / 10 ElGamal Cryptosystem and Signature Scheme Taher ElGamal, originally from Egypt,

More information

Public Key Cryptography

Public Key Cryptography Public Key Cryptography How mathematics allows us to send our most secret messages quite openly without revealing their contents - except only to those who are supposed to read them The mathematical ideas

More information

Number Theory and Public Key Cryptography Kathryn Sommers

Number Theory and Public Key Cryptography Kathryn Sommers Page!1 Math 409H Fall 2016 Texas A&M University Professor: David Larson Introduction Number Theory and Public Key Cryptography Kathryn Sommers Number theory is a very broad and encompassing subject. At

More information

Primitive Roots. Chapter Orders and Primitive Roots

Primitive Roots. Chapter Orders and Primitive Roots Chapter 5 Primitive Roots The name primitive root applies to a number a whose powers can be used to represent a reduced residue system modulo n. Primitive roots are therefore generators in that sense,

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem The Chinese Remainder Theorem Theorem. Let m and n be two relatively prime positive integers. Let a and b be any two integers. Then the two congruences x a (mod m) x b (mod n) have common solutions. Any

More information

Introduction to Cryptography CS 355

Introduction to Cryptography CS 355 Introduction to Cryptography CS 355 Lecture 25 Mental Poker And Semantic Security CS 355 Fall 2005 / Lecture 25 1 Lecture Outline Review of number theory The Mental Poker Protocol Semantic security Semantic

More information

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the Inverse

More information

Math 412: Number Theory Lecture 6: congruence system and

Math 412: Number Theory Lecture 6: congruence system and Math 412: Number Theory Lecture 6: congruence system and classes Gexin Yu gyu@wm.edu College of William and Mary Chinese Remainder Theorem Chinese Remainder Theorem: let m 1, m 2,..., m k be pairwise coprimes.

More information

EE 418 Network Security and Cryptography Lecture #3

EE 418 Network Security and Cryptography Lecture #3 EE 418 Network Security and Cryptography Lecture #3 October 6, 2016 Classical cryptosystems. Lecture notes prepared by Professor Radha Poovendran. Tamara Bonaci Department of Electrical Engineering University

More information

SOLUTIONS TO PROBLEM SET 5. Section 9.1

SOLUTIONS TO PROBLEM SET 5. Section 9.1 SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3

More information

Public-Key Cryptosystem Based on Composite Degree Residuosity Classes. Paillier Cryptosystem. Harmeet Singh

Public-Key Cryptosystem Based on Composite Degree Residuosity Classes. Paillier Cryptosystem. Harmeet Singh Public-Key Cryptosystem Based on Composite Degree Residuosity Classes aka Paillier Cryptosystem Harmeet Singh Harmeet Singh Winter 2018 1 / 26 Background s Background Foundation of public-key encryption

More information

Algorithmic Number Theory and Cryptography (CS 303)

Algorithmic Number Theory and Cryptography (CS 303) Algorithmic Number Theory and Cryptography (CS 303) Modular Arithmetic Jeremy R. Johnson 1 Introduction Objective: To become familiar with modular arithmetic and some key algorithmic constructions that

More information

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012 CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the

More information

Number Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory

Number Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory - Divisibility - Congruences June 23, 2014 Primes - Divisibility - Congruences Definition A positive integer p is prime if p 2 and its only positive factors are itself and 1. Otherwise, if p 2, then p

More information

Introduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained.

Introduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained. THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT Introduction The rst Chinese problem in indeterminate analysis is encountered in a book written by the Chinese mathematician Sun Tzi. The problem

More information

Introduction to Modular Arithmetic

Introduction to Modular Arithmetic 1 Integers modulo n 1.1 Preliminaries Introduction to Modular Arithmetic Definition 1.1.1 (Equivalence relation). Let R be a relation on the set A. Recall that a relation R is a subset of the cartesian

More information

CMath 55 PROFESSOR KENNETH A. RIBET. Final Examination May 11, :30AM 2:30PM, 100 Lewis Hall

CMath 55 PROFESSOR KENNETH A. RIBET. Final Examination May 11, :30AM 2:30PM, 100 Lewis Hall CMath 55 PROFESSOR KENNETH A. RIBET Final Examination May 11, 015 11:30AM :30PM, 100 Lewis Hall Please put away all books, calculators, cell phones and other devices. You may consult a single two-sided

More information

Public-key Cryptography: Theory and Practice

Public-key Cryptography: Theory and Practice Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 5: Cryptographic Algorithms Common Encryption Algorithms RSA

More information

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation. Congruences A congruence is a statement about divisibility. It is a notation that simplifies reasoning about divisibility. It suggests proofs by its analogy to equations. Congruences are familiar to us

More information

Chinese Remainder. Discrete Mathematics Andrei Bulatov

Chinese Remainder. Discrete Mathematics Andrei Bulatov Chnese Remander Introducton Theorem Dscrete Mathematcs Andre Bulatov Dscrete Mathematcs Chnese Remander Theorem 34-2 Prevous Lecture Resdues and arthmetc operatons Caesar cpher Pseudorandom generators

More information

b) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.

b) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively. Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). Solution: a) Fermat s Little

More information

Example Enemy agents are trying to invent a new type of cipher. They decide on the following encryption scheme: Plaintext converts to Ciphertext

Example Enemy agents are trying to invent a new type of cipher. They decide on the following encryption scheme: Plaintext converts to Ciphertext Cryptography Codes Lecture 4: The Times Cipher, Factors, Zero Divisors, and Multiplicative Inverses Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler New Cipher Times Enemy

More information

SOLUTIONS FOR PROBLEM SET 4

SOLUTIONS FOR PROBLEM SET 4 SOLUTIONS FOR PROBLEM SET 4 A. A certain integer a gives a remainder of 1 when divided by 2. What can you say about the remainder that a gives when divided by 8? SOLUTION. Let r be the remainder that a

More information

Lecture 8. Outline. 1. Modular Arithmetic. Clock Math!!! 2. Inverses for Modular Arithmetic: Greatest Common Divisor. 3. Euclid s GCD Algorithm

Lecture 8. Outline. 1. Modular Arithmetic. Clock Math!!! 2. Inverses for Modular Arithmetic: Greatest Common Divisor. 3. Euclid s GCD Algorithm Lecture 8. Outline. 1. Modular Arithmetic. Clock Math!!! 2. Inverses for Modular Arithmetic: Greatest Common Divisor. 3. Euclid s GCD Algorithm Clock Math If it is 1:00 now. What time is it in 5 hours?

More information

Number Theory and Security in the Digital Age

Number Theory and Security in the Digital Age Number Theory and Security in the Digital Age Lola Thompson Ross Program July 21, 2010 Lola Thompson (Ross Program) Number Theory and Security in the Digital Age July 21, 2010 1 / 37 Introduction I have

More information

Cryptography. Module in Autumn Term 2016 University of Birmingham. Lecturers: Mark D. Ryan and David Galindo

Cryptography. Module in Autumn Term 2016 University of Birmingham. Lecturers: Mark D. Ryan and David Galindo Lecturers: Mark D. Ryan and David Galindo. Cryptography 2017. Slide: 1 Cryptography Module in Autumn Term 2016 University of Birmingham Lecturers: Mark D. Ryan and David Galindo Slides originally written

More information

MAT199: Math Alive Cryptography Part 2

MAT199: Math Alive Cryptography Part 2 MAT199: Math Alive Cryptography Part 2 1 Public key cryptography: The RSA algorithm After seeing several examples of classical cryptography, where the encoding procedure has to be kept secret (because

More information

Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02

Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02 Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02 Public Polynomial congruences come up constantly, even when one is dealing with much deeper problems

More information

Solution: Alice tosses a coin and conveys the result to Bob. Problem: Alice can choose any result.

Solution: Alice tosses a coin and conveys the result to Bob. Problem: Alice can choose any result. Example - Coin Toss Coin Toss: Alice and Bob want to toss a coin. Easy to do when they are in the same room. How can they toss a coin over the phone? Mutual Commitments Solution: Alice tosses a coin and

More information

Drill Time: Remainders from Long Division

Drill Time: Remainders from Long Division Drill Time: Remainders from Long Division Example (Drill Time: Remainders from Long Division) Get some practice finding remainders. Use your calculator (if you want) then check your answers with a neighbor.

More information

MAT Modular arithmetic and number theory. Modular arithmetic

MAT Modular arithmetic and number theory. Modular arithmetic Modular arithmetic 1 Modular arithmetic may seem like a new and strange concept at first The aim of these notes is to describe it in several different ways, in the hope that you will find at least one

More information

Security Enhancement and Speed Monitoring of RSA Algorithm

Security Enhancement and Speed Monitoring of RSA Algorithm Security Enhancement and Speed Monitoring of RSA Algorithm Sarthak R Patel 1, Prof. Khushbu Shah 2 1 PG Scholar, 2 Assistant Professor Computer Engineering Department, LJIET, Gujarat Technological University,

More information

MATH 135 Algebra, Solutions to Assignment 7

MATH 135 Algebra, Solutions to Assignment 7 MATH 135 Algebra, Solutions to Assignment 7 1: (a Find the smallest non-negative integer x such that x 41 (mod 9. Solution: The smallest such x is the remainder when 41 is divided by 9. We have 41 = 9

More information

Math 255 Spring 2017 Solving x 2 a (mod n)

Math 255 Spring 2017 Solving x 2 a (mod n) Math 255 Spring 2017 Solving x 2 a (mod n) Contents 1 Lifting 1 2 Solving x 2 a (mod p k ) for p odd 3 3 Solving x 2 a (mod 2 k ) 5 4 Solving x 2 a (mod n) for general n 9 1 Lifting Definition 1.1. Let

More information

Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions

Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions CS 70 Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions PRINT Your Name: Oski Bear SIGN Your Name: OS K I PRINT Your Student ID: CIRCLE your exam room: Pimentel

More information

Math 127: Equivalence Relations

Math 127: Equivalence Relations Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other

More information

Cryptography Made Easy. Stuart Reges Principal Lecturer University of Washington

Cryptography Made Easy. Stuart Reges Principal Lecturer University of Washington Cryptography Made Easy Stuart Reges Principal Lecturer University of Washington Why Study Cryptography? Secrets are intrinsically interesting So much real-life drama: Mary Queen of Scots executed for treason

More information

University of British Columbia. Math 312, Midterm, 6th of June 2017

University of British Columbia. Math 312, Midterm, 6th of June 2017 University of British Columbia Math 312, Midterm, 6th of June 2017 Name (please be legible) Signature Student number Duration: 90 minutes INSTRUCTIONS This test has 7 problems for a total of 100 points.

More information

Carmen s Core Concepts (Math 135)

Carmen s Core Concepts (Math 135) Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 7 1 Congruence Definition 2 Congruence is an Equivalence Relation (CER) 3 Properties of Congruence (PC) 4 Example 5 Congruences

More information

Numbers (8A) Young Won Lim 6/21/17

Numbers (8A) Young Won Lim 6/21/17 Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version

More information

Numbers (8A) Young Won Lim 5/24/17

Numbers (8A) Young Won Lim 5/24/17 Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version

More information

Foundations of Cryptography

Foundations of Cryptography Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 10 1 of 17 The order of a number (mod n) Definition

More information

Modular Arithmetic: refresher.

Modular Arithmetic: refresher. Lecture 7. Outline. 1. Modular Arithmetic. Clock Math!!! 2. Inverses for Modular Arithmetic: Greatest Common Divisor. Division!!! 3. Euclid s GCD Algorithm. A little tricky here! Clock Math If it is 1:00

More information

Numbers (8A) Young Won Lim 5/22/17

Numbers (8A) Young Won Lim 5/22/17 Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version

More information

Example Enemy agents are trying to invent a new type of cipher. They decide on the following encryption scheme: Plaintext converts to Ciphertext

Example Enemy agents are trying to invent a new type of cipher. They decide on the following encryption scheme: Plaintext converts to Ciphertext Cryptography Codes Lecture 3: The Times Cipher, Factors, Zero Divisors, and Multiplicative Inverses Spring 2015 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler New Cipher Times Enemy

More information

Problem Set 6 Solutions Math 158, Fall 2016

Problem Set 6 Solutions Math 158, Fall 2016 All exercise numbers from the textbook refer to the second edition. 1. (a) Textbook exercise 3.3 (this shows, as we mentioned in class, that RSA decryption always works when the modulus is a product of

More information

1.6 Congruence Modulo m

1.6 Congruence Modulo m 1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem The Chinese Remainder Theorem 8-3-2014 The Chinese Remainder Theorem gives solutions to systems of congruences with relatively prime moduli The solution to a system of congruences with relatively prime

More information

Sheet 1: Introduction to prime numbers.

Sheet 1: Introduction to prime numbers. Option A Hand in at least one question from at least three sheets Sheet 1: Introduction to prime numbers. [provisional date for handing in: class 2.] 1. Use Sieve of Eratosthenes to find all prime numbers

More information

Distribution of Primes

Distribution of Primes Distribution of Primes Definition. For positive real numbers x, let π(x) be the number of prime numbers less than or equal to x. For example, π(1) = 0, π(10) = 4 and π(100) = 25. To use some ciphers, we

More information

PT. Primarity Tests Given an natural number n, we want to determine if n is a prime number.

PT. Primarity Tests Given an natural number n, we want to determine if n is a prime number. PT. Primarity Tests Given an natural number n, we want to determine if n is a prime number. (PT.1) If a number m of the form m = 2 n 1, where n N, is a Mersenne number. If a Mersenne number m is also a

More information

Congruence. Solving linear congruences. A linear congruence is an expression in the form. ax b (modm)

Congruence. Solving linear congruences. A linear congruence is an expression in the form. ax b (modm) Congruence Solving linear congruences A linear congruence is an expression in the form ax b (modm) a, b integers, m a positive integer, x an integer variable. x is a solution if it makes the congruence

More information

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., Binary exponentiation An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., What are the last two digits of the number 2 284? In the absence

More information

Number Theory. Konkreetne Matemaatika

Number Theory. Konkreetne Matemaatika ITT9131 Number Theory Konkreetne Matemaatika Chapter Four Divisibility Primes Prime examples Factorial Factors Relative primality `MOD': the Congruence Relation Independent Residues Additional Applications

More information

Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS

Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS Author: MD.HASIRUL ISLAM NAZIR BASHIR Supervisor: MARCUS NILSSON Date: 2012-06-15 Subject: Mathematics and Modeling Level:

More information

Modular Arithmetic. Kieran Cooney - February 18, 2016

Modular Arithmetic. Kieran Cooney - February 18, 2016 Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.

More information

High-Speed RSA Crypto-Processor with Radix-4 4 Modular Multiplication and Chinese Remainder Theorem

High-Speed RSA Crypto-Processor with Radix-4 4 Modular Multiplication and Chinese Remainder Theorem High-Speed RSA Crypto-Processor with Radix-4 4 Modular Multiplication and Chinese Remainder Theorem Bonseok Koo 1, Dongwook Lee 1, Gwonho Ryu 1, Taejoo Chang 1 and Sangjin Lee 2 1 Nat (NSRI), Korea 2 Center

More information