Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
2 views

Lesson 4 Number Theory and Cryptography

The document discusses the significance of Number Theory in cryptography, particularly in encryption algorithms like Caesar cipher and RSA public key cryptography. It explains key concepts such as prime numbers, divisors, congruences, and Euler's function, which are essential for ensuring security in cryptographic methods. The paper also highlights the roles of the sender, receiver, and adversary in the communication process.

Uploaded by

2022313644
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Lesson 4 Number Theory and Cryptography

The document discusses the significance of Number Theory in cryptography, particularly in encryption algorithms like Caesar cipher and RSA public key cryptography. It explains key concepts such as prime numbers, divisors, congruences, and Euler's function, which are essential for ensuring security in cryptographic methods. The paper also highlights the roles of the sender, receiver, and adversary in the communication process.

Uploaded by

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

Discrete Structure 2:

Number Theory and


Cryptography

Prepared by: Ms. Kimberly Rose Reyes


Number Theory plays an important role in encryption
algorithm. Cryptography is the practice of hiding
information, converting some secret information to not
readable texts. The paper aims to introduce the reader
to applications of Number Theory in cryptography. We
will briefly talk about an idea of encryption in Caesar
ciphering and RSA public key cryptography. Many tools
in Number Theory like primes, divisors, congruencies
and Euler’s ‘ ’ function are used in cryptography for
security.
Introduction
For thousands of years people have searched for the way to send
a message secretly. There is a story that, in ancient time, a king
needed to send a secret message to his general in battle. The
king took a servant, shaved his head and wrote the message on
his head. He waited for the servant’s hair to grow back and then
sent the servant to the general. The general then shaved the
servant’s head and read the message. If the enemy had captured
the servant, they presumably would not have known to shave his
head and message would have been safe.
Cryptography is the study of methods to send and
receive the secret messages. In general we have a
sender who is trying to send a message to receiver.
There is also an adversary, who wants to steal the
message. We are successful if sender is able to
communicate a message to the receiver without
adversary learning what the message was.
We will use some important concepts
of Number Theory and Cryptography
Important concepts in Number
Theory
Prime Numbers- A positive integer p is said to be a prime if it has
only two factors namely 1 and p itself. For Example: Primes are 2, 3, 5, 7,
11, 13, 17 …
Divisors: A positive integer a is said to divide an integer b if there exist
an integer c such that b = a.c and
written as a | b
.
For Example 2 |10 as 10 = 2.5 but 3 do not divide 10 as there does not exist
any integer c such that 10 = 3. c

Greatest Common Divisor: Let a and b be two positive integers


then an integer d is called greatest common divisor of a and b if d | a and
d|b
i.e. d is common divisor of a and b .
And if any integer c is such that c | a and c | b then c | d i.e. any other common divisor of a and b will
divide d it is denoted by d = (a, b)
For Example: 6 = (24,30)
Two numbers a and b are said to relatively prime or co prime if their greatest common divisor is 1 i.e.
(a, b) =1
For Example: 10 and 11 are co prime

Congruence: Let a and b be two integers and m is any positive integer then a is said to congruent
to
b modulo m if m divide difference of a and b i.e.
For Example: 27 º13(mod 4)
m | a - b . It is denoted by a º b (mod m)

Euler’s ‘ f ’ Function : An arithmetic function Euler’s Toitent function ‘ f ’ is defined as


f(n) =number of positive integers less than or equal to n and co prime to n
i.e. f(n)= number of positive integers ‘ a ’ such that 1 £ a £ n and g.c.d. (a, n) =1

For Example:f(15) = 8 as primes relative to 15 are given by 1, 2, 4, 7, 8, 11, 13, and 14. And f(mn) =
f(m)f(n) where m and n are relatively prime.
Important concepts in Cryptography
(1) Cryptography is the study of methods to send and
receive secret message.
(2) The sender wants to send a message to receiver.
(3) The adversary wants to steal the message.
(4) In private key cryptography, the sender and
receiver agree in advance on a secret code, and then
send message using that code.
(5) In public key cryptography the encoding method
can be published. Each person has a public key used
to encrypt message and a secret key used to encrypt
an encrypted message.
(6) The original message is called the Plain text.
(7) The encoded text is called Cipher text.
I.CAESAR CIPHER KEY CRYPTOGRAPHY

One of the earliest cryptographic system was used by great Roman


emperor Julius Caesar around 50 (B.C.). Caesar wrote to Marcus
Cicero using a rudimentary substitution cipher in which each letter of
the alphabet is replaced by letter that occurs three places down the
alphabet. With the last three letters cycled back to the first three
letters.
Underneath the plain text letter the substitution
alphabet for Caesar cipher is given by:
For Example: NUMBER THEORY IS EASY is transformed into QXPEHU
WKHRUB LV HDVB With the help of congruence theory Caesar cipher can
be easily described.

Any plaintext is first expressed numerically by transforming the character of the


text into digit by means of some correspondence such as
Thanks!
Do you have any questions?

You might also like