Scribd
Upload
32 views

Chapter 5

This document discusses finite fields and their importance in cryptography. It begins by defining groups, rings, and fields as algebraic structures with increasingly complex properties. It then focuses on finite fields, specifically finite fields of order p (GF(p)) which are sets of integers modulo a prime p with arithmetic operations also modulo p. It discusses cyclic groups and how every element is a power of a generator. It also covers polynomial arithmetic, distinguishing ordinary polynomial arithmetic from polynomial arithmetic with coefficients in a finite field like GF(p) or GF(2n), where the polynomials are defined modulo a polynomial of degree n.

Uploaded by

Sibghat Rehman
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
32 views

Chapter 5

This document discusses finite fields and their importance in cryptography. It begins by defining groups, rings, and fields as algebraic structures with increasingly complex properties. It then focuses on finite fields, specifically finite fields of order p (GF(p)) which are sets of integers modulo a prime p with arithmetic operations also modulo p. It discusses cyclic groups and how every element is a power of a generator. It also covers polynomial arithmetic, distinguishing ordinary polynomial arithmetic from polynomial arithmetic with coefficients in a finite field like GF(p) or GF(2n), where the polynomials are defined modulo a polynomial of degree n.

Uploaded by

Sibghat Rehman
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Information Security

LEARNING OBJECTIVES

After studying this chapter (Finite Fields), you should be able


to:
◆ Distinguish among groups, rings, and fields.
◆ Define finite fields of the form GF(p).
◆ Explain the differences among ordinary polynomial
arithmetic, polynomial arithmetic with coefficients in Zp, and
modular polynomial arithmetic in GF(2n).
◆ Define finite fields of the form GF(2n).
◆ Explain the two different uses of the mod operator.
2
Introduction

● Fields are a subset of a larger class of


algebraic structures called rings, which are in
turn a subset of the larger class of groups as
shown in Figure,
● Both groups and rings can be further
differentiated. Groups are defined by a simple
set of properties and are easily understood.
● Each successive subset (abelian group, ring,
commutative ring, and so on) adds additional
properties and is thus more complex.
3
Finite Fields

Stream Cipher

● Finite fields have become increasingly important in


cryptography. A number of cryptographic algorithms rely
heavily on properties of finite fields, notably the Advanced
Encryption Standard (AES) and elliptic curve cryptography.
● Fields are a subset of a larger class of algebraic structures
called rings, which are in turn a subset of the larger class of
groups.

4
Finite Fields

Groups
● A group G, sometimes denoted by {G, # }, is a set of elements with a binary operation denoted by # that
associates to each ordered pair (a, b) of elements in G an element (a # b) in G, such that the following
axioms are obeyed:

● If a group has a finite number of elements, it is referred to as a finite group, and the order of the group is
equal to the number of elements in the group. Otherwise, the group is an infinite group
5
Finite Fields

Abelian Group
● A group is said to be abelian if it satisfies the following additional condition:

6
Finite Fields

Cyclic Group
● A group G is cyclic if every element of G is a power a k (k is an integer) of a fixed element a ∈ G.
● The element a is said to generate the group G or to be a generator of G. A cyclic group is always abelian
and may be finite or infinite.

7
Finite Fields

Cyclic Group
● A group G is cyclic if every element of G is a power a k (k is an integer) of a fixed element a ∈ G.
● The element a is said to generate the group G or to be a generator of G. A cyclic group is always abelian
and may be finite or infinite.

8
Finite Fields

RINGS
● A ring R, sometimes denoted by {R, +, * }, is a set of elements with two binary operations, called addition and
multiplication, such that for all a, b, c in R the following axioms are obeyed

● A ring is said to be commutative if it satisfies the following additional condition:

9
Integral Domain

● It is a commutative ring that obeys the following axioms.


○ (M5) Multiplicative identity: There is an element 1 in R such
that
○ a1 = 1a = a for all a in R.
○ (M6) No zero divisors: If a, b in R and ab = 0, then either a =
0 or b = 0.
○ Let S be the set of integers (positive, negative, and 0) under
the usual operations of addition and multiplication. S is an
integral domain.

10
Finite Fields

Fields
● A field F, sometimes denoted by {F, +, * }, is a set of elements with two binary operations, called addition and
multiplication, such that for all a, b, c in F the following axioms are obeyed.

● A field is a set of elements in which we can do addition, subtraction, multiplication, and division without
leaving the set. Division is defined with the following rule: a/b = a(b-1)

11
Finite Fields

12
Finite Fields

Finite Fields of Order p


● For a given prime, p, we define the finite field of order p, GF(p), as the set Zp of integers {0, 1, -----, p - 1}
together with the arithmetic operations modulo p.
gf(5) = (0, 1, 2, 3, 4) , gf(23 ) = (0, 1, 2, 3, 4, 5, 6, 7)
● Zn of integers {0, 1, ------ , n - 1}, together with the arithmetic operations modulo n, is a commutative ring.
● Any integer in Zn has a multiplicative inverse if and only if that integer is relatively prime to n.
● If n is prime, then all of the nonzero integers in Zn are relatively prime to n, and therefore there
exists a multiplicative inverse for all of the nonzero integers in Z n

● Because w is relatively prime to p, if we multiply all the elements of Z p by w, the resulting residues
13 are all of
the elements of Zp permuted. Thus, exactly one of the residues has the value 1.
Finite Fields

14
Finite Fields

POLYNOMIAL ARITHMETIC
● Each 0 or 1 is called a bit, and since a bit is either 0 or 1, a bit is an element of gf(2)
● There is also a byte which is equivalent to 8 bits thus is an element of gf(2 8)
● Since we will be focusing on computer cryptography and as each datum is a series of bytes, we are only
interested in Galois Field of order 2 and 2 8
● We are concerned with polynomials in a single variable x, and we can distinguish three classes of polynomial
arithmetic
■ Ordinary polynomial arithmetic, using the basic rules of algebra.
■ Polynomial arithmetic in which the arithmetic on the coefficients is performed modulo p; that is, the
coefficients are in GF(p).
■ Polynomial arithmetic in which the coefficients are in GF(p), and the polynomials are defined modulo a
polynomial m(x) whose highest power is some integer n.
15
Finite Fields

POLYNOMIAL ARITHMETIC
● In general, a polynomial is an expression of the form

16
Finite Fields

Ordinary Polynomial Arithmetic

17
Finite Fields

Polynomial Arithmetic with Coefficients in Zp


● Polynomials in which the coefficients are elements of some field F; we refer to this as a polynomial over the
field F.
● Let’s consider the set of all polynomials whose coefficients belong to the finite field Z 7 (which is the same as
GF(7)

18
THANKS!
Any questions?

19

You might also like