Secrets of Number theoretic tools in Network

Security
Algorithms of Public-key Cryptosystems

1N. Hari Nisha , 2Keshiya Anthony, 3A. Suruthi Kaviya , 4S. Anitha , 5S. Aishwarya , 6M.
Vithya
Under the guidance of Project Supervisor
7Mr. J . Sasikumar,
Assistant Professor.

1,2,3,4,5,6,7 Department of Mathematics

SRM Institute of Science and Technology, Kattankulathur-603 203, Tamil Nadu, India
 Outline
 History of number theory
 Important concepts of number theory
 Arithmetic functions
 Congruences
 Simple properties of congruences
 Cryptography
 History of cryptography
 Modern cryptography
 Private key cryptography
 Public key cryptography
 Simple definitions
 Network security
 Applications of number theory in network security
 RSA algorithm
 References
 Objectives
 Proposed to explore various number theory concepts hiding
behind RSA algorithm and other network security algorithms
of digital signature and cryptosystems.
 The strength of RSA algorithm and the weakness of RSA with
multiple encryption and decryption exponents will be
discussed by finding bounds on the decryption exponents.
 Efficient network security algorithms are compared with
enhanced RSA algorithm in terms of security from attacks and
encryption/decryption time by means of pie charts and bar
diagrams.
 Current work- Understanding the function of the RSA
algorithm and other types of algorithms.
 History Of Number Theory

 Number theory or in older usage arithmetic is a branch of pure

mathematics.
 "The Queen of Mathematics“.
 The positive integers are undoubtedly man’s first mathematical
creation.
 By 5700 BC the ancient Sumerians kept a calendar , so they must
have developed some form of arithmetic.
 Around 600 BC Pythagoras and his disciples made studies of the
integers and they were the first to classify integers in various ways
(i.e., even , odd , prime and composite numbers)
 Basics: Important concepts in
Number Theory
PRIME NUMBER:
A positive integer is said to be prime if its factors are exclusively
1 and itself.
Example: Primes are 2,3,5,7,…

DIVISORS:
A positive integer a is said to divide an integer b if there exists an
integer c such that b=ac and written as b=a.c and written as a│b
Example: 2 │10 as 10=2.5 but 3 does not divide 10 as there does
not exist any integer c such that 10=3.c
Basics: Important concepts in
Number Theory
GREATEST COMMON DIVISOR(GCD):
Let a and b be integers, not both zero .Then the GCD
is the largest positive integer which is factor of both
(a,b).It is denoted by d=(a,b)
Example: 6=(24,30)

RELATIVELY PRIME OR CO-PRIME:

Two numbers a and b are said to be relatively prime
or co-prime if their greatest common divisor is 1 i.e.
(a,b)=1
Example:10 and 11 are co-prime
 ARITHMETIC FUNCTIONS
Number theory is often concerned with sequences of real or
complex numbers .In number theory such sequences are called
arithmetical functions.

• MOBIUS FUNCTION µ(n):

The mobius function is defined as follows
µ(1)=1
if n>1,write n=p1 a1……………. Pka k then,

µ(n)=(-1)k if a1 =a2=………ak=1
µ(n)=0 otherwise

Note that µ(n)=0 if and only if n has a square factor>1

Here is a short table of values of Mobius function µ(n):

n: 1 2 3 4 5 6 7 8 9

µ(n) 1 -1 -1 0 -1 1 -1 0 0

• THE EULER TOTIENT FUNCTION ϕ(n):

if n≥1 the euler totient ϕ(n) is defined to be the number of
positive numbers not exceeding n which are relatively prime to n
thus,
n

ϕ(n)=  '1
k 1

Where the ʼ indicates that the sum is extended over those k

relatively prime to n.
 Here is a short table of values of ϕ(n):
n: 1 2 3 4 5 6 7 8 9

ϕ(n) 1 1 2 2 4 2 6 4 6

Relation connecting ϕ and μ

n
 ( n)    ( d )
d |n d
•MULTIPLICATIVE FUNCTIONS:
An multiplicative function f is called multiplicative if f is not
identically zero and if
f(mn)=f(m)f(n) where (m,n)=1
A multiplicative function f is called completely multiplicative if we
also have
f(mn)=f(m)f(n) for all m,n
Example: The identity function I(n)=[1/n] is completely
multiplicative.
 Congruences
 Congruence modulo m
 Let m be a positive integer. Then an integer a is congruent
to an integer b modulo m if m|(a-b).
 In symbols if we write a≡b (mod m); m is the modulus of
the congruence relation.
Examples: 5|(23-3) 23 ≡3(mod 5)
6|(48-12) 48 ≡12(mod 6)
 Real life applications
Examples: Modulo 12 to tell the time
Modulo 7 to tell the day of the week
 Simple Properties

 Let a,b,c,n be integers with n≠0

(1) a≡0 (mod n) iff n|a [Identity]
(2) a≡a (mod n) [Reflexive]
(3) a≡b (mod n) iff b≡a (mod n) [Symmetric]
(4) a≡b and b≡c (mod n) → a≡c (mod n) [Transitive]
 What is cryptography?

“The art of hiding information”

OR
“The practice and study of techniques for secure

communication in the presence of third parties”

 History Of Cryptography
 Cryptography is the use of codes and ciphers to protect secrets
which began thousands of years ago.
 Until recent decades, it has been the story of what might be
called classic cryptography — that is, of methods
of encryption that use pen and paper, or perhaps simple
mechanical aids.
 The development of cryptography has been paralleled by the
development of cryptanalysis — the "breaking" of codes
and ciphers.
 Modern cryptography
A branch of mathematics and computer science

Two Main branches

1.Private key cryptography
2.Public key cryptography
 Private key cryptography

 The same key is used for both encryption

and decryption
 Examples:
 DES
 AES
 Caesar Cipher
 Blowfish
 Public key cryptography
 Two keys are needed:
 one for encryption
 other for decryption

Key’s properties:
 Neither keys can perform both operations
 The two keys are mathematically paired
 Public key for encryption and private key for
decryption
Examples: RSA,YAK, Various elliptic curve
techniques.
 Simple definitions
 Plain text is the original message that is to be transmitted in
secret form.
 Cipher text is its secret version.
 The key is used to formulate the cipher, so the job of the
cryptanalyst is to discover the key and then break code.
 The process of converting a plain text to cipher text is
encrypting (enciphering) and the converting device the
encryptor.
 The reverse process by the intended recipient who knows the
key is decrypting (deciphering) and it is accomplished by a
decryptor.
 Simple definitions
 The encryptor and decryptor may be algorithms executed by
people or computers.
 Thus the method used by an unintended receiver to recover the
original message is cryptanalysis.
 A cryptosystem is a system for encrypting a plain text to a
cipher using a key
 Network Security
 Responsible for securing all information passed
through networked computers.
 With the advent of the World Wide Web and the emergence of
e-commerce applications and social networks, organizations
across the world generate a large amount of data daily.
 Information security is the most extreme basic issue in
guaranteeing safe transmission of data through the web.
 Network security issues are now becoming important as
society is moving towards digital information age.
 As more and more users connect to the internet it attracts a lot
of cyber-attacks.
 Network Security can be enhanced through Cryptography.
Applications of Number Theory
in Network Security
 Number theory plays an important role in
encryption algorithm.
 Many tools in number theory such as
1. Primes
2. Divisors
3. Greatest Common Divisor
4. Co-primes
5. Congruence
6. Euler’s ϕ function
are used in cryptography for security.
 RSA Algorithm
 RSA is a commonly used asymmetric algorithm.
 It was publicly described in 1977 by Ron Rivest, Adi
Shamir, and Leonard Adelman at MIT.
 The letters RSA are the initials of their surnames.
 It is based on some interesting relationships with prime
numbers.
 Its security is derived from the fact that it is difficult to
factor large integers into its prime factors.

MIT scientists Adi Shamir, Ronald Rivest, and Leonard

Adelman,
 References
 T. M. Apostol, Introduction to Analytic Number
theory, Springer-Verlag(New York), 1976
 R. A. Karkade, International Journal of Computer
Science and Mobile Computing, Vol.4 Issue.1,
January- 2015, pg. 201-204
 P. Singh, A. Singh, S. Jhamb, Importance of
number theory in cryptography, Punjab, 2017
 C. Easttom, International journal of innovative
research in information security,Vol.4, Issue.1,
January 2017.
 References
 S.Sarkar, S.Maitra, Cryptanalysis of RSA with
two decryption exponents,ELSEVIER 2009.
 R.L. Rivest, A.Shamir, and L.Adleman, A method
for obtaining digital signatures and public-key
cryptosystems
 I.Sani ,A.B.M. Hamed, Cryptography using
congruence modulo relations, American journal of
Engineering research,vol.6,Issue-3,pp-156-160.
 Saranya et al, Internationl journal of computer
science and information Technologies,
vol.5(4),2014.
 S.Tayal, N.Gupta, P.Gupta, D. Goyal, M.Goyal, A
review paper on network security and
cryptography, Research India publication, Vol
10,No.5(2017)pp.763-770
 References
 K. Radha, G.Balaji,V.P.Jayasutha, Number theory
in providing security, International journal of
advance research in computer science and
software engineering, vol 3, issue 7, july 2013.
 V.Logesh, S.JayaRaman,H.S, Guru prasath,Survey
on network security and cryptography,
International journal of advance research in
science and in engineering, vol 3, issue 10 oct
2014.
 M.Pritha, M.Nithya,Study and performance
analysis of RSA algorithm International journal of
computer science and mobile computing,vol 2
issue 6, june 2013
Thank you…