# Modulo a Prime Number

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Modulo a Prime Number We have seen that modular arithmetic can both be easier than normal arithmetic (in how powers behave), and more difficult (in that we can t always divide). But when n is a prime number, then modular arithmetic keeps many of the nice properties we are used to with whole numbers. (Recall that a prime number is a whole number, greater than or equal to 2, whose only factors are 1 and itself. So 2, 3, 5, 7, 11 are prime numbers whilst, 6 = 2 3 and 35 = 5 7 aren t.)

2 Inverses, Modulo a Prime Theorem 1 When n is a prime number then it is valid to divide by any non-zero number that is, for each a {1, 2,..., n 1} there is one, and only one, number u {1, 2,..., n 1} such that au = 1 (mod n). Then, dividing by a is the same as mulitplying by u, i.e. division by a is given by the rule For example, in mod 7, we have b a = bu (mod n). 1 1 = 1, 1 2 = 4, 1 3 = 5, 1 4 = 2, 1 5 = 3, 1 6 = 6.

3 Roots of a Polynomial Theorem 2 When n is prime number, then a polynomial of degree k, say a 0 + a 1 x + a 2 x a k x k = 0 (mod n) with a i {0, 1, 2,..., n 1}, has at most k solutions. So it is impossible, when n is a prime, for a quadratic like x 2 1 to have more than 2 roots, as we saw it having in mod 8 arithmetic. Note that a quadratic, like x 2 + x + 1 in mod 2 arithmetic, can have fewer than two roots; but this type of behaviour we have seen before as x = 0 has no solutions amongst the real numbers.

4 Fermat s Little Theorem Theorem 3 When n is a prime number, then a n = a (mod n). for any a. This, in fact, tells us more than Theorem 1; this tells us that when a 0, then dividing by a is the same as multiplying by a n 2, as 1 a = an 2 (mod n). We now have an explicit expression for a s multiplicative inverse.

5 Problems 1. Find 1 1, 1 2, 1 3, 1 4 in mod 5 arithmetic. 2. Check, with n = 7 that Fermat s Little Theorem holds for each value of a = 0, 1, 2, 3, 4, 5, 6 mod Which numbers is it valid to divide by in mod 9 arithmetic? For these numbers find their inverses. 4. How many solutions has x 2 + x = 0 in mod 6 arithmetic? (Try out each of the numbers 0, 1, 2, 3, 4, 5 mod 6.) 5. Find two different ways to factorise x 2 + x in mod 6 arithmetic.

6 Answers 1. In mod 5 arithmetic, the reciprocals are given by 1/1 = 1, 1/2 = 3, 1/3 = 2, 1/4 = 4 (mod 5). 2. Verifying Fermat s Little Theorem, mod 7, we see: 0 7 = 0 (mod 7); (±1) 7 = ±1 (mod 7); (±2) 7 = ±2 7 = ± = ±16 8 = ±2 1 = ±2 (mod 7); (±3) 7 = ±3 7 = ± = ±81 27 = ±4 6 = ±24 = ±3 (mod 7). 3. It is valid to divide by 1, 2, 4, 5, 7, 8 (mod 9). The reciprocals are: 1/1 = 1, 1/2 = 5, 1/4 = 7, 1/5 = 2, 1/7 = 4, 1/8 = In mod 6 arithmetic, x 2 + x takes values 0, 2, 0, 0, 2, 0 (mod 6) when x = 0, 1, 2, 3, 4, 5 (mod 6). So x 2 + x = 0 (mod 6) has four roots 0, 2, 3, x 2 + x factorises in mod 6 arithmetic as: x 2 + x = x(x + 1) = (x + 4)(x + 3) (mod 6).

7 Appendix: Modular Arithmetic is Well-defined. In our earlier definition of addition, subtraction, multiplication and powers in modular arithmetic a subtle check was omitted. Modular arithmetic is about the addition (etc.) of remainders. When we write 1 1 = 1 (mod 2), we are saying that multiplying any two odd numbers results in an odd number. But we haven t proven this anywhere yet; it s very important that it doesn t matter which odd numbers we choose. Let s prove this first: the odd numbers are precisely those that can be put in the form 2k + 1 where k is a whole number. So if we have two of these, 2k and 2k say, their product is (2k 1 + 1)(2k 2 + 1) = 4k 1 k 2 + 2k 1 + 2k = 2(2k 1 k 2 + k 1 + k 2 ) + 1 which we can see is another odd number; we finally see a product of odd numbers is odd, irrespective of the odd numbers chosen.

8 And more generally, we defined the operations of modular arithmetic as a (mod n) + b (mod n) = remainder when a + b is divided by n; a (mod n) b (mod n) = remainder when a b is divided by n; a (mod n) b (mod n) = remainder when a + b is divided by n; (a (mod n)) k = remainder when a k is divided by n. It is important to check that it does not matter which numbers we are choosing from the classes of numbers, a (mod n) and b (mod n). Specifically, we really need to check that if a = A (mod n)) and b = B (mod n) then in mod n arithmetic, we must also have a + b = A + B; a b = A B; ab = AB; a k = A k. The first two lines are easy checks and the third, multiplication, is very similar to the previous calculation with odd numbers.

9 To prove that powers are well-defined in modular arithmetic, suppose that a = A (mod n). As a and A leave the same remainder, then they must be a multiple of n apart, i.e. a = A + cn for some whole number c. So, factorizing first, we have a k A k = (a A) ( a k 1 + Aa k 2 + A 2 a k A k 1) = cn ( a k 1 + Aa k 2 + A 2 a k A k 1) = 0 (mod n), because it is a multiple of n. Hence a k = A k (mod n), and powers are well-defined in modular arithmetic as well.

10 Codes A code is a way of representing words and messages as numbers or symbols. One of the best known examples of a code is the Morse code which represents letters as short sequences of dots and dashes (see below). Note how the code aims to use short codings for commonly used letters like E. A G M S Y 4 B H N T Z 5 C I O U 1 6 D J P V 2 7 E K Q W 3 8 F L R X 4 9 Another well-known codeis the ASCII code used in computing which assigns a number between 0 and 255 to a wide array of symbols (upper and lower case alphabets, punctuation marks, mathematical symbols etc.)

11 ISBN codes The ISBN code (which stands fo International Standard Book Number is a 10-digit number which appears on the back of every book published. For example, the ISBN code of David Acheson s 1089 and All That is It contains information about the language, publisher and title. The last digit of the code is a check digit, which helps combat the problem that the code might be miscommunicated. A ISBN code abcdefghij is set up in such a way that 10a + 9b + 8c + 7d + 6e + 5f + 4g + 3h + 2i + j is divisible by 11. The check digit j can be chosen in the range 0 j 10 so that this is possible in the event that j = 10 then the letter X is used instead.

12 Turning Words into Numbers The reason we need a code is that the RSA encryption, which we will meet later, is based on clockwork arithmetic; we need to be able to convert any message into numbers first, before we can apply modular arithmetic. The following important features will be considered in creating any code: each coded message can be decoded uniquely; the code has limited redundancy i.e the coded message has optimal length; the original message can be recovered in the event of limited transmission errors. There is a standard way in mathematics, called a Huffman code, for turning a message into numbers, in a systematic and efficient way.

13 Example of a Huffman Code Suppose we wish to send a message to a Martian Rover, which understands five commands Stop, Go North, Go West, Go East, Go South. Say that these commands are given with respective probabilities 1 3, 1 6, 1 6, 1 6, 1 6. Then a Huffman code for this might be of the form Command Code Probability Length Stop 00 1/3 2 Go North 010 1/6 3 Go West 011 1/6 3 Go East 10 1/6 2 Go South 11 1/6 2 Average code length = = 21 3 digits per command.

14 Creating a Huffman Code 1 Stop Go North Go West Go East Go South Group the two least likely commands together. Consider these now a single command, with the two probability combined. We have one fewer command now. Repeat this until one command remains. Assign a code to each command, working backwards. Call the last two subsets grouped the 0-group and the other the 1-group. The first code letter of the 0-group will be 0 and the first letter of the 1-group will be 1. Assign to each command a list of 0s and 1s, depending on whether, at various stages, they came from a 0-group or a 1-group.

15 Theorem 4 (Huffman 1952) Huffman codes are: uniquely decipherable. In fact, Huffman codes are more than this: they are instantaneous. Not only can a coded message be uniquely deciphered, it can be done so by reading the coded message number by number, without knowledge of the whole code. compact. This means that the average length of a Huffman-coded message is the best possible using the numbers 0 and 1. More general Huffman codes, using more than just the numbers 0 and 1, can be easily made. The Huffman code has no built in redundancy to deal with transmission errors.

16 Problems 1. Check that the ISBN code is a valid one. 2. I mistakenly wrote down the ISBN code of Codes and Cryptography as , but with one of the digits out by one. Show that this is an incorrect ISBN code. Which numbers may have been wrong and what should they have been? 3. The following coded messages have all been made using the previous Huffman code. Decode their command sequence , , Write down a sequence of 0s and 1s which the Martian Rover couldn t interpret as meaningful commands. 5. By grouping the Rover s commands differently, create a different Huffman code. 6. What is this average code length per command for your new code? 7. Find different decodings of the following Morse Code (with the gaps removed) which do you think is the right one?

17 Answers 1. The ISBN code gives = 209 = The ISBN code gives = 228 = 8 (mod 11). So either the first 7 should have been an 8 (increasing this sum by 3), or the 9 should have been an 8 (decreasing this sum by 8) = North + West + East + South + Stop; = West + West + East + South + Stop; = North + West + Stop + South + South + Stop. 4. Any odd length string of 0s would be meaningless to the rover. 5. Grouping first N & W, then E & S, then N+W & E+S, then all together, we could get the Huffman code: Stop = 0, North = 100, West = 101, East = 110, South = The new code s average length is 1/3 + 3/6 + 3/6 + 3/6 + 3/6 = 7/3 as before. 7. The piece of Morse code could be translated as HEEDRJ, SSBDO, or more likely HELLO.

### Cyclic Codes Introduction Binary cyclic codes form a subclass of linear block codes. Easier to encode and decode

Cyclic Codes Introduction Binary cyclic codes form a subclass of linear block codes. Easier to encode and decode Definition A n, k linear block code C is called a cyclic code if. The sum of any two codewords

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

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

### 9 Modular Exponentiation and Cryptography

9 Modular Exponentiation and Cryptography 9.1 Modular Exponentiation Modular arithmetic is used in cryptography. In particular, modular exponentiation is the cornerstone of what is called the RSA system.

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

### 1) A very simple example of RSA encryption

Solved Examples 1) A very simple example of RSA encryption This is an extremely simple example using numbers you can work out on a pocket calculator (those of you over the age of 35 45 can probably even

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

### Euler s Totient Theorem

Euler s Totient Theorem Misha Lavrov ARML Practice 11/11/2012 Example We want to be able to solve the following type of problem: Problem (VTRMC 2012/4.).. 3 What are the last two digits of 3 33. }{{} 2012

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

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

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

### LESSON 1 PRIME NUMBERS AND FACTORISATION

LESSON 1 PRIME NUMBERS AND FACTORISATION 1.1 FACTORS: The natural numbers are the numbers 1,, 3, 4,. The integers are the naturals numbers together with 0 and the negative integers. That is the integers

### For decimal numbers we have 10 digits available (0, 1, 2, 3, 9) For binary numbers we have 2 digits available, 0 and 1.

Math 167 Ch 17 Review 1 (c) Janice Epstein, 2014 CHAPTER 17 INFORMATION SCIENCE Binary and decimal numbers a short review: For decimal numbers we have 10 digits available (0, 1, 2, 3, 9) 4731 = For binary

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

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

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

### Notes for Recitation 5

6.042/18.062J Mathematics for Computer Science September 24, 2010 Tom Leighton and Marten van Dijk Notes for Recitation 5 1 Exponentiation and Modular Arithmetic Recall that RSA encryption and decryption

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

### Announcements. CS243: Discrete Structures. More on Cryptography and Mathematical Induction. Agenda for Today. Cryptography

Announcements CS43: Discrete Structures More on Cryptography and Mathematical Induction Işıl Dillig Class canceled next Thursday I am out of town Homework 4 due Oct instead of next Thursday (Oct 18) Işıl

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

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

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

### Fibonacci Numbers Modulo p

Fibonacci Numbers Modulo p Brian Lawrence April 14, 2014 Abstract The Fibonacci numbers are ubiquitous in nature and a basic object of study in number theory. A fundamental question about the Fibonacci

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

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

### Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 5

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 5 Modular Arithmetic One way to think of modular arithmetic is that it limits numbers to a predefined range {0,1,...,N

### Outline. Cryptography. Bret Benesh. Math 331

Outline 1 College of St. Benedict/St. John s University Department of Mathematics Math 331 2 3 The internet is a lawless place, and people have access to all sorts of information. What is keeping people

### An Introduction to Hill Ciphers Using Linear Algebra

An Introduction to Hill Ciphers Using inear Algebra Brian Worthington October 26, 2010 University of North Texas MATH 2700.002 1 Contents 1 Introduction 3 1.1 Substitution Ciphers.........................

### The Rabin-Miller Primality Test

The Rabin-Miller Primality Test Fermat Pseudoprimes; The Fermat Primality Test Fermat s Little Theorem allows us to prove that a number is composite without actually factoring it. Fermat s Little Theorem

### for the Bill Hanlon bill@hanlonmath.com

Strategies for Learning the Math Facts Bill Hanlon bill@hanlonmath.com The more sophisticated mental operations in mathematics of analysis, synthesis, and evaluation are impossible without rapid and accurate

### Anybody trying to make unbreakable encryption has to face two realities:

Cryptography The coding theory we met yesterday dealt with issues of encoding messages, typically in text format, into a numeric or symbolic format. This was done with an eye on ensuring: that the coded

### ASS.PROF.DR Thamer Information Theory 4th Class in Communication. Finite Field Arithmetic. (Galois field)

Finite Field Arithmetic (Galois field) Introduction: A finite field is also often known as a Galois field, after the French mathematician Pierre Galois. A Galois field in which the elements can take q

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

### Course notes on Number Theory

Course notes on Number Theory In Number Theory, we make the decision to work entirely with whole numbers. There are many reasons for this besides just mathematical interest, not the least of which is that

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

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

### Coding Theory. Decimal Codes

Coding Theory Massoud Malek Decimal Codes To make error correcting codes easier to use and analyze, it is necessary to impose some algebraic structure on them. It is especially useful to have an alphabet

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### RSA Encryption. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles October 10, 2003

RSA Encryption Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles October 10, 2003 1 Public Key Cryptography One of the biggest problems in cryptography is the distribution of keys.

### Introduction to Modular Arithmetic, the rings Z 6 and Z 7

Introduction to Modular Arithmetic, the rings Z 6 and Z 7 The main objective of this discussion is to learn modular arithmetic. We do this by building two systems using modular arithmetic and then by solving

### The Euclidean algorithm for integers leads to the notion of congruence of two integers modulo a given integer.

Integers Modulo m The Euclidean algorithm for integers leads to the notion of congruence of two integers modulo a given integer. Congruence Modulo m Two integers a and b are congruent modulo m if and only

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

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

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### Consequently, for the remainder of this discussion we will assume that a is a quadratic residue mod p.

Computing square roots mod p We now have very effective ways to determine whether the quadratic congruence x a (mod p), p an odd prime, is solvable. What we need to complete this discussion is an effective

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

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

### Squares and Square Roots

SQUARES AND SQUARE ROOTS 89 Squares and Square Roots CHAPTER 6 6.1 Introduction You know that the area of a square = side side (where side means the length of a side ). Study the following table. Side

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

### 9 abcd = dcba. 9 ( b + 10c) = c + 10b b + 90c = c + 10b b = 10c.

In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

### Topic 1: Cryptography

1 Introduction to Cryptography: 1.1 Science SCIE1000 Project, Semester 1 2011 Topic 1: Cryptography Cryptography is the science of using mathematics to hide information. Cryptography allows us to store

### 3 Congruence arithmetic

3 Congruence arithmetic 3.1 Congruence mod n As we said before, one of the most basic tasks in number theory is to factor a number a. How do we do this? We start with smaller numbers and see if they divide

### Coding Theory. Kenneth H. Rosen, AT&T Laboratories.

5 Coding Theory Author: Kenneth H. Rosen, AT&T Laboratories. Prerequisites: The prerequisites for this chapter are the basics of logic, set theory, number theory, matrices, and probability. (See Sections

### Section 5.1 Number Theory: Prime & Composite Numbers

Section 5.1 Number Theory: Prime & Composite Numbers Objectives 1. Determine divisibility. 2. Write the prime factorization of a composite number. 3. Find the greatest common divisor of two numbers. 4.

### Section 2.1: Shift Ciphers and Modular Arithmetic

1 Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15 The purpose of this section is to learn about modular arithmetic, which

### 3 Structure of Modular Multiplication

3 Structure of Modular Multiplication Unlike addition, multiplication in Z M is fairly strange. There may not always be an inverse, you can multiply two non-zero numbers together and get zero, and in general

### Instructor: Bobby Kleinberg Lecture Notes, 5 May The Miller-Rabin Randomized Primality Test

Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 5 May 2010 The Miller-Rabin Randomized Primality Test 1 Introduction Primality testing is an important

### Faster deterministic integer factorisation

David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011 The obvious mathematical breakthrough would be the development of an easy way to factor large prime numbers

### ALGEBRA HANDOUT 2: IDEALS AND QUOTIENTS. 1. Ideals in Commutative Rings In this section all groups and rings will be commutative.

ALGEBRA HANDOUT 2: IDEALS AND QUOTIENTS PETE L. CLARK 1. Ideals in Commutative Rings In this section all groups and rings will be commutative. 1.1. Basic definitions and examples. Let R be a (commutative!)

### Math 139 Problem Set #6 Solution 15 April 2003

Math 139 Problem Set #6 Solution 15 April 2003 A1 (Based on Barr, 41, exercise 3) (a) Let n be an integer greater than 2 Consider the list of numbers n! + 2, n! + 3, n! + 4,, n! + n Explain why all the

### Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q.

Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational numbers

### Number Systems and Radix Conversion

Number Systems and Radix Conversion Sanjay Rajopadhye, Colorado State University 1 Introduction These notes for CS 270 describe polynomial number systems. The material is not in the textbook, but will

### Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov

Lee 1 Primes in Sequences By: Jae Young Lee Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov Lee 2 Jae Young Lee MA341 Number Theory PRIMES IN SEQUENCES

### Algebra 2. Rings and fields. Finite fields. A.M. Cohen, H. Cuypers, H. Sterk. Algebra Interactive

2 Rings and fields A.M. Cohen, H. Cuypers, H. Sterk A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, 2006 1 / 20 For p a prime number and f an irreducible polynomial of degree n in (Z/pZ)[X ], the quotient

### Mathematics of Internet Security. Keeping Eve The Eavesdropper Away From Your Credit Card Information

The : Keeping Eve The Eavesdropper Away From Your Credit Card Information Department of Mathematics North Dakota State University 16 September 2010 Science Cafe Introduction Disclaimer: is not an internet

### The finite field with 2 elements The simplest finite field is

The finite field with 2 elements The simplest finite field is GF (2) = F 2 = {0, 1} = Z/2 It has addition and multiplication + and defined to be 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 0 0 = 0 0 1 = 0

### Cryptography. Helmer Aslaksen Department of Mathematics National University of Singapore

Cryptography Helmer Aslaksen Department of Mathematics National University of Singapore aslaksen@math.nus.edu.sg www.math.nus.edu.sg/aslaksen/sfm/ 1 Basic Concepts There are many situations in life where

### 1. The RSA algorithm In this chapter, we ll learn how the RSA algorithm works.

MATH 13150: Freshman Seminar Unit 18 1. The RSA algorithm In this chapter, we ll learn how the RSA algorithm works. 1.1. Bob and Alice. Suppose that Alice wants to send a message to Bob over the internet

### NUMBER THEORY AND CRYPTOGRAPHY

NUMBER THEORY AND CRYPTOGRAPHY KEITH CONRAD 1. Introduction Cryptography is the study of secret messages. For most of human history, cryptography was important primarily for military or diplomatic purposes

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

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

### Digital Fundamentals

Digital Fundamentals with PLD Programming Floyd Chapter 2 29 Pearson Education Decimal Numbers The position of each digit in a weighted number system is assigned a weight based on the base or radix of

### 5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

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

### V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography

V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography 3 Congruence Congruences are an important and useful tool for the study of divisibility. As we shall see, they are also critical

### Public Key Cryptography: RSA and Lots of Number Theory

Public Key Cryptography: RSA and Lots of Number Theory Public vs. Private-Key Cryptography We have just discussed traditional symmetric cryptography: Uses a single key shared between sender and receiver

### Chapter 1 Basic Number Concepts

Draft of September 2014 Chapter 1 Basic Number Concepts 1.1. Introduction No problems in this section. 1.2. Factors and Multiples 1. Determine whether the following numbers are divisible by 3, 9, and 11:

### Mathematical Induction

Chapter 2 Mathematical Induction 2.1 First Examples Suppose we want to find a simple formula for the sum of the first n odd numbers: 1 + 3 + 5 +... + (2n 1) = n (2k 1). How might we proceed? The most natural

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### 159.334 Computer Networks. Network Security 1. Professor Richard Harris School of Engineering and Advanced Technology

Network Security 1 Professor Richard Harris School of Engineering and Advanced Technology Presentation Outline Overview of Identification and Authentication The importance of identification and Authentication

### Error Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance

Error Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Error

### ON THE FIBONACCI NUMBERS

ON THE FIBONACCI NUMBERS Prepared by Kei Nakamura The Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. However, despite its simplicity, they have some curious properties

### 3.1. RATIONAL EXPRESSIONS

3.1. RATIONAL EXPRESSIONS RATIONAL NUMBERS In previous courses you have learned how to operate (do addition, subtraction, multiplication, and division) on rational numbers (fractions). Rational numbers

### Hill s Cipher: Linear Algebra in Cryptography

Ryan Doyle Hill s Cipher: Linear Algebra in Cryptography Introduction: Since the beginning of written language, humans have wanted to share information secretly. The information could be orders from a

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

### Information, Entropy, and Coding

Chapter 8 Information, Entropy, and Coding 8. The Need for Data Compression To motivate the material in this chapter, we first consider various data sources and some estimates for the amount of data associated

### Section Summary. Integer Representations. Base Conversion Algorithm Algorithms for Integer Operations

Section 4.2 Section Summary Integer Representations Base b Expansions Binary Expansions Octal Expansions Hexadecimal Expansions Base Conversion Algorithm Algorithms for Integer Operations Representations

### SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

0.7 Quadratic Equations 8 0.7 Quadratic Equations In Section 0..1, we reviewed how to solve basic non-linear equations by factoring. The astute reader should have noticed that all of the equations in that

### 2 When is a 2-Digit Number the Sum of the Squares of its Digits?

When Does a Number Equal the Sum of the Squares or Cubes of its Digits? An Exposition and a Call for a More elegant Proof 1 Introduction We will look at theorems of the following form: by William Gasarch

### Detecting Bit Errors LECTURE 7

MIT 6.02 DRAFT Lecture Notes Fall 2010 (Last update: October 7, 2010) Comments, questions or bug reports? Please contact 6.02-staff@mit.edu LECTURE 7 Detecting Bit Errors These lecture notes discuss some

### MATH 13150: Freshman Seminar Unit 14

MATH 13150: Freshman Seminar Unit 14 1. Powers in mod p arithmetic In this Unit, we will study powers a n (mod p). It will turn out that these are much easier to compute then one would imagine. Let s recall

### PRIME NUMBERS & SECRET MESSAGES

PRIME NUMBERS & SECRET MESSAGES I. RSA CODEBREAKER GAME This is a game with two players or teams. The players take turns selecting either prime or composite numbers as outlined on the board below. The

### MATH 321 EQUIVALENCE RELATIONS, WELL-DEFINEDNESS, MODULAR ARITHMETIC, AND THE RATIONAL NUMBERS

MATH 321 EQUIVALENCE RELATIONS, WELL-DEFINEDNESS, MODULAR ARITHMETIC, AND THE RATIONAL NUMBERS ALLAN YASHINSKI Abstract. We explore the notion of well-definedness when defining functions whose domain is

### Prime numbers for Cryptography

Prime numbers for Cryptography What this is going to cover Primes, products of primes and factorisation How to win a million dollars Generating small primes quickly How many primes are there and how many

### 3. (5%) Use the Euclidean algorithm to find gcd(742, 1908). Sol: gcd(742, 1908) = gcd(742, 424) = gcd(424, 318) = gcd(318, 106) = 106

Mid-term Examination on Discrete Mathematics 1. (4%) Encrypt the message LOVE by translating the letters A through Z into numbers 0 through 25, applying the encryption function f(p) = (3p + 7) (mod 26),