Applications of

Ring theory
in
Computer
Science
Presented by
Prabhjot Singh Kalra 2019 mts 1003
Aaditya Poonia 2019 mts 1073
What is a Ring
Ring is an Algebraic Structure

A Ring R is a set with two binary operations ,

addition(denoted by a+b) and multiplication(denoted by ab),
such that for all a,b,c in R:

I. a+b=b+a (commutativity)
II. (a+b)+c=a+(b+c) (assosiativity)
III. There is an additive identity 0. that is ,there is an element
0 in R: a+0=a for all a in R (additive identity)
IV. There is an element –a in R : a+(-a)=0. (additive inverse)
V. a(bc)=(ab)c (assosiative multiplication)
VI. a(b+c)=ab+ac and (b+c)a=ba+ca ( right and left
distributive over +)
 Ring Theory
•Ring Theory is an extension of Group Theory.
•It is Used In vibrant and wide areas of current
research in mathematics, computer science and
mathematical/theoretical physics.
•They have many applications to the study of
geometric objects, to topology and in many
cases their links to other branches of algebra .
“My methods
are really
methods of
working and
thinking : this
is why they
have crept in
everywhere
anonymously”

Amalie Emmy
Noether
Applications in Computers and
Programming
• Ring theory have many applications in the field
of computers like Cryptography, Data Security,
Calculator programs, and electric switching
• Here we will discuss -
﹡Data Security
﹡Divisibility test for calculator Programs
Data Security
• Computers are built from two-state
electronic components, 0s and 1s called
binary strings
• A binary string of length n can naturally be
thought of as an element of Z2 ⊕ Z2 ⊕ · · ·
⊕ Z2 (n copies)
• The binary string 11000110 corresponds to
the element (1, 1, 0, 0, 0, 1, 1, 0) in Z2 ⊕ Z2
⊕ Z2 ⊕ Z2 ⊕ Z2 ⊕ Z2 ⊕ Z2 ⊕ Z2
• Since Z2 is a commutative ring with unity
and its properties makes the process
accurates
 working
When you place an order with a company (say Amazon), the
company sends your computer a randomly generated string of 0’s
and 1’s called a key.
We want to send an eight-digit binary string
such as s = 10101100 to Amazon
(actual credit-card numbers have very long
strings)
Amazon sends your computer the key k =
00111101.
Your computer returns the string s + k
=10101100 1+ 00111101 = 10010001 to
Amazon,
Amazon adds k to this string to get
10010001 +1 00111101 = 10101100, which is
the string representing your credit-card
number.
If someone intercepts the number s +k =
10010001 during transmission it is no value
without knowing k
Simply saying
If S is our credit-card numbers
Then the company will send key k of the
same length
Then key K and card pin S adds up to give
S+K having same length and K+S is recieved
by the company.
When it reaches there company add K to S+K
i.e.S+K+K.
Since the sum of two binary sequences = 0 if
and only if the sequences are identical is the
basis for a data security system used to
protect Internet transactions.
DIVISIBILITY TEST
DIVISIBILITY TEST OF 9
A number is divisible by 9 if sum of it's digits is
divisible by 9.
Eg.: Let the number is 2345679.
Here, Sum of digits = 36 and 36 is divisible
by 9.
So, the sum of digits is divisible by 9 and
hence, the number itself is divisible by 9.
 DIVISIBILITY TEST
DIVISIBILITY TEST OF 9
A number is divisible by 9 if sum of it's digits is
divisible by 9.
Eg.: Let the number is 2345679.
Here, Sum of digits = 36 and 36 is divisible
by 9.
So, the sum of digits is divisible by 9 and
hence, the number itself is divisible by 9.

This simple, but important divisibility test can be easily

proved using the concept known as Ring Homomorphism.
 DIVISIBILITY TEST
DIVISIBILITY TEST OF 9
A number is divisible by 9 if sum of it's digits is
divisible by 9.
Eg.: Let the number is 2345679.
Here, Sum of digits = 36 and 36 is divisible
by 9.
So, the sum of digits is divisible by 9 and
hence, the number itself is divisible by 9.

This simple, but important divisibility test can be easily

proved using the concept known as Ring Homomorphism.

RING HOMOMORPHISM
A ring homomorphism Φ from a ring R to a ring S is a mapping
from R to S that preserves the two ring operations; that is, for
all a, b in R ,
Φ(a+b)=Φ(a)+Φ(b) and Φ(ab)=Φ(a)Φ(b).
RING HOMOMORPHISM
A ring homomorphism Φ from a ring R to a ring S is a mapping
from R to S that preserves the two ring operations; that is, for
all a, b in R ,
Φ(a+b)=Φ(a)+Φ(b) and Φ(ab)=Φ(a)Φ(b).
PROOF
The decimal representation of any integer of n is akak-1•••a0. So, we can also say that
n=ak10k+ak-110k-1+•••+a0
So, n is divisible by 9 if and only if ak10k+ak-110k-1+•••+a0 is divisible by 9.
Now, Consider the homomorphism
Φ : Z → Z9 s.t. Φ(x) = x mod 9
So, Φ(n)=Φ(ak10k+ak-110k-1+•••+a0)
=Φ(ak)Φ(10k)+Φ(ak-1)Φ(10k-1)+•••+Φ(a0) Using Properties of
=Φ(ak){Φ(10)}k+Φ(ak-1){Φ(10)}k-1+•••+Φ(a0) Homomorphism
=Φ(ak)+Φ(ak-1)+•••+Φ(a0)
Φ(10)=10 mod9 = 1
⇒ Φ(n)=Φ(ak+ak-1+•••+a0)
If n is divisible by 9; then, Φ(n) = (9k) mod 9 = 0
⇒Φ(ak+ak-1+•••+a0)=(ak+ak-1+•••+a0)mod 9 = 0
i.e., sum of digits of n is divisible by 9.
So, a number is divisible by 9 if and only if the sum of it's digits is divisible by 9.

So, in this way, Ring Theory can give us important divisibility rules.
 USING DIVISIBILITY RULE IN C++
We can use the divisibility rule in C++ where we will only check if the sum of digits is
divisible by 9 or not in order to find whether a number is divisible by 9 or not.
 Presented by-
Aaditya and Prabhjot