Basic Abstract Algebra and Modular Arithmetic Delivered by Joel Anandraj.E Ap/It

Lecture 4
Basic Abstract Algebra and Modular Arithmetic

Delivered by
Joel Anandraj.E
AP/IT
Objective :
The prime purpose of having this lecture is to

let you student to have certain mathematical
foundations that are necessary to study and
work with various cryptographic algorithms.
Learning Outcome:
Understand the base of many complex

schemes that are backbone of our present
digital world.
Abstract Algebra :
Abstract algebra is a broad field of

mathematics, concerned with algebraic
structures such as groups, rings, and Fields
Groups :
A group is an algebraic structure
consisting of a set of elements equipped
with an operation that combines any two
elements to form a third element.
The operation satisfies four conditions
called the group axioms, namely
 Closure,
 Associativity,
 Identity
 Invertibility.
A group is a set, G, together with an operation •
that combines any two elements a and b to form
another element, denoted a • b or ab.
To qualify as a group, the set and operation, (G,

•), must satisfy four requirements known as the
group axioms:
Closure : For all a, b in G, the result of the
operation, a • b, is also in G.
Associativity: For all a, b and c in G, (a • b) • c =
a • (b • c).
Identity element
 There exists an element e in G such that, for every
element a in G, the equation e • a = a • e = a holds.
 Such an element is unique and thus one speaks of the
identity element.
Inverse element
 For each a in G, there exists an element b in G,
commonly denoted a−1 (or −a, if the operation is
denoted "+"), such that a • b = b • a = e, where e is
the identity element.
The result of combining element a with
element b need not yield the same result
as combining element b with element a;
The equation a • b = b • a may not always

be true.
If it is true then it is called Abelian Group.

Example
One of the most familiar groups is the set
of integers Z which consists of the numbers
..., −4, −3, −2, −1, 0, 1, 2, 3, 4, ...together
with addition.
Rings :
A ring is a set denoted as R equipped with two

binary operations + and · satisfying the following
three sets of axioms, called the ring axioms
R is an Abelian group under addition, meaning

that:
 (a + b) + c = a + (b + c) for all a, b, c in R (+ is associative).
 a + b = b + a for all a, b in R (+ is commutative).
 There is an element 0 in R such that a + 0 = a for all a in R
(0 is the additive identity).
 For each a in R there exists −a in R such that a + (−a) = 0
(−a is the additive inverse of a).
R is a monoid under multiplication,
meaning that:
 (a · b) · c = a · (b · c) for all a, b, c in R (· is
associative).
 There is an element 1 in R such that a · 1 = a and 1 ·
a = a for all a in R (1 is the multiplicative identity).
Multiplication is distributive with respect to

addition:
 a ⋅ (b + c) = (a · b) + (a · c) for all a, b, c in R (left
distributivity).
 (b + c) · a = (b · a) + (c · a) for all a, b, c in R (right
distributivity).
The most familiar example of a ring is the
set of all integers, Z consisting of the
numbers
. . . , −5, −4, −3, −2, −1, 0, 1, 2, 3, 4,

5, . . .
The familiar properties for addition and

multiplication of integers serve as a model
for the axioms for rings.
Fields :
A field is a set on which addition,

subtraction,
multiplication, and division can be
performed.
A field is a set together with two operations
called addition and multiplication.
These operations are required to satisfy the
following properties, referred to as field
axioms.
Associativity of addition and multiplication: a
+ (b + c) = (a + b) + c and a · (b · c) = (a ·
b) · c.
Commutativity of addition and multiplication:
a + b = b + a and a · b = b · a.
Additive and multiplicative identity: there
exist two different elements 0 and 1 in F such
that a + 0 = a and a · 1 = a.
Additive inverses: For every a in F, there
exists an element in F, denoted −a, called
additive inverse of a, such that a + (−a) =
0.
Multiplicative inverses: For every a ≠ 0 in F,

there exists an element in F, denoted by
a−1or 1/a, called the multiplicative inverse
of a, such that a · a−1 = 1
Distributivity of multiplication over

addition: a · (b + c) = (a · b) + (a · c) .
Example :
Rational numbers are numbers which can

be written as fractions a/b, where a and b
are integers, and b ≠ 0.
The additive inverse of such a fraction is

−a/b, and the multiplicative inverse
(provided that a ≠ 0) is b/a, which can be
seen as follows:
Modular Arithmetic
Modular arithmetic is a system of
arithmetic for integers, which considers the
remainder.
A number X mod N is the equivalent of

asking for the remainder of X when divided
by N.
In modular arithmetic, numbers "wrap

around" upon reaching a given fixed
quantity (this given quantity is known as
Modular Arithmetic Operations :
(a Mod n + b Mod n) mod n =(a + b) mod

n
(a Mod n - b Mod n) mod n = (a - b) mod n
(a Mod n * b Mod n) mod n =(a * b) mod n
If Zn is a non negative integers , and we
perform modular arithmetic within Zn ,the
following property
Property holds.
Expression
Commutative Law (w+x) mod n=(x+w) mod n
(w*x) mod n =(x*w) mod n
Associative Law [(w+x)+y] mod n =[(w+(x+y)]mod n
[(w+x)+y] mod n =[(w+(x+y)]mod n
Distributive Law [w *(x+y)] mod n=[(w*x)+(w*y)] mod n
Identities (0 +w) mod n = w mod n

(0 * w) mod n = w mod n
Additive Inverse For w
 Zn ,there exists a z such that w +
z 0 mod n
CONGRUENCE
Two integers A and B are said to be

congruent (or in the same equivalence
class) modulo N, if they have the same
remainder upon division by N.
In such a case, we say that A B Mod N

Example:
 Here 36 and 10 are said to be congruent (mod

13) Because their difference 36-10=26 is an
integer multiple of 26.
Properties of addition in modular
arithmetic:
Properties of multiplication in modular
arithmetic:
Property of Exponentiation in Modular
Arithmetic
Since exponentiation is repeated multiplication,

we have the
following:
Example:
What is mod 4 ?
Multiplicative Inverses
If a and N are integers such that gcd (a,N)

=1 , then there exists an integer x such
that ax 1(mod N).
x is called the multiplicative inverse of a

modulo N.
Residue Class
A set, consisting of the integers congruent to a modulo n, is

called the congruence class or residue class or simply
residue of the integer a, modulo n.
Integers a and b are said to be members of the same

residue class (mod m) when they have the same principle
remainder (mod n).
Any set of integers {a1, a2, ..., an} representing all the
residue classes (mod n) is called a complete residue system
(mod n)
The residue classes of integers mod 4 are:
[0]4 = { ... , -16, -12, -8, -4, 0, 4, 8, 12,

16, ... }
[1]4 = { ... , -15, -11, -7, -3, 1, 5, 9, 13,
17, ... }
[2]4 = { ... , -14, -10, -6, -2, 2, 6, 10,14,
18, ... }
[3]4 = { ... , -13, -9, -5, -1, 3, 7, 11, 15,
19, ... }
Example:
It is currently 7:00 PM. What time (in AM or
PM) will it be in 1000 hours?
Thank you…
References :
https://brilliant.org/wiki/abstract-algebra/
https://en.wikipedia.org/wiki/Group_(mathe
matics)
https://brilliant.org/wiki/modular-arithmetic/

Basic Abstract Algebra and Modular Arithmetic Delivered by Joel Anandraj.E Ap/It

Uploaded by

Copyright:

Available Formats

Basic Abstract Algebra and Modular Arithmetic Delivered by Joel Anandraj.E Ap/It

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Basic Abstract Algebra and Modular Arithmetic Delivered by Joel Anandraj.E Ap/It

Uploaded by

Copyright:

Available Formats

Lecture 4

Basic Abstract Algebra and Modular Arithmetic

The prime purpose of having this lecture is to

Understand the base of many complex

Abstract algebra is a broad field of

To qualify as a group, the set and operation, (G,

The equation a • b = b • a may not always

If it is true then it is called Abelian Group.

A ring is a set denoted as R equipped with two

R is an Abelian group under addition, meaning

Multiplication is distributive with respect to

. . . , −5, −4, −3, −2, −1, 0, 1, 2, 3, 4,

The familiar properties for addition and

A field is a set on which addition,

Multiplicative inverses: For every a ≠ 0 in F,

Distributivity of multiplication over

Rational numbers are numbers which can

The additive inverse of such a fraction is

A number X mod N is the equivalent of

In modular arithmetic, numbers "wrap

(a Mod n + b Mod n) mod n =(a + b) mod

Distributive Law [w *(x+y)] mod n=[(w*x)+(w*y)] mod n

Identities (0 +w) mod n = w mod n

Two integers A and B are said to be

In such a case, we say that A B Mod N

 Here 36 and 10 are said to be congruent (mod

Since exponentiation is repeated multiplication,

If a and N are integers such that gcd (a,N)

x is called the multiplicative inverse of a

A set, consisting of the integers congruent to a modulo n, is

Integers a and b are said to be members of the same

[0]4 = { ... , -16, -12, -8, -4, 0, 4, 8, 12,

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Distributive Law [w (x+y)] mod n=[(wx)+(w*y)] mod n