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

Size: px
Start display at page:

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

Transcription

1 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 states: There are things of an unknown number which when divided by 3 leave 2, by 5 leave 3, and by 7 leave 2. What is the smallest number? This rudimentary question in Elementary Number Theory is best solved using the Chinese Remainder Theorem (CRT). In general, the CRT can be interpreted as a consequence of the existence of a ringisomorphism between the rings Z r1 r n and Z r1 Z rn. This lecture aims to provide techniques to solve such sets of congruences and extends the use of CRT to polynomials. In the end, the RSA public key encription algorithm is discussed and one important application of the CRT during the decription process in RSA is explained. Direct Products Denition: Direct Products of Rings: The direct product of the commutative rings A 1,..., A r with identity element is dened as the set A := A 1 A r with componentwise addition and multiplication. For (x 1,..., x r ), (y 1,..., y r ) A we thus know: (x 1,..., x r ) + (y 1,..., y r ) := (x 1 + y 1,... x r + y r ) and (x 1,..., x r ) (y 1,... y r ) := (x 1 y 1,... x r y r ) The Chinese Remainder Theorem For pairwise coprime r 1,..., r n Z Z r1 r n Z r1 Z rn ψ : k + r 1 r n Z (k + r 1 Z,..., k + r n Z) 1

2 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 2 is a ring-isomorphism (meaning a bijective, additive and multiplicative homomorpishm). Notice that this proof is not constructive. It only proves the existence of a solution of a set of simultaneous congruences. Yet it does not tell an algorithm that calculates those solutions. This proof has an advantage over the constructive proof of CRT. It is more abstract and allows important implications later on. Proof: ψ is well dened and injective: For r 1 r n we know that k + rz = l + rz r l k r i l k i [n] k + r i Z = l + r i Z i [n] ψ (k + rz) = ψ (l + rz) Since we know n n Z r = r = r i = Z ri = Z r1 Z r2 Z rn i=1 i=1 ψ is also surjective and therefore bijective. It follows from the denition of the operations that ψ is both additive and multiplicative. Hence, ψ is a ring-isomorphism. The ring-isomorphism ψ is equivalent to the following statement of the Chinese Remainder Theorem: For pairwise coprime r 1,, r n Z and random a 1,..., a n Z exists modulo r 1 r n = r exactly one k Z with k a i (mod r i ) i [n] General algorithm to solve systems of congruences: (Repetition from Number Theory) To solve a system of congruences of the form k a 1 (mod r 1 ) i [n] with pairwise coprime r 1,..., r n Z and random a 1,..., a n Z take the following steps:

3 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 3 Set r := r 1 r n and s i := r r i for i [n] Find k i Z mit s i k i (1 mod r i ) for i [n] Then k = s 1 k 1 a s n k n a n is a solution of the above system of congruences. The set of solutions is k + rz. Example x 2 (mod 3) x 3 (mod 5) x 2 (mod 7) r = 105, s 1 = 35, s 2 = 21, s 3 = 15 nd k 1, k 2, k 3 satisfying: 35k 1 1 (mod 3) 21k 2 1 (mod 5) 15k 3 1 (mod 7) k 1 = 2, k 2 = 1, k 3 = 1. Solution x = 1 (mod 3) {}}{ (5 7) 2 2 }{{} 2 (mod 3) + 1 (mod 5) {}}{ (3 7) 1 3 }{{} 3 (mod 5) + 1 (mod 7) {}}{ (3 5) 1 2 }{{} 2 (mod 7) Intuitively, you construct a set of summands such that each summand contains factors congruent to 0 modulo the other moduli. The only dicult thing is to nd the k i. With small numbers a fast solution is trying some numbers. There are only 4 numbers to check, if it's mod5! The extended Euklidean algorithm does always work, though it takes longer: you need the form at + bs = gcd (a, b): r r i k i 1 (mod r i ) ( ) r r k i + r i c = 1 = gcd, r i r i r i (c Z)

4 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 4 Example with k 1 of the above problem: get the form at + bs = gcd (a, b): (3 5) k 1 1 (mod 7) (3 5) k 1 + 7c = 1 = gcd ((3 5), 7) (c Z) Now k 1 can be computed with the extended Euclidean algorithm: 35 = = = = = k 1 = 1 2 (mod 3) The proof that such k i exist is indirectly given by the extended Euklidian Algorithm and can be found here 1. Since r i and s i are coprime for all i [n], one can nd those k i using the extended Euklidian Algorithm. Example with Polynomials Assume p(x) is a polynomial with the following characteristics: Find p(x). p(x) x 1 = q(x) + 3 x 1 p(x) x 2 = z(x) + 2 x 2 p(x) ( 1) x 3 = w(x) + x 3 Solution: Using the CRT for Polynomials, we nd: r(x) = (x 1)(x 2)(x 3) and we set r 1 = (x 1), a 1 = 3 r 2 = (x 2), a 2 = 2 r 3 = (x 3), a 3 = 1 Using Long Division, we nd r r i k i 1 (mod r i ) i {1, 2, 3} : (x 2)(x 3)k 1 1 (mod (x 1)) k 1 = Karpnger/Meyberg Algebra Lemma 5.13

5 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 5 (x 1)(x 3)k 2 1 (mod (x 2)) k 2 = 1 (x 1)(x 2)k 3 1 (mod (x 3)) k 3 = 1 2 Therefore, we nd: p(x) = (x 2)(x 3) ( 1 2) (3) + (x 1)(x 3) ( 1) (2) + (x 1) (x 2) ( 1 2) ( 1) = x 2 + 2x + 2 Remark: CRT can be extended to polynomials as long as the moduli r i are coprime!!

6 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 6 The RSA Algorithm The RSA Algorithm is the rst public-key encription system ever developed and has become an important factor in many of today's applications. Its safety largely depends on the factoring problem - prime factorization requires splitting an integer into factors that are prime numbers. Multiplying two prime integers together is easy, but as far as we know, factoring the product of two (or more) prime numbers is dicult. Key-Generation First, two large prime numbers p and q are randomly chosen. Their product, n = p q is found and stored. n is called the RSA-Modul and is used as a modulus for both encription and decription. Next, another prime number e with 1 < e < ϕ (n) = (p 1) (q 1) and gcd (e, ϕ (n)) = 1. e is called the public exponent. Additionally, a natural number d with 1 < d < ϕ(n) and d e 1mod (ϕ (n)). This number is found using the extended Euklidian algorithm. The public key consists of the tupel (n, e) and the private key is d. Encription The sender encripts a message k using the encription function: E (k) = k e mod n Since (n, e) is public, anybody can encript messages. Decription The receiver decripts the code c using the decription function: D (c) = c d mod n Since d is private and can only be calculated knowing (p, q), which are also private, only those who know the private key d can decript messages.

7 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 7 A thorough proof of the RSA Algorithm This proof probably is not the most elegant way to proof the RSA Algorithm. Our goal here is to explain every step using only elementary number theory. We try to avoid statements such as Clearly it follows.., As an obvious consequence... and others you will nd in most text books. The Problem. Given positive integers n, e, d such that (1) n = p q, where p and q are distinct primes (2) gcd (e, ϕ (n)) = 1 (This requirement is necessary to ensure that the modular inverse in (3) exists) (3) ed 1 (modϕ (n)) (4) Dene the public key transformation of a message m for 0 m < n to be E (m) = m e mod n (5) Dene the private key transformation of a message m for 0 m < n to be D (m) = m d mod n (6) Prove that, for 0 m < n, m = D (E (m)) (Decription) Concepts from Number Theory we Need for the Proof. (1) A prime number is dened as an integer, greater than one, which is only divisible by the number one and itself. (2) Two numbers a and b which have no common factors other than one are said to be coprime. (3) The greatest common divisor of two integers a and b is the largest integer that divides both numbers. (4) a and b are coprime if and only if gcd (a, b) = 1 (5) The notation n a means n divides a and thus there exists an integer d such that a = n d (6) If mn a then m a and n a for any integers m, n. (7) mod as a binary operation: The notation a = bmod n denes a binary operation where a is equal to the remainder on dividing b my n, 0 a < n (8) mod as a congruence relation: The notation a b (mod n) means a and b have the same remainder when divided by n, or, equivalently, (a) n a b, or (b) a b = nk with k N (9) The two ways of using mod are related: a m (mod n) a mod n = b mod n

8 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 8 (10) Properties of Congruence: for a xed positive integer n and any integers a, b, c, d. (a) a a (mod n) (b) a ± b b ± a (mod n) (c) ab ba (mod n) (d) abc (ab) c a (bc) (mod n) (e) If a b (mod n) then b a (mod n) (f) If a b (mod n) and b c (mod n) then a c (mod n) (g) If a b (mod n) and c d (mod n) then a ± c b ± d (mod n) and ac bd (mod n) (h) If a b (mod n) then a r b r (mod n), for any integer r 1 (i) a 0 (mod n) if and only if n a (11) If m and n are coprime and a b (mod n) and a b (mod m) then a b (mod mn) (12) ϕ (n) is the Euler phi function or totient function dened to be the number of positive integers not exceeding n which are relatively prime to n. (13) For any prime p, ϕ (p) = p 1 (14) If m and n are coprime, then ϕ (m) ϕ (n) = ϕ (mn) (15) Fermat's little Theorem: If p is a prime and a is any integer, then a p a (mod p). If gcd (a, p) = 1, then a p 1 1 (mod p) The Solution. The proof is based on the fact that the modulus n is the product of two numbers which - because they are primes and not equal - are coprime to each other. Proof: From equations (4) and (5) we nd that D (E (m)) = (m e mod n) d mod n = m ed mod n. If we can prove that m = m ed mod n we will be done. We know from equation (3) that ed 1 (mod ϕ (n)). Using (8a), this can be expressed as ϕ (n) ed 1 Since p and q are coprime, we know by (14), that ϕ (n) = ϕ (p) ϕ (q) Therefore we nd ϕ (p) ϕ (q) ed 1 Now we use (6) to split the above expression into two: ϕ (p) ed 1 and ϕ (q) ed 1

9 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 9 This can be rewritten using (8b) : ed 1 = kϕ (p) Since p is prime it follows from (13), that ed 1 = k (p 1) ( ) Now consider the case of any integer m raised to the powered modulo p. We can say that m ed m ed 1+1 (mod p) or m ed ( m ed 1) m (mod p) Substituting ( ) for ed 1 we get m ed ( m k(p 1)) m (mod p) ( ) Since p is prime, we need to consider to cases. Case 1: p and m are coprime, so gcd (p, m) = 1 Fermat's little Theorem (15) tells us that m p 1 1 (mod p) By (10h) we can raise this to the power of any positive integer k to get m k(p 1) 1 k 1 (mod p) Combining this result with ( ) we obtain m ed 1 m (mod p) Case 2: m is an exact multiple of p, so gcd (m, p) = p m to the power of any positive integer will still be divisible by p (if p m then p also divides m ed ) and so we have m ed 0 (mod p) by (10i) Since p divides m and so m 0 (mod p), we have m ed 0 m (mod p) Thus, for all m, m ed m (mod p) By the same argument we can derive that m ed m (mod q). Since p and q are coprime by denition, we can use (11) to combine the above results: m ed m (mod pq) m (mod n)

10 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 10 By symmetry (10e) we nd that m m ed (mod n) Since we limit m to 0 m < n, there will only be one integer solution to this congruence relation. Thus m = m ed (mod n) Worked Example Choose p = 11 and q = 7 n = 11 7 = 77 Calculate ϕ (n) = (11 1) (7 1) = 60 Choose e = 13 Find d with 13 d 1 (mod 60) using the extended Euklidian algorithm: 60 = = = = = = = = = = = = = = = = = = = gcd (e, ϕ (n)) = k ϕ (n) + d e = d 23 (mod 60) d = 37 Encript the message k = 2. c = 2 13 (mod 77) = 8192 (mod 77) = 30 (mod 77) c = 30 Decript the code c = (mod 77) = 2 (mod 77) k = 2. The Chinese Remainder Theorem Applied in the Decription Process of RSA

11 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 11 The decription of RSA requires exponentiation modulo n. The decription eciency increases with smaller values of the exponent d. Since the modulus n used in RSA encription and decription usually is 1024 bit long, the decription requires 1024 squarings modulo n and 512 multiplications modulo n. What you do: Knowing d, p, q calculate m p = c d mod p m q = c d mod q Then, using CRT, solve m m p mod p m m q mod q To solve the congruence, calculate whole numbers y p and y q with y p p + y q q = 1 and set m = (m p y q q + m q y p p) mod n. Exercises Easy ones: (use the CRT!). a): Replace stars with digits so that 454** is divisible by 2, 7 and 9 b): Peter prepared some lollipops for his party. If he divides them evenly for ve people, then two pieces will be left over. If he divides them for four people one lollipop will be left. But he can divide them evenly for three people. What the smallest number of lollipops Peter could have had

12 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 12 c): nd solutions of the system: 4x 2 (mod 6) 3x 5 (mod 7) 2x 4 (mod 11) d): 2x 11 (mod 2275) e): mod 840 Five Pirates and a Monkey. Five pirates and a monkey are shipwrecked on an island. The pirates have collected a pile of coconuts which they plan to divide equally among themselves the next morning. Not trusting the others, one pirate wakes up during the night and divides the coconuts into ve equal parts with one left over, which he gives to the monkey. The pirate then hides his portion of the pile. During the night, each of the other pirates does exactly the same thing by dividing the pile he nds into ve equal parts leaving one coconut for the monkey and hiding his portion. In the morning, the pirates gather and split the remaining pile of coconuts into ve equal parts and again one is left over for the monkey. What is the smallest number of coconuts the pirates could have collected for their original pile? Eggs in the Basket. (From Brahmagupta, 7th century A.D.) A girl was carrying a basket of eggs, and a man driving a horse hit the basket and broke all the eggs. Wishing to pay for the damage, he asked the girl how many eggs there were. The girl said she did not know, but she remembered that when she counted them by twos, there was one left over; when she counted them by threes, there were two left over; when she counted them by fours, there were three left over; when she counted them by ves, there were four left; and when she counted them by sixes, there were ve left over. Finally, when she counted them by sevens, there were none left over. `Well,' said the man, `I can tell you how many you had.' What was his answer? Putnam 1955: Do there exist 1, 000, 000 consecutive integers each of which contains a repeated prime factor?

13 THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT 13 Putnam 2006: Alice and Bob play a game in which they take turns removing stones from a heap that initially has n stones. The number of stones removed at each turn must be one less than a prime number. The winner is the player who takes the last stone. Alice plays rst. Prove that there are innitely many n such that Bob has a winning strategy. (For example, if n = 17, then Alice might take 6 leaving 11; then Bob might take 1 leaving 10; then Alice can take the remaining stones to win.)

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

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

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

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

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

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

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

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

Modular Arithmetic. claserken. July 2016

Modular Arithmetic. claserken. July 2016 Modular Arithmetic claserken July 2016 Contents 1 Introduction 2 2 Modular Arithmetic 2 2.1 Modular Arithmetic Terminology.................. 2 2.2 Properties of Modular Arithmetic.................. 2 2.3

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

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

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

Wilson s Theorem and Fermat s Theorem

Wilson s Theorem and Fermat s Theorem Wilson s Theorem and Fermat s Theorem 7-27-2006 Wilson s theorem says that p is prime if and only if (p 1)! = 1 (mod p). Fermat s theorem says that if p is prime and p a, then a p 1 = 1 (mod p). Wilson

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

LECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.

LECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to

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

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

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

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

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

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

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

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

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

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

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

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

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 #: practice MATH Intro to Number Theory midterm: Thursday, Nov 7 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating

More information

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00 18.781 Solutions to Problem Set 6 - Fall 008 Due Tuesday, Oct. 1 at 1:00 1. (Niven.8.7) If p 3 is prime, how many solutions are there to x p 1 1 (mod p)? How many solutions are there to x p 1 (mod p)?

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

ALGEBRA: Chapter I: QUESTION BANK

ALGEBRA: Chapter I: QUESTION BANK 1 ALGEBRA: Chapter I: QUESTION BANK Elements of Number Theory Congruence One mark questions: 1 Define divisibility 2 If a b then prove that a kb k Z 3 If a b b c then PT a/c 4 If a b are two non zero integers

More information

Exam 1 7 = = 49 2 ( ) = = 7 ( ) =

Exam 1 7 = = 49 2 ( ) = = 7 ( ) = Exam 1 Problem 1. a) Define gcd(a, b). Using Euclid s algorithm comute gcd(889, 168). Then find x, y Z such that gcd(889, 168) = x 889 + y 168 (check your answer!). b) Let a be an integer. Prove that gcd(3a

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

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

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

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

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

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

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

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

Practice Midterm 2 Solutions

Practice Midterm 2 Solutions Practice Midterm 2 Solutions May 30, 2013 (1) We want to show that for any odd integer a coprime to 7, a 3 is congruent to 1 or 1 mod 7. In fact, we don t need the assumption that a is odd. By Fermat s

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

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

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

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

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

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

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

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

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

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

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

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

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

MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005

MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005 MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005 Deartment of Mathematical and Statistical Sciences University of Alberta Question 1. Find integers

More information

Discrete Mathematics & Mathematical Reasoning Multiplicative Inverses and Some Cryptography

Discrete Mathematics & Mathematical Reasoning Multiplicative Inverses and Some Cryptography Discrete Mathematics & Mathematical Reasoning Multiplicative Inverses and Some Cryptography Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete

More information

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.

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. Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively rime ositive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). c) Find the remainder of 1 008

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

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

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

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

Implementation / Programming: Random Number Generation

Implementation / Programming: Random Number Generation Introduction to Modeling and Simulation Implementation / Programming: Random Number Generation OSMAN BALCI Professor Department of Computer Science Virginia Polytechnic Institute and State University (Virginia

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

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

Solutions for the 2nd Practice Midterm

Solutions for the 2nd Practice Midterm Solutions for the 2nd Practice Midterm 1. (a) Use the Euclidean Algorithm to find the greatest common divisor of 44 and 17. The Euclidean Algorithm yields: 44 = 2 17 + 10 17 = 1 10 + 7 10 = 1 7 + 3 7 =

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

Number-Theoretic Algorithms

Number-Theoretic Algorithms Number-Theoretic Algorithms Hengfeng Wei hfwei@nju.edu.cn March 31 April 6, 2017 Hengfeng Wei (hfwei@nju.edu.cn) Number-Theoretic Algorithms March 31 April 6, 2017 1 / 36 Number-Theoretic Algorithms 1

More information

An elementary study of Goldbach Conjecture

An elementary study of Goldbach Conjecture An elementary study of Goldbach Conjecture Denise Chemla 26/5/2012 Goldbach Conjecture (7 th, june 1742) states that every even natural integer greater than 4 is the sum of two odd prime numbers. If we

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

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

Discrete Square Root. Çetin Kaya Koç Winter / 11

Discrete Square Root. Çetin Kaya Koç  Winter / 11 Discrete Square Root Çetin Kaya Koç koc@cs.ucsb.edu Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2017 1 / 11 Discrete Square Root Problem The discrete square root problem is defined as the computation

More information

12. Let Rm = {0,1,2,..., m 1} be a complete residue system modulo ra. Let a be an integer. When is a Rm = {0,1 a, 2 a,...

12. Let Rm = {0,1,2,..., m 1} be a complete residue system modulo ra. Let a be an integer. When is a Rm = {0,1 a, 2 a,... 12. Let Rm = {0,1,2,..., m 1} be a complete residue system modulo ra. Let a be an integer. When is a Rm = {0,1 a, 2 a,..., a (ra - 1)} a complete residue system modulo m? Prove your conjecture. (Try m

More information

ON SPLITTING UP PILES OF STONES

ON SPLITTING UP PILES OF STONES ON SPLITTING UP PILES OF STONES GREGORY IGUSA Abstract. In this paper, I describe the rules of a game, and give a complete description of when the game can be won, and when it cannot be won. The first

More information

Constructions of Coverings of the Integers: Exploring an Erdős Problem

Constructions of Coverings of the Integers: Exploring an Erdős Problem Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions

More information

ON THE EQUATION a x x (mod b) Jam Germain

ON THE EQUATION a x x (mod b) Jam Germain ON THE EQUATION a (mod b) Jam Germain Abstract. Recently Jimenez and Yebra [3] constructed, for any given a and b, solutions to the title equation. Moreover they showed how these can be lifted to higher

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

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

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

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

Overview. The Big Picture... CSC 580 Cryptography and Computer Security. January 25, Math Basics for Cryptography

Overview. The Big Picture... CSC 580 Cryptography and Computer Security. January 25, Math Basics for Cryptography CSC 580 Cryptography and Computer Security Math Basics for Cryptography January 25, 2018 Overview Today: Math basics (Sections 2.1-2.3) To do before Tuesday: Complete HW1 problems Read Sections 3.1, 3.2

More information

Number Theory for Cryptography

Number Theory for Cryptography Number Theory for Cryptography 密碼學與應用 海洋大學資訊工程系 丁培毅 Congruence Modulo Operation: Question: What is 12 mod 9? Answer: 12 mod 9 3 or 12 3 (mod 9) 12 is congruent to 3 modulo 9 Definition: Let a, r, m (where

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

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

6.2 Modular Arithmetic

6.2 Modular Arithmetic 6.2 Modular Arithmetic Every reader is familiar with arithmetic from the time they are three or four years old. It is the study of numbers and various ways in which we can combine them, such as through

More information

by Michael Filaseta University of South Carolina

by Michael Filaseta University of South Carolina by Michael Filaseta University of South Carolina Background: A covering of the integers is a system of congruences x a j (mod m j, j =, 2,..., r, with a j and m j integral and with m j, such that every

More information

The covering congruences of Paul Erdős. Carl Pomerance Dartmouth College

The covering congruences of Paul Erdős. Carl Pomerance Dartmouth College The covering congruences of Paul Erdős Carl Pomerance Dartmouth College Conjecture (Erdős, 1950): For each number B, one can cover Z with finitely many congruences to distinct moduli all > B. Erdős (1995):

More information

ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey

ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey Shah [1] and Bruckner [2] have considered the problem

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

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

Goldbach Conjecture (7 th june 1742)

Goldbach Conjecture (7 th june 1742) Goldbach Conjecture (7 th june 1742) We note P the odd prime numbers set. P = {p 1 = 3, p 2 = 5, p 3 = 7, p 4 = 11,...} n 2N\{0, 2, 4}, p P, p n/2, q P, q n/2, n = p + q We call n s Goldbach decomposition

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

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

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

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining

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

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees. 7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}

More information

1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =

1 = 3 2 = 3 ( ) = = = 33( ) 98 = = = Math 115 Discrete Math Final Exam December 13, 2000 Your name It is important that you show your work. 1. Use the Euclidean algorithm to solve the decanting problem for decanters of sizes 199 and 98. In

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