# U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, Notes on Algebra

Save this PDF as:

Size: px
Start display at page:

Download "U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra"

## Transcription

1 U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory book on algebra will contain proofs and put the results in a more general, and more beautiful framework. For example, a book by Childs [C95] covers all the required material without getting too abstract. It also points out the cryptographic applications. 1 Prime Numbers By integer, we mean a positive or negative integer. We denote by Z the set on integers Z = {..., 3, 2, 1, 0, 1, 2, 3,...}. A natural number is a non-negative integer. We denote by N the set of natural numbers N = {0, 1, 2, 3...}. We also denote by Z + the set Z + = {1, 2, 3,...} of positive integers. For an integer n, we denote by n the length of n, i.e. the number of bits needed to represent it, i.e. n = log 2 n. Logarithms will always be to the base 2, so we will omit the base hereafter. We will denote by ln n the natural logarithm of n, i.e. the logarithm taken to the base e = For integers k, n, we say that k divides n (or that k is divisor of n) if n is a multiple of k. For example 5 divides 35. We write k n when k divides n. A prime number is a positive integer p 2 whose only divisors are 1 and p. Notice that 2 is the only even prime number. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,.... When a number is not prime, it is called composite. A composite can always be written (in a unique way) as a product of primes, possibly with repetitions. E.g. 300 = There are infinitely many prime numbers (which is very easy to prove), and in fact there are quite a lot of them (which is harder to prove). Specifically, if we define π(n) to be the number of prime numbers p such that 2 p n, then π(n) is about n/ ln n. Formally Theorem 1 (Prime Numbers Theorem) lim n The following bounds are also known π(n) n/ ln n = 1 1

2 and, for n 17, π(n) n ln n π(n) n ln n There is an efficient randomized algorithm that on input an integer tests whether it is prime or not. Therefore if we want to generate a large prime (in the interval from 1 to n, where n can be thought of as a number around ) we can just pick a random number in the set {1,..., n = } and then test whether it is prime. If it is not, we try again. Each time we have a probability 1/ ln n 1/460 of succeeding, so we expect to succeed after less than 500 attempts. Big prime numbers are very important in applied cryptography, and the Prime Number Theorem is a very useful tools to analyze certain cryptographic protocols. The Prime Number Theorem has exceedingly difficult proofs, but it is easy to prove at least that there are infinitely many primes. Suppose, by contradiction, that there are only finitely many primes, and let them be p 1,..., p n. Consider the number m = p 1 p 2 p n + 1. Since m is bigger than any prime, it must be composite, and hence it must be divisible by some prime. We note that m is not divisible by p 1, as when we divide m by p 1 we get the quotient p 2 p n and the remainder 1. Similarly, m is not divisible by p 2, neither by p 3,..., neither by p n. So we get a contradiction. 2 Modular Arithmetic Let a, n be integers (n 2). If we try to divide a by n using the grade-school algorithm we end up with two numbers q and r (the quotient and the remainder) such that aq + r = n and 0 r n 1. For example, if we divide 15 by 7 we get a quotient 2 and a remainder 1 and the equation = 15. Such numbers q and r are unique. For integers a, b, n we write a = b (mod n) if a and b have the same remainder when divided by n (equivalently, if a b is a multiple of n). For example 15 = 8 (mod 7). For a fixed integer n, the relation = (mod n) has several properties of ordinary equality. For example, For every a Z, a = a (mod n); For every a, b, c Z, if a = b (mod n) and b = c (mod n), then a = c (mod n); 2

3 For every a, a, b, b Z, if a = a (mod n) and b = b (mod n) then a + b = a + b ; For every a, a, k, k Z, if a = a (mod n) and k = k (mod n), then ak = a k (mod n). The last two properties imply that when we do arithmetic operations modulo n, then we obtain the same result if we replace one term by another one that is equal modulo n. In particular, it is the same if every term a is replaced by the remainder of its division by n. So, when doing operations modulo n, we can restrict ourselves to use only the integers 0,..., n 1. We denote by Z n = {0, 1,..., n 1}, and we define on this set operations of addition and multiplication modulo n. Therefore, for every two elements a, b Z n we define the element a + b (mod n), which is defined as the (unique) element c of Z n such that c = a + b (mod n). For example, = 2 (mod 7) and = 0 (mod 3). Similarly, we define a product operation in Z n. For example, 3 4 = 3 (mod 9). Addition in Z n is invertible. Specifically, for each element a Z n there is an element a Z n such that a + a = 0 (mod n) (one can take a = n a). This gives an analog in Z n of the subtraction operation. Multiplication, alas, is not necessarily invertible. That is, it is not necessarily true that for an element a Z n there is an element a Z n such that a a = 1 (mod n). Consider for example Z 6 and the element 2. If there was an element a Z 6 such that 2 a = 1, then we would have 3 2 a = 3 1 = 3 (mod 6). But we also have 3 2 a = 6 a = 0 a = 0 (mod 6), and so we have a contradiction. It is possible to characterize precisely the cases where an element a has an inverse with respect to multiplication in Z n. To this aim, we need a result that is also useful for its algorithmic aspect. Recall that the greatest common divisor (abbreviated gcd) of two numbers n and m is the largest integer that is both a divisor of n and a divisor of m. Theorem 2 (Euclid s algorithm) There exists an algorithm that on input two positive integers m and n returns k = gcd(m, n) and two integers α, β such that αn + βm = k. The algorithm runs in time polynomial in the number of digits of n and m. Example 3 On input 14 and 10, Euclid s algorithm returns 2 = gcd(10, 14) and the coefficients α = 3 and β = 2. Indeed, = 2. Example 4 On input 60 and 17, Euclid s algorithm returns 1 = gcd(60, 17) and the coefficients α = 2 and β = 7. Indeed, = 1. 3

4 Let us return to the issue of inverses in Z n. Suppose a and n are such that gcd(a, n) = k > 1, we will show that a cannot have an inverse. Let us call b = n/k. Note that b Z n, b 0. Assume by contradiction that there exists a Z n such that a a = 1 (mod n), then b (a a ) = b (mod n), but also (doing operations over the integers now) b a a = (n/k) a a = n (a/k) a which is a multiple of n (since a/k is an integer), and therefore we have (b a) a = 0 (mod n). Consider now the case gcd(a, n) = 1. Then, using Euclid s algorithm, we can find coefficients α, β such that αa+βn = 1, that is αa = 1 (mod n), that is α is an inverse of a. In this case not only does a have an inverse, but we can also find it efficiently using Euclid s algorithm. We say that two integers n and m are co-prime if gcd(n, m) = 1. Putting everything together we have Theorem 5 For an element a Z n, there exists an element a Z n such that a a = 1 (mod n) if and only if a and n are co-prime. 3 Groups Definition 6 (Group) A group is a set G endowed with an operation, that we denote, say, by, that given two elements of G returns an element of G (i.e. for every a, b G, (a b) G; the operation must satisfy the following properties: 1. For every a, b G, a b = b a; 2. For every a, b, c G, (a b) c = a (b c); 3. There exists an element u G such that for every a G, a u = u a = a; 4. For every element a G there exists an element a G such that a a = u. Remark 7 To be precise, what we have just defined is the notion of Abelian group, that is a special type of groups. In general, G can be a group even if Property 1 is not satisfied (in such a case, it will be called a non-abelian group). In this course we will never consider non-abelian group, so it is not necessary to insist on the difference. An example of a non-abelian group is the set of n n matrices, together with the matrix multiplication operation. Our canonical example of a group is Z n with the operation + (mod n). Here is another interesting example. For a prime p, define Z p = {1, 2,..., p 1}. Theorem 8 If p is a prime, then Z p together with multiplication (mod p) is a group. 4

5 To prove the theorem we have to check the required properties of a group. First of all, it is definitely true that a b = b a (mod p) and that a (b c) = (a b) c (mod p). Furthermore we have a special element u, namely 1, such that a 1 = 1 a = a (mod p). Using the results of the previous section, and the fact that a prime number is co-prime with every other number small than itself, we also have that for every a Z p there is an a Z p such that a a = 1 (mod p). In fact, we should also check one more property, namely that for every a, b Z p it is true that a b (mod p) Z p, i.e. that is impossible that a b = 0 (mod p). This follows by contradiction: if a b = 0 (mod p), this means that a b (taking the product over the integers) is a multiple of p. Since p is a prime number, it means that either a or b is a multiple of p. But both a and b are smaller than p, and so we have a contradiction. It would be nice to have a similar result for arbitrary n, and say that Z n {0} is a group with respect to multiplication (mod n). Unfortunately this is not true when n is a composite number (elements of Z n having some common factor with n do not have an inverse, as seen in the previous section). Yet, it is still possible to define a group. Define Z n = {a : 1 a n 1 and gcd(a, n) = 1}. For example, Z 6 = {1, 5} and Z 10 = {1, 3, 7, 9}. Note that the definition of Z p for p prime is a special case of the previous definition. Theorem 9 For every positive integer n, Z n is a group with respect to multiplication. We denote by φ(n) the number of elements of Z n, i.e. the number of elements of {1, 2,..., n 1} that are co-prime with n. It is easy to compute φ(n) given a factorization of n (but is hard otherwise). Theorem If p is prime and k 1 then φ(p k ) = (p 1)p k If n and m are co-prime then φ(nm) = φ(n)φ(m). 3. If the factorization of n is i qk i i then φ(n) = i (q i 1)q k i 1 i. Note that the third item in the theorem follows from the first two. Example 11. In order to compute φ(45) we compute the factorization 45 = and then we apply the formula φ(45) = 3 (3 1) 2 1 (5 1) = 24. Indeed, we can check that Z 45 = {1, 2, 4, 7, 8, 11, 13, 14, 16, 17, 19, 22, 23, 26, 28, 29, 31, 32, 34, 37, 38, 41, 43, 44} has 24 elements. 5

6 For every n, the group Z n with respect to the sum has the following nice property: every element k Z n can be obtained by summing 1 to itself k times. One can define a generalization of this property for arbitrary groups. Definition 12 let G be a group with n elements and operation. exists an element g G such that g, g g, g g g,..., g g g } {{ } n times Suppose there are all different (and so cover all the elements of G). Then G is said to be cyclic and g is said to be a generator of G. Therefore Z n is always cyclic and 1 is a generator. Quite interestingly, there is a similar result for Z p, p prime. Theorem 13 For every prime p, Z p is a cyclic wit respect to multiplication (mod p). We denote by a k (mod n) the value a a a } {{ } k times (mod n). Example 14 The group Z 7 has generators 3 and 5. Indeed, we have 3 1 = 3 (mod 7), 3 2 = 2 (mod 7), 3 3 = 6 (mod 7), 3 4 = 4 (mod 7), 3 5 = 5 (mod 7), 3 6 = 1 (mod 7) The sequence of powers of 5 is 5, 4, 6, 2, 3, 1. The following results are useful in the analysis of RSA. Theorem 15 (Fermat s Little Theorem) If p is a prime and a Z p, then a p 1 = 1 (mod p). Fermat s theorem is a special case of the following result. Theorem 16 (Euler s theorem) If n 2 and a Z n, then a φ(n) = 1 (mod n). In fact the definition of the function φ() is due to Euler. Some of our interest in the notions of cyclic groups and generators is related to the exponentiation function (a candidate one-way function). In that application, one has to be able to generate at random a generator of a group Z p (p prime). For this random generation, it is important to be able to test whether a given element is a generator and to know how many elements are generators. 6

7 Given n, a Z n and the factorization of φ(n), there is an efficient algorithm that checks whether a is a generator for Z n. (By efficient algorithm we mean an algorithm that runs in time polynomial in the number of digits of n and a and in the number of bits needed to represent the factorization of φ(n), which is polynomial in the number of digits of n anyway.) Furthermore, the following results guarantee that there are several generators. Theorem 17 For a prime p, Z p has φ(p 1) generators. Theorem 18 For every n, φ(n) n/6 ln ln n. Using the prime number theorem, it is a triviality to prove (for n 17) the weaker bound φ(n) (n 1) log n. Indeed, there are π(n 1) (n 1) primes in the ln(n 1) ln(n 1) interval 2,..., n 1, and all of them are co-prime with n, except those that are factors of n. But n has at most log n factors. 4 Some more algorithmic tools 4.1 The Chinese Remainders Theorem The following is a very useful algorithmic result. Theorem 19 (Chinese Remainders Theorem) Consider a system of congruences of the form x = a 1 (mod n 1 ) x = a 2 (mod n 1 ) x = a k (mod n k ) Where n 1,..., n k are pairwise co-prime. Then there is always a solution x in the interval 1,..., n 1 n 2 n k 1, and this solution is the only one in the interval. Such a solution x is efficiently computable given a 1,..., a k, n 1,..., n k. Furthermore, the set of all solutions is precisely the set of integers y such that y = x (mod n 1 n 2 n k ). For example, consider the system x = 5 (mod 7) x = 2 (mod 6) x = 1 (mod 5) 7

8 Then: x = 26 is a solution; 26 it is the only solution in the interval 1,..., 209; for every integer i we have that i is a solution; there is no other solution. The algorithm to find the solution is simple. Let us call N = n 1 n 2 n k and N i = N/n i. Let us also call y i = (N i ) 1 (mod n i ), that is, y i is such that y i N i = 1 (mod n i ). By our assumptions on n 1,..., n k it must be that gcd(n i, n i ) = 1, so y i is well defined. Then a solution to the system is k a i N i y i (mod n 1 n 2 n k ) i=1 4.2 Quadratic Residues A (positive) integer x is said to be a perfect square if there is some integer y Z such that x = y 2 ; if so, y is said to be a square root of x. For example 25 is a perfect square, whose square roots are 5 and 5, while 20 is not a perfect square. If an integer x is a perfect square then it has precisely two square roots, and they are efficiently computable given x. Unfortunately, things are not so easy with modular arithmetic. Definition 20 An element x Z n is said to be a quadratic residue (mod n) if there exists an element y Z n such that x = y y (mod n). If so, y is said to be a square root of x (mod n). Let us first consider the case of Z p with p prime. Then things are not too different from the case of the integers. Theorem 21 Let p be a prime number. If x Z p (x 0) is a quadratic residue, then it has exactly two square roots. Theorem 22 There exists an efficient randomized algorithm that on input p prime and x Z p tests whether x is a quadratic residue and, if so, returns the two square roots of x. Among the integers, perfect squares are quite rare, and they get sparser and sparser: there are only about n perfect squares in the interval 1,..., n. The situation is quite different in the case of Z p. Theorem 23 Let p 3 be a prime. Then Z p has (p 1)/2 non-zero quadratic residues. 8

9 This is easy to see: each one of the p 1 element y 0 is the square root of y y, on the other hand every quadratic residue has two square roots, and so there must be (p 1)/2 quadratic residues. When we are in Z n the situation gets more involved, and it is conjectures that no efficient algorithm, on input x and n, can determine whether x is a quadratic residue, let alone find a root. The same conjecture holds when n is the product of two large primes. On the other hand, if n = pq is the product of two primes, and the factorization of n is known, then extracting square roots becomes feasible. The next two results are proved using the Chinese Remainders Theorem. The algorithm of Theorem 25 uses the algorithm of Theorem 22 as a subroutine. Theorem 24 Let n be the product of two primes. (mod n), then x has precisely 4 square roots in Z n. If x is a quadratic residue Theorem 25 There is an efficient randomized algorithm that on input (x, p, q) (where p and q are prime and x Z pq ) tests whether x is a quadratic residue (mod pq); if so, the algorithm finds all the four square roots of x. References [C95] L.N. Childs. A Concrete Introduction to Higher Algebra (second edition). Springer,

### Primality - Factorization

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

### 8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

### MTH 382 Number Theory Spring 2003 Practice Problems for the Final

MTH 382 Number Theory Spring 2003 Practice Problems for the Final (1) Find the quotient and remainder in the Division Algorithm, (a) with divisor 16 and dividend 95, (b) with divisor 16 and dividend -95,

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### b) Find smallest a > 0 such that 2 a 1 (mod 341). Solution: a) Use succesive squarings. We have 85 =

Problem 1. Prove that a b (mod c) if and only if a and b give the same remainders upon division by c. Solution: Let r a, r b be the remainders of a, b upon division by c respectively. Thus a r a (mod c)

### (x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find

### Solutions to Practice Problems

Solutions to Practice Problems March 205. Given n = pq and φ(n = (p (q, we find p and q as the roots of the quadratic equation (x p(x q = x 2 (n φ(n + x + n = 0. The roots are p, q = 2[ n φ(n+ ± (n φ(n+2

### Lecture 13: Factoring Integers

CS 880: Quantum Information Processing 0/4/0 Lecture 3: Factoring Integers Instructor: Dieter van Melkebeek Scribe: Mark Wellons In this lecture, we review order finding and use this to develop a method

### Practice Problems for First Test

Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.-

### Is this number prime? Berkeley Math Circle Kiran Kedlaya

Is this number prime? Berkeley Math Circle 2002 2003 Kiran Kedlaya Given a positive integer, how do you check whether it is prime (has itself and 1 as its only two positive divisors) or composite (not

### Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

### Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

### NUMBER THEORY AMIN WITNO

NUMBER THEORY AMIN WITNO ii Number Theory Amin Witno Department of Basic Sciences Philadelphia University JORDAN 19392 Originally written for Math 313 students at Philadelphia University in Jordan, this

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### Computer and Network Security

MIT 6.857 Computer and Networ Security Class Notes 1 File: http://theory.lcs.mit.edu/ rivest/notes/notes.pdf Revision: December 2, 2002 Computer and Networ Security MIT 6.857 Class Notes by Ronald L. Rivest

### Discrete Mathematics, Chapter 4: Number Theory and Cryptography

Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Cryptography and Network Security Number Theory

Cryptography and Network Security Number Theory Xiang-Yang Li Introduction to Number Theory Divisors b a if a=mb for an integer m b a and c b then c a b g and b h then b (mg+nh) for any int. m,n Prime

### MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins

MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins The RSA encryption scheme works as follows. In order to establish the necessary public

### Congruences. Robert Friedman

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### Further linear algebra. Chapter I. Integers.

Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### Chapter 9. Computational Number Theory. 9.1 The basic groups Integers mod N Groups

Chapter 9 Computational Number Theory 9.1 The basic groups We let Z = {..., 2, 1,0,1,2,...} denote the set of integers. We let Z + = {1,2,...} denote the set of positive integers and N = {0,1,2,...} the

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

### Mathematics of Cryptography

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

### 2 The Euclidean algorithm

2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In

### Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition

### Mathematics of Cryptography

Number Theory Modular Arithmetic: Two numbers equivalent mod n if their difference is multiple of n example: 7 and 10 are equivalent mod 3 but not mod 4 7 mod 3 10 mod 3 = 1; 7 mod 4 = 3, 10 mod 4 = 2.

### CIS 5371 Cryptography. 8. Encryption --

CIS 5371 Cryptography p y 8. Encryption -- Asymmetric Techniques Textbook encryption algorithms In this chapter, security (confidentiality) is considered in the following sense: All-or-nothing secrecy.

### 3. Applications of Number Theory

3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

3. QUADRATIC CONGRUENCES 3.1. Quadratics Over a Finite Field We re all familiar with the quadratic equation in the context of real or complex numbers. The formula for the solutions to ax + bx + c = 0 (where

### Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,

### Orders Modulo A Prime

Orders Modulo A Prime Evan Chen March 6, 2015 In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### Cryptography and Network Security Chapter 8

Cryptography and Network Security Chapter 8 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 8 Introduction to Number Theory The Devil said to Daniel Webster:

### 1 Die hard, once and for all

ENGG 2440A: Discrete Mathematics for Engineers Lecture 4 The Chinese University of Hong Kong, Fall 2014 6 and 7 October 2014 Number theory is the branch of mathematics that studies properties of the integers.

### FACTORING. n = 2 25 + 1. fall in the arithmetic sequence

FACTORING The claim that factorization is harder than primality testing (or primality certification) is not currently substantiated rigorously. As some sort of backward evidence that factoring is hard,

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### Cryptography: RSA and the discrete logarithm problem

Cryptography: and the discrete logarithm problem R. Hayden Advanced Maths Lectures Department of Computing Imperial College London February 2010 Public key cryptography Assymmetric cryptography two keys:

### Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)

Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the

### Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### Prime Numbers The generation of prime numbers is needed for many public key algorithms:

CA547: CRYPTOGRAPHY AND SECURITY PROTOCOLS 1 7 Number Theory 2 7.1 Prime Numbers Prime Numbers The generation of prime numbers is needed for many public key algorithms: RSA: Need to find p and q to compute

### Mathematics of Cryptography Part I

CHAPTER 2 Mathematics of Cryptography Part I (Solution to Odd-Numbered Problems) Review Questions 1. The set of integers is Z. It contains all integral numbers from negative infinity to positive infinity.

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### Lecture 1: Elementary Number Theory

Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers

### Finite Fields and Error-Correcting Codes

Lecture Notes in Mathematics Finite Fields and Error-Correcting Codes Karl-Gustav Andersson (Lund University) (version 1.013-16 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents

### Overview of Number Theory Basics. Divisibility

Overview of Number Theory Basics Murat Kantarcioglu Based on Prof. Ninghui Li s Slides Divisibility Definition Given integers a and b, b 0, b divides a (denoted b a) if integer c, s.t. a = cb. b is called

### Basic Algorithms In Computer Algebra

Basic Algorithms In Computer Algebra Kaiserslautern SS 2011 Prof. Dr. Wolfram Decker 2. Mai 2011 References Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, 1993. Cox, D.; Little,

### ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give

### ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

### PYTHAGOREAN TRIPLES PETE L. CLARK

PYTHAGOREAN TRIPLES PETE L. CLARK 1. Parameterization of Pythagorean Triples 1.1. Introduction to Pythagorean triples. By a Pythagorean triple we mean an ordered triple (x, y, z) Z 3 such that x + y =

### Definition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.

Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### Arithmetic algorithms for cryptology 5 October 2015, Paris. Sieves. Razvan Barbulescu CNRS and IMJ-PRG. R. Barbulescu Sieves 0 / 28

Arithmetic algorithms for cryptology 5 October 2015, Paris Sieves Razvan Barbulescu CNRS and IMJ-PRG R. Barbulescu Sieves 0 / 28 Starting point Notations q prime g a generator of (F q ) X a (secret) integer

### Today s Topics. Primes & Greatest Common Divisors

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### CHAPTER 3 THE NEW MMP CRYPTO SYSTEM. mathematical problems Hidden Root Problem, Discrete Logarithm Problem and

79 CHAPTER 3 THE NEW MMP CRYPTO SYSTEM In this chapter an overview of the new Mixed Mode Paired cipher text Cryptographic System (MMPCS) is given, its three hard mathematical problems are explained, and

### Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

### Number Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures

Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it

### Ideal Class Group and Units

Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

### EULER S THEOREM. 1. Introduction Fermat s little theorem is an important property of integers to a prime modulus. a p 1 1 mod p.

EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If

### MATH 168: FINAL PROJECT Troels Eriksen. 1 Introduction

MATH 168: FINAL PROJECT Troels Eriksen 1 Introduction In the later years cryptosystems using elliptic curves have shown up and are claimed to be just as secure as a system like RSA with much smaller key

### Solutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2)

Solutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2) Problems from 21 211 Prove that a b (mod n) if and only if a and b leave the same remainder when divided by n Proof Suppose a

### Modular arithmetic. x ymodn if x = y +mn for some integer m. p. 1/??

p. 1/?? Modular arithmetic Much of modern number theory, and many practical problems (including problems in cryptography and computer science), are concerned with modular arithmetic. While this is probably

### 9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role

### Integers and division

CS 441 Discrete Mathematics for CS Lecture 12 Integers and division Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Symmetric matrix Definition: A square matrix A is called symmetric if A = A T.

### Study of algorithms for factoring integers and computing discrete logarithms

Study of algorithms for factoring integers and computing discrete logarithms First Indo-French Workshop on Cryptography and Related Topics (IFW 2007) June 11 13, 2007 Paris, France Dr. Abhijit Das Department

### Computing exponents modulo a number: Repeated squaring

Computing exponents modulo a number: Repeated squaring How do you compute (1415) 13 mod 2537 = 2182 using just a calculator? Or how do you check that 2 340 mod 341 = 1? You can do this using the method

### 4. Number Theory (Part 2)

4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.

### MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS

MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS Class Meetings: MW 2:00-3:15 pm in Physics 144, September 7 to December 14 [Thanksgiving break November 23 27; final exam December 21] Instructor:

### The Mathematics of the RSA Public-Key Cryptosystem

The Mathematics of the RSA Public-Key Cryptosystem Burt Kaliski RSA Laboratories ABOUT THE AUTHOR: Dr Burt Kaliski is a computer scientist whose involvement with the security industry has been through

### Discrete Square Root. Koç (http://cs.ucsb.edu/~koc) ucsb cs 178 intro to crypto winter / 11

Discrete Square Root Çetin Kaya Koç http://cs.ucsb.edu/~koc/cs178 koc@cs.ucsb.edu Koç (http://cs.ucsb.edu/~koc) ucsb cs 178 intro to crypto winter 2013 1 / 11 Discrete Square Root Problem The discrete

### Factoring Polynomials

Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### The Laws of Cryptography Cryptographers Favorite Algorithms

2 The Laws of Cryptography Cryptographers Favorite Algorithms 2.1 The Extended Euclidean Algorithm. The previous section introduced the field known as the integers mod p, denoted or. Most of the field

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

### Public-Key Cryptography. Oregon State University

Public-Key Cryptography Çetin Kaya Koç Oregon State University 1 Sender M Receiver Adversary Objective: Secure communication over an insecure channel 2 Solution: Secret-key cryptography Exchange the key

### Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime