# Chapter 4 Mathematics of Cryptography

Size: px
Start display at page:

Transcription

1 Chapter 4 Mathematics of Cryptography Part II: Algebraic Structures Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4.1

2 Chapter 4 Objectives To review the concept of algebraic structures To define and give some examples of groups To define and give some examples of rings To define and give some examples of fields To emphasize the finite fields of type GF(2 n ) that make it possible to perform operations such as addition, subtraction, multiplication, and division on n-bit words in modern block ciphers 4.2

3 4-1 ALGEBRAIC STRUCTURES Cryptography requires sets of integers and specific operations that are defined for those sets. The combination of the set and the operations that are applied to the elements of the set is called an algebraic structure. In this chapter, we will define three common algebraic structures: groups, rings, and fields. Topics discussed in this section: Groups Rings Fields 4.3

4 4.1 Continued Figure 4.1 Common algebraic structure 4.4

5 4.1.1 Groups A group (G) is a set of elements with a binary operation ( ) that satisfies four properties (or axioms). A commutative group satisfies an extra property, commutativity: Closure: Associativity: Commutativity: Existence of identity: Existence of inverse: 4.5

6 4.1.1 Continued Figure 4.2 Group 4.6

7 4.1.1 Continued Application Although a group involves a single operation, the properties imposed on the operation allow the use of a pair of operations as long as they are inverses of each other. Example 4.1 The set of residue integers with the addition operator, G = < Z n, +>, is a commutative group. We can perform addition and subtraction on the elements of this set without moving out of the set. 4.7

8 4.1.1 Continued Example 4.2 The set Z n * with the multiplication operator, G = <Z n *, >, is also an abelian group. Example 4.3 Let us define a set G = < {a, b, c, d}, > and the operation as shown intable

9 4.1.1 Continued Example 4.4 A very interesting group is the permutation group. The set is the set of all permutations, and the operation is composition: applying one permutation after another. Figure 4.3 Composition of permutation (Exercise 4.4) 4.9

10 4.1.1 Continued Example 4.4 Continued Table 4.2 Operation table for permutation group 4.10

11 4.1.1 Continued Example 4.5 In the previous example, we showed that a set of permutations with the composition operation is a group. This implies that using two permutations one after another cannot strengthen the security of a cipher, because we can always find a permutation that can do the same job because of the closure property. 4.11

12 4.1.1 Continued Finite Group Order of a Group Subgroups 4.12

13 4.1.1 Continued Example 4.6 Is the group H = <Z 10, +> a subgroup of the group G = <Z 12, +>? Solution The answer is no. Although H is a subset of G, the operations defined for these two groups are different. The operation in H is addition modulo 10; the operation in G is addition modulo

14 4.1.1 Continued Cyclic Subgroups If a subgroup of a group can be generated using the power of an element, the subgroup is called the cyclic subgroup. 4.14

15 4.1.1 Continued Example 4.7 Four cyclic subgroups can be made from the group G = <Z 6, +>. They are H 1 = <{0}, +>, H 2 = <{0, 2, 4}, +>, H 3 = <{0, 3}, +>, and H 4 = G. 4.15

16 4.1.1 Continued Example 4.8 Three cyclic subgroups can be made from the group G = <Z 10, >. G has only four elements: 1, 3, 7, and 9. The cyclic subgroups are H 1 = <{1}, >, H 2 = <{1, 9}, >, and H 3 = G. 4.16

17 4.1.1 Continued Cyclic Groups A cyclic group is a group that is its own cyclic subgroup. 4.17

18 4.1.1 Continued Example 4.9 Three cyclic subgroups can be made from the group G = <Z 10, >. G has only four elements: 1, 3, 7, and 9. The cyclic subgroups are H 1 = <{1}, >, H 2 = <{1, 9}, >, and H 3 = G. a. The group G = <Z6, +> is a cyclic group with two generators, g = 1 and g = 5. b. The group G = <Z10, > is a cyclic group with two generators, g = 3 and g =

19 4.1.1 Continued Lagrange s Theorem Assume that G is a group, and H is a subgroup of G. If the order of G and H are G and H, respectively, then, based on this theorem, H divides G. Order of an Element The order of an element is the order of the cyclic group it generates. 4.19

20 4.1.1 Continued Example 4.10 a. In the group G = <Z 6, +>, the orders of the elements are: ord(0) = 1, ord(1) = 6, ord(2) = 3, ord(3) = 2, ord(4) = 3, ord(5) = 6. b. In the group G = <Z 10 *, >, the orders of the elements are: ord(1) = 1, ord(3) = 4, ord(7) = 4, ord(9) =

21 4.1.2 Ring A ring, R = <{ },, >, is an algebraic structure with two operations. Figure 4.4 Ring 4.21

22 4.1.2 Continued Example 4.11 The set Z with two operations, addition and multiplication, is a commutative ring. We show it by R = <Z, +, >. Addition satisfies all of the five properties; multiplication satisfies only three properties. 4.22

23 4.1.3 Field A field, denoted by F = <{ },, > is a commutative ring in which the second operation satisfies all five properties defined for the first operation except that the identity of the first operation has no inverse. Figure 4.5 Field 4.23

24 4.1.3 Continued Finite Fields Galois showed that for a field to be finite, the number of elements should be p n, where p is a prime and n is a positive integer. Note A Galois field, GF(p n ), is a finite field with p n elements. 4.24

25 4.1.3 Continued GF(p) Fields When n = 1, we have GF(p) field. This field can be the set Z p, {0, 1,, p 1}, with two arithmetic operations. 4.25

26 4.1.2 Continued Example 4.12 A very common field in this category is GF(2) with the set {0, 1} and two operations, addition and multiplication, as shown in Figure 4.6. Figure 4.6 GF(2) field 4.26

27 4.1.2 Continued Example 4.13 We can define GF(5) on the set Z 5 (5 is a prime) with addition and multiplication operators as shown in Figure 4.7. Figure 4.7 GF(5) field 4.27

28 4.1.3 Continued Summary Table 4.3 Summary 4.28

29 4-2 GF(2 n ) FIELDS In cryptography, we often need to use four operations (addition, subtraction, multiplication, and division). In other words, we need to use fields. We can work in GF(2 n ) and uses a set of 2 n elements. The elements in this set are n-bit words. Topics discussed in this section: Polynomials Using A Generator Summary 4.29

30 4.2 Continued Example 4.14 Let us define a GF(2 2 ) field in which the set has four 2-bit words: {00, 01, 10, 11}. We can redefine addition and multiplication for this field in such a way that all properties of these operations are satisfied, as shown in Figure 4.8. Figure 4.8 An example of GF(2 2 ) field 4.30

31 4.2.1 Polynomials A polynomial of degree n 1 is an expression of the form where x i is called the ith term and a i is called coefficient of the ith term. 4.31

32 4.2.1 Continued Example 4.15 Figure 4.9 show how we can represent the 8-bit word ( ) using a polynomials. Figure 4.9 Representation of an 8-bit word by a polynomial 4.32

33 4.2.1 Continued Example 4.16 To find the 8-bit word related to the polynomial x 5 + x 2 + x, we first supply the omitted terms. Since n = 8, it means the polynomial is of degree 7. The expanded polynomial is This is related to the 8-bit word

34 4.2.1 Continued GF(2 n ) Fields Note Polynomials representing n-bit words use two fields: GF(2) and GF(2 n ). 4.34

35 4.2.1 Continued Modulus For the sets of polynomials in GF(2 n ), a group of polynomials of degree n is defined as the modulus. Such polynomials are referred to as irreducible polynomials. Table 4.9 List of irreducible polynomials 4.35

36 4.2.1 Continued Addition Note Addition and subtraction operations on polynomials are the same operation. 4.36

37 4.2.1 Continued Example 4.17 Let us do (x 5 + x 2 + x) (x 3 + x 2 + 1) in GF(2 8 ). We use the symbol to show that we mean polynomial addition. The following shows the procedure: 4.37

38 4.2.1 Continued Example 4.18 There is also another short cut. Because the addition in GF(2) means the exclusive-or (XOR) operation. So we can exclusive-or the two words, bits by bits, to get the result. In the previous example, x 5 + x 2 + x is and x 3 + x is The result is or in polynomial notation x 5 + x 3 + x

39 4.2.1 Continued Multliplication 1. The coefficient multiplication is done in GF(2). 2. The multiplying x i by x j results in x i+j. 3. The multiplication may create terms with degree more than n 1, which means the result needs to be reduced using a modulus polynomial. 4.39

40 4.2.1 Continued Example 4.19 Find the result of (x 5 + x 2 + x) (x 7 + x 4 + x 3 + x 2 + x) in GF(2 8 ) with irreducible polynomial (x 8 + x 4 + x 3 + x + 1). Note that we use the symbol to show the multiplication of two polynomials. Solution To find the final result, divide the polynomial of degree 12 by the polynomial of degree 8 (the modulus) and keep only the remainder. Figure 4.10 shows the process of division. 4.40

41 4.2.1 Continued Figure 4.10 Polynomial division with coefficients in GF(2) 4.41

42 4.2.1 Continued Example 4.20 In GF (2 4 ), find the inverse of (x 2 + 1) modulo (x 4 + x + 1). Solution The answer is (x 3 + x + 1) as shown in Table 4.5. Table 4.5 Euclidean algorithm for Exercise

43 4.2.1 Continued Example 4.21 In GF(2 8 ), find the inverse of (x 5 ) modulo (x 8 + x 4 + x 3 + x + 1). Solution The answer is (x 5 + x 4 + x 3 + x) as shown in Table 4.6. Table 4.6 Euclidean algorithm for Exercise

44 4.2.1 Continued Multliplication Using Computer The computer implementation uses a better algorithm, repeatedly multiplying a reduced polynomial by x. 4.44

45 4.2.1 Continued Example 4.22 Find the result of multiplying P 1 = (x 5 + x 2 + x) by P 2 = (x 7 + x 4 + x 3 + x 2 + x) in GF(2 8 ) with irreducible polynomial (x 8 + x 4 + x 3 + x + 1) using the algorithm described above. Solution The process is shown in Table 4.7. We first find the partial result of multiplying x 0, x 1, x 2, x 3, x 4, and x 5 by P 2. Note that although only three terms are needed, the product of x m P 2 for m from 0 to 5 because each calculation depends on the previous result. 4.45

46 4.2.1 Continued Example 4.22 Continued Table 4.7 An efficient algorithm (Example 4.22) 4.46

47 4.2.1 Continued Example 4.23 Repeat Example 4.22 using bit patterns of size 8. Solution We have P1 = , P2 = , modulus = (nine bits). We show the exclusive or operation by. Table 4.8 An efficient algorithm for multiplication using n-bit words 4.47

48 4.2.1 Continued Example 4.24 The GF(2 3 ) field has 8 elements. We use the irreducible polynomial (x 3 + x 2 + 1) and show the addition and multiplication tables for this field. We show both 3-bit words and the polynomials. Note that there are two irreducible polynomials for degree 3. The other one, (x 3 + x + 1), yields a totally different table for multiplication. 4.48

49 4.2.1 Continued Example 4.24 Continued Table 4.9 Addition table for GF(23) 4.49

50 4.2.1 Continued Example 4.24 Continued Table 4.10 Multiplication table for GF(2 3 ) 4.50

51 4.2.2 Using a Generator Sometimes it is easier to define the elements of the GF(2 n ) field using a generator. 4.51

52 4.2.1 Continued Example 4.25 Generate the elements of the field GF(2 4 ) using the irreducible polynomial ƒ(x) = x 4 + x + 1. Solution The elements 0, g 0, g 1, g2, and g 3 can be easily generated, because they are the 4-bit representations of 0, 1, x 2, and x 3. Elements g 4 through g 14, which represent x 4 though x 14 need to be divided by the irreducible polynomial. To avoid the polynomial division, the relation ƒ(g) = g 4 + g + 1 = 0 can be used (See next slide). 4.52

53 4.2.1 Continued Example 4.25 Continued 4.53

54 4.2.1 Continued Example 4.26 The following show the results of addition and subtraction operations: 4.54

55 4.2.1 Continued Example 4.27 The following show the result of multiplication and division operations:. 4.55

56 4.2.3 Summary The finite field GF(2 n ) can be used to define four operations of addition, subtraction, multiplication and division over n-bit words. The only restriction is that division by zero is not defined. 4.56

### Mathematical Foundations of Cryptography

Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography

### Chapter 4 Finite Fields

Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number

### Fields in Cryptography. Çetin Kaya Koç Winter / 30

Fields in Cryptography http://koclab.org Çetin Kaya Koç Winter 2017 1 / 30 Field Axioms Fields in Cryptography A field F consists of a set S and two operations which we will call addition and multiplication,

### Galois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.

Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More

### Finite Fields. SOLUTIONS Network Coding - Prof. Frank H.P. Fitzek

Finite Fields In practice most finite field applications e.g. cryptography and error correcting codes utilizes a specific type of finite fields, namely the binary extension fields. The following exercises

### Finite Fields. Mike Reiter

1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements

### Algebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.

Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for

### A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:

Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under

### ECEN 5682 Theory and Practice of Error Control Codes

ECEN 5682 Theory and Practice of Error Control Codes Introduction to Algebra University of Colorado Spring 2007 Motivation and For convolutional codes it was convenient to express the datawords and the

### Section VI.33. Finite Fields

VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,

### Introduction to Information Security

Introduction to Information Security Lecture 5: Number Theory 007. 6. Prof. Byoungcheon Lee sultan (at) joongbu. ac. kr Information and Communications University Contents 1. Number Theory Divisibility

### Introduction to Modern Cryptography. (1) Finite Groups, Rings and Fields. (2) AES - Advanced Encryption Standard

Introduction to Modern Cryptography Lecture 3 (1) Finite Groups, Rings and Fields (2) AES - Advanced Encryption Standard +,0, and -a are only notations! Review - Groups Def (group): A set G with a binary

### Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations

Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9.1 Chapter 9 Objectives

### Commutative Rings and Fields

Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two

### ECEN 5022 Cryptography

Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,

### Chapter 5. Modular arithmetic. 5.1 The modular ring

Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence

### Introduction to finite fields

Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in

### Mathematics for Cryptography

Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1

### LECTURE NOTES IN CRYPTOGRAPHY

1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic

### Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic. Theoretical Underpinnings of Modern Cryptography

Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic Theoretical Underpinnings of Modern Cryptography Lecture Notes on Computer and Network Security by Avi Kak (kak@purdue.edu) January 26, 2017

### Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications

1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the

### Basic Concepts in Number Theory and Finite Fields

Basic Concepts in Number Theory and Finite Fields Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 4-1 Overview

### Page Points Possible Points. Total 200

Instructions: 1. The point value of each exercise occurs adjacent to the problem. 2. No books or notes or calculators are allowed. Page Points Possible Points 2 20 3 20 4 18 5 18 6 24 7 18 8 24 9 20 10

### COMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162

COMPUTER ARITHMETIC 13/05/2010 cryptography - math background pp. 1 / 162 RECALL OF COMPUTER ARITHMETIC computers implement some types of arithmetic for instance, addition, subtratction, multiplication

### Congruences and Residue Class Rings

Congruences and Residue Class Rings (Chapter 2 of J. A. Buchmann, Introduction to Cryptography, 2nd Ed., 2004) Shoichi Hirose Faculty of Engineering, University of Fukui S. Hirose (U. Fukui) Congruences

### 5 Group theory. 5.1 Binary operations

5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1

### 1. Group Theory Permutations.

1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7

### SEVENTH EDITION and EXPANDED SEVENTH EDITION

SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 10-1 Chapter 10 Mathematical Systems 10.1 Groups Definitions A mathematical system consists of a set of elements and at least one binary operation. A

### Number Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.

Appendix A Number Axioms P. Danziger 1 Number Axioms 1.1 Groups Definition 1 A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b and c S 0. (Closure) 1. (Associativity)

### COMP424 Computer Security

COMP424 Computer Security Prof. Wiegley jeffw@csun.edu Rivest, Shamir & Adelman (RSA) Implementation 1 Relatively prime Prime: n, is prime if its only two factors are 1 and n. (and n 1). Relatively prime:

### Intro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic

Intro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic Priyank Kalla Associate Professor Electrical and Computer Engineering, University of Utah kalla@ece.utah.edu http://www.ece.utah.edu/~kalla

### Computer Algebra for Computer Engineers

p.1/23 Computer Algebra for Computer Engineers Galois Fields: GF(2 m ) Priyank Kalla Department of Electrical and Computer Engineering University of Utah, Salt Lake City p.2/23 Galois Fields A Galois Field

### Section 33 Finite fields

Section 33 Finite fields Instructor: Yifan Yang Spring 2007 Review Corollary (23.6) Let G be a finite subgroup of the multiplicative group of nonzero elements in a field F, then G is cyclic. Theorem (27.19)

### Sample algebra qualifying exam

Sample algebra qualifying exam University of Hawai i at Mānoa Spring 2016 2 Part I 1. Group theory In this section, D n and C n denote, respectively, the symmetry group of the regular n-gon (of order 2n)

### Some Results on the Arithmetic Correlation of Sequences

Some Results on the Arithmetic Correlation of Sequences Mark Goresky Andrew Klapper Abstract In this paper we study various properties of arithmetic correlations of sequences. Arithmetic correlations are

### Latin squares. Clock arithmetic. Modular arithmetic. Binary operations 18/09/2013. Members only an introduction to groups

Members only an introduction to groups Sue de Pomerai MEI (FMSP Deputy rogramme Leader) 1 2 4 2 4 1 4 1 2 4 1 2 Latin squares A Latin square is an n n table filled with n different symbols in such a way

### QUALIFYING EXAM IN ALGEBRA August 2011

QUALIFYING EXAM IN ALGEBRA August 2011 1. There are 18 problems on the exam. Work and turn in 10 problems, in the following categories. I. Linear Algebra 1 problem II. Group Theory 3 problems III. Ring

### Mathematics of Cryptography

UNIT - III Mathematics of Cryptography Part III: Primes and Related Congruence Equations 1 Objectives To introduce prime numbers and their applications in cryptography. To discuss some primality test algorithms

### Groups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002

Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary

### Cryptography Lecture 3. Pseudorandom generators LFSRs

Cryptography Lecture 3 Pseudorandom generators LFSRs Remember One Time Pad is ideal With OTP you need the same transmission capacity via an already secure channel for the key as you can then secure via

### Algebraic Structures Exam File Fall 2013 Exam #1

Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write

### Know the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].

The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive

### 17 Galois Fields Introduction Primitive Elements Roots of Polynomials... 8

Contents 17 Galois Fields 2 17.1 Introduction............................... 2 17.2 Irreducible Polynomials, Construction of GF(q m )... 3 17.3 Primitive Elements... 6 17.4 Roots of Polynomials..........................

### Galois Fields and Hardware Design

Galois Fields and Hardware Design Construction of Galois Fields, Basic Properties, Uniqueness, Containment, Closure, Polynomial Functions over Galois Fields Priyank Kalla Associate Professor Electrical

### Name: Solutions Final Exam

Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of

### Groups in Cryptography. Çetin Kaya Koç Winter / 13

http://koclab.org Çetin Kaya Koç Winter 2017 1 / 13 A set S and a binary operation A group G = (S, ) if S and satisfy: Closure: If a, b S then a b S Associativity: For a, b, c S, (a b) c = a (b c) A neutral

### Rings. EE 387, Notes 7, Handout #10

Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for

### Introduction to Cryptology. Lecture 19

Introduction to Cryptology Lecture 19 Announcements HW6 due today HW7 due Thursday 4/20 Remember to sign up for Extra Credit Agenda Last time More details on AES/DES (K/L 6.2) Practical Constructions of

### List of topics for the preliminary exam in algebra

List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.

### A number that can be written as, where p and q are integers and q Number.

RATIONAL NUMBERS 1.1 Definition of Rational Numbers: What are rational numbers? A number that can be written as, where p and q are integers and q Number. 0, is known as Rational Example:, 12, -18 etc.

A PPENDIX E B ASIC C ONCEPTS FROM L INEAR A LGEBRA William Stallings Copyright 2010 E.1 OPERATIONS ON VECTORS AND MATRICES...2 Arithmetic...2 Determinants...4 Inverse of a Matrix...5 E.2 LINEAR ALGEBRA

### MATH 433 Applied Algebra Lecture 22: Review for Exam 2.

MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric

### ax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d

10. Linear congruences In general we are going to be interested in the problem of solving polynomial equations modulo an integer m. Following Gauss, we can work in the ring Z m and find all solutions to

### CSCE 564, Fall 2001 Notes 6 Page 1 13 Random Numbers The great metaphysical truth in the generation of random numbers is this: If you want a function

CSCE 564, Fall 2001 Notes 6 Page 1 13 Random Numbers The great metaphysical truth in the generation of random numbers is this: If you want a function that is reasonably random in behavior, then take any

### Number Theory and Group Theoryfor Public-Key Cryptography

Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography

### Rings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.

Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary

### Foundations of Cryptography

Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a

### Finite Fields: An introduction through exercises Jonathan Buss Spring 2014

Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence

### Public-key Cryptography: Theory and Practice

Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues

### MATH 310 Course Objectives

MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply

### Lecture 3.1: Public Key Cryptography I

Lecture 3.1: Public Key Cryptography I CS 436/636/736 Spring 2015 Nitesh Saxena Today s Informative/Fun Bit Acoustic Emanations http://www.google.com/search?source=ig&hl=en&rlz=&q=keyboard+acoustic+em

### Introduction to Modern Cryptography Lecture 4

Introduction to Modern Cryptography Lecture 4 November 22, 2016 Instructor: Benny Chor Teaching Assistant: Orit Moskovich School of Computer Science Tel-Aviv University Fall Semester, 2016 17 Tuesday 12:00

### Quasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012

Quasi-cyclic codes Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico

### A. Algebra and Number Theory

A. Algebra and Number Theory Public-key cryptosystems are based on modular arithmetic. In this section, we summarize the concepts and results from algebra and number theory which are necessary for an understanding

### Lecture 14: Hardness Assumptions

CSE 594 : Modern Cryptography 03/23/2017 Lecture 14: Hardness Assumptions Instructor: Omkant Pandey Scribe: Hyungjoon Koo, Parkavi Sundaresan 1 Modular Arithmetic Let N and R be set of natural and real

Congruence classes For given integer m 2, the congruence relation modulo m at the set Z is the equivalence relation, thus, it provides a corresponding partition of Z into mutually disjoint sets. Definition

### Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.

### Department of Mathematics, University of California, Berkeley

ALGORITHMIC GALOIS THEORY Hendrik W. Lenstra jr. Mathematisch Instituut, Universiteit Leiden Department of Mathematics, University of California, Berkeley K = field of characteristic zero, Ω = algebraically

### Algebra for error control codes

Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22

### MATH Dr. Halimah Alshehri Dr. Halimah Alshehri

MATH 1101 haalshehri@ksu.edu.sa 1 Introduction To Number Systems First Section: Binary System Second Section: Octal Number System Third Section: Hexadecimal System 2 Binary System 3 Binary System The binary

### [Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives

[Part 2] Asymmetric-Key Encipherment Mathematics of Cryptography Forouzan, B.A. Cryptography and Network Security (International Edition). United States: McGraw Hill, 2008. Objectives To introduce prime

### Prime and irreducible elements of the ring of integers modulo n

Prime and irreducible elements of the ring of integers modulo n M. H. Jafari and A. R. Madadi Department of Pure Mathematics, Faculty of Mathematical Sciences University of Tabriz, Tabriz, Iran Abstract

### 1 Fields and vector spaces

1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary

### EECS Components and Design Techniques for Digital Systems. Lec 26 CRCs, LFSRs (and a little power)

EECS 150 - Components and esign Techniques for igital Systems Lec 26 CRCs, LFSRs (and a little power) avid Culler Electrical Engineering and Computer Sciences University of California, Berkeley http://www.eecs.berkeley.edu/~culler

### Topics in Cryptography. Lecture 5: Basic Number Theory

Topics in Cryptography Lecture 5: Basic Number Theory Benny Pinkas page 1 1 Classical symmetric ciphers Alice and Bob share a private key k. System is secure as long as k is secret. Major problem: generating

### Midterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5

Department of Mathematical Sciences Instructor: Daiva Pucinskaite Modern Algebra June 22, 2017 Midterm Exam There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of

### 1 Groups Examples of Groups Things that are not groups Properties of Groups Rings and Fields Examples...

Contents 1 Groups 2 1.1 Examples of Groups... 3 1.2 Things that are not groups....................... 4 1.3 Properties of Groups... 5 2 Rings and Fields 6 2.1 Examples... 8 2.2 Some Finite Fields... 10

### Fields and Galois Theory

Fields and Galois Theory Rachel Epstein September 12, 2006 All proofs are omitted here. They may be found in Fraleigh s A First Course in Abstract Algebra as well as many other algebra and Galois theory

### 1. Algebra 1.5. Polynomial Rings

1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are

### CPE 776:DATA SECURITY & CRYPTOGRAPHY. Some Number Theory and Classical Crypto Systems

CPE 776:DATA SECURITY & CRYPTOGRAPHY Some Number Theory and Classical Crypto Systems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Some Number Theory

### Mathematical Foundations of Public-Key Cryptography

Mathematical Foundations of Public-Key Cryptography Adam C. Champion and Dong Xuan CSE 4471: Information Security Material based on (Stallings, 2006) and (Paar and Pelzl, 2010) Outline Review: Basic Mathematical

### 1. Introduction to commutative rings and fields

1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative

### Numbers. Çetin Kaya Koç Winter / 18

Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2016 1 / 18 Number Systems and Sets We represent the set of integers as Z = {..., 3, 2, 1,0,1,2,3,...} We denote the set of positive integers modulo n as

### Math 547, Exam 1 Information.

Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:10-11:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)

### Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together

### Finite Fields. [Parts from Chapter 16. Also applications of FTGT]

Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory

### 1. Introduction to commutative rings and fields

1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative

### Quasi-reducible Polynomials

Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let

### Frequency Domain Finite Field Arithmetic for Elliptic Curve Cryptography

Frequency Domain Finite Field Arithmetic for Elliptic Curve Cryptography Selçuk Baktır, Berk Sunar {selcuk,sunar}@wpi.edu Department of Electrical & Computer Engineering Worcester Polytechnic Institute

### Construction of latin squares of prime order

Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo

### REVIEW Chapter 1 The Real Number System

REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }

### Irreducible Polynomials. Finite Fields of Order p m (1) Primitive Polynomials. Finite Fields of Order p m (2)

S-72.3410 Finite Fields (2) 1 S-72.3410 Finite Fields (2) 3 Irreducible Polynomials Finite Fields of Order p m (1) The following results were discussed in the previous lecture: The order of a finite field

### Applied Cryptography and Computer Security CSE 664 Spring 2018

Applied Cryptography and Computer Security Lecture 12: Introduction to Number Theory II Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline This time we ll finish the

### NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

### An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt

An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt Class Objectives Binary Operations Groups Axioms Closure Associativity Identity Element Unique Inverse Abelian Groups

### Elliptic Curves I. The first three sections introduce and explain the properties of elliptic curves.

Elliptic Curves I 1.0 Introduction The first three sections introduce and explain the properties of elliptic curves. A background understanding of abstract algebra is required, much of which can be found

### Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of