Scribd
Upload
101 views19 pages

Lecture 4 Abstract Algebra

The document discusses the use of number theory in cryptography. It explains that modern cryptographic systems rely on advanced mathematics like number theory. Number theory explores the properties and relationships of numbers. Important developments include the RSA algorithm published in 1977, which became a major advancement and is still widely used today. The document also discusses the mathematical foundations needed to understand cryptographic algorithms, including concepts from abstract algebra like groups, rings, fields, and finite groups.

Uploaded by

Prateek Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
101 views19 pages

Lecture 4 Abstract Algebra

The document discusses the use of number theory in cryptography. It explains that modern cryptographic systems rely on advanced mathematics like number theory. Number theory explores the properties and relationships of numbers. Important developments include the RSA algorithm published in 1977, which became a major advancement and is still widely used today. The document also discusses the mathematical foundations needed to understand cryptographic algorithms, including concepts from abstract algebra like groups, rings, fields, and finite groups.

Uploaded by

Prateek Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

INFORMATION

SECURITY
(CSD-410)
(Lecture 4)
NUMBER THEORY IN
CRYPTOGRAPHY
▪ Cryptography is a division of applied mathematics concerned
with developing schemes and formulas to enhance the
privacy of communications through the use of codes.

▪ Modern cryptographic systems rely on functions associated


with advanced mathematics, including a specialized branch of
mathematics termed number theory that explores the
properties of numbers and the relationships between
numbers.
EVOLUTION OF NUMBER THEORY
IN CRYPTOGRAPHY
▪ Increasing amounts of data generation
▪ Rise of internet and security
▪ Transmission of information via electronic form
▪ Secrecy of information
▪ Non-repudiation
EVOLUTION OF NUMBER THEORY
IN CRYPTOGRAPHY
▪ The International Association for Cryptologic Research
(ICAR) began to apply mathematical number theory to
enhance privacy, confidentiality, and the security of data.
USE OF NUMBER THEORY
▪ In August 1977, Ronald Rivest, Adi Shamir, and Leonard
Adleman published an algorithm destined to become a major
advancement in cryptology.
▪ RSA Algorithm.
▪ The RSA algorithm was used in the development of Internet
web browsers, spreadsheets, data analysis, email, and
word processing programs.
▪ The modern cryptographic systems are mostly based on the
RSA algorithm and its modifications and derivations.
IMPACT OF NUMBER THEORY ON
CRYPTOGRAPHY
▪ Applications of number theory allow the development of
mathematical algorithms that can make information (data)
unable to understand to everyone except for intended users.
▪ Mathematical algorithms can provide real physical security to
data—allowing only authorized users to delete or update data.
▪ The applications of number theory provide "nonreputable"
transactions.
▪ It remains easier to generate larger composite numbers using
number theory.
MATHEMATICAL BACKGROUND
▪ The mathematical background is required to understand the
cryptographic algorithms, such as:

1. Data Encryption Standards (DES)


2. Advanced Encryption Standard (AES).

▪ The background is required basically in two areas:


1. Abstract Algebra
2. Number Theory
1. ABSTRACT ALGEBRA
▪ New Advanced Encryption Standards (AES) relies on the
subject of finite fields which forms a part of abstract algebra.

▪ Abstract algebra is basically algebraic structure, which deals


with something called set and their operations.

▪ In this area we have mainly three algebraic structure namely


Group, Ring and Field. These are basically algebraic structure
over a set with 1 or 2 operators.
Abstract
Algebra

Group Ring Field


{G,•} {Rg,+,×} {F,+,×}
SET
▪ Set is a distinct collection of well-defined objects.

▪ Example: set of natural number, set of integers or set of rational

number etc.
1. GROUP
▪ Let a set G and we have a binary operator on this set, {G,•}.

▪ This is a group if it satisfies following 4 properties:

1. Closure: If a and b are elements of G, then c = a • b is also an element


of G.

2. Associativity: If a, b, and c are elements of G, then (a • b) • c = a • (b •


c).

▪ If these 2 properties: Closure and Associativity are satisfied for a set


G along with this operator (•) then we call it a semi group.
1. GROUP
1. Existence of identity: For all a in G, there exists an element e,
called the identity element, such that e • a = a • e = a.

2. Existence of inverse: For each a in G, there exists an element a′,


called the inverse of a, such that a • a′ = a′ • a = e.

▪ If these 4 properties satisfied for a set along with this operator

(•), then it is called a group.


ABELIAN GROUP
▪ A commutative group, also called an abelian group, is a group in
which the operator satisfies the four properties for groups plus an
extra property, commutativity.

▪ Property:

▪ Commutativity: For all a and b in G, we have a • b = b • a. Note that this


property needs to be satisfied only for a commutative group.
FINITE GROUP
▪ A group is called a finite group if the set has a finite number of
elements; otherwise, it is an infinite group.
ORDER OF A GROUP
▪ The order of a group, |G|, is the number of elements in the group.
If the group is not finite, its order is infinite; if the group is finite, the
order is finite.
CYCLIC GROUPS
▪ If a subgroup of a group can be generated using the power of an element, the subgroup is called
the cyclic subgroup. The term power here means repeatedly applying the group operation to the
element:

an → a • a • … • a (n times)

▪ Note that the duplicate elements must be discarded. Also a0 = e.

▪ The element that generates the cyclic subgroup can also generate the group itself. This element
is referred to as a generator. If g is a generator, the elements in a finite cyclic group can be
written as:

{e, g, g2, … , gn−1}, where gn = e

▪ Note that a cyclic group can have many generators.


2. RING
▪ Ring is a set equipped with two binary operations called addition and multiplication,
(Rg,+,×). It must satisfy four properties:

1. It must be Abelian Group under addition (Rg,+). It must satisfy five properties
(Closure, Associativity, Existence of identity, Existence of inverse, and Commutativity).

2. It must be Closure under multiplication (Rg, ×). (Closure)

3. It must be Associative under multiplication (Rg, ×). (Associativity)

4. It must be distributive. For any elements: a, b, c, ∈ Rg where, a× (b+c) = a×b+b×c

▪ Example: {I,+, ×} set is a ring


2. FIELD
▪ The set of real numbers and the set of complex numbers each with their
corresponding addition and multiplication operations are examples of
fields.

▪ It has to be an Integral Domain and it’s every element should have


inverse under the × operation {F,+, ×}.

▪ Properties:

▪ 1. {F,+} must be an abelian group.

▪ 2. {F,-{0}} must be an abelian group.

You might also like