CONTENTS

CONTENTS

CHAPTER TITLE PAGE NO

ABSTRACT I

ACKNOWLEDGEMENT II

I INTRODUCTION 1

II PRELIMINARIES OF CRYPTOGRAPHY 3

III MATRICES IN CRYPTOGRAPHY 4

IV CONCEPTS OF NUMBER THEORY 15

IN CRYPTOGRAPHY

V APPLICATIONS OF NUMBER THEORY 23

IN CRYPTOGRAPHY

CONCLUSION 24

BIBLIOGRAPHY 25
ABSTRACT
 ABSTRACT

Cryptography builds from the field of pure maths known as number theory which deals with
integers and matrix theory that is the arrangement of elements in rows and columns. In this
project, how matrix theory used to encrypt and decrypt the information in cryptography is
studied with examples. Also the application of number theory in the cryptography using the
concept of congruence was discussed with examples.

I
ACKNOWLEDGEMENT
 ACKNOWLEDGEMENT

We express our deep sense of gratitude and indebteness to our guide Mrs.M.
Kalarani M.Sc., M.Phil., Assistant professor,Department of Mathematics. Sri
G.V.G Visalakshi college for women(Autonomous), for her valuable
suggestions , guidance and constant encouragement right from the beginning till
the completion of this project work.

We utilize this opportunity to express our loyal gratitude and sincere thanks to
Mrs.S.KALAISELVI M.Sc.,B.Ed., M.Phil.,PGDCA., Principal I/C, Sri
G.V.G Visalakshi collage for women (Autonomous), for her immeasurable
help by providing all sorts of facilities needs to complete this work successfully.

We would like to express our profound and sincere thanks to our Head of the
Department Mrs.B. Pushpa M.Sc., M.Phil., Associate Professor Department of
Mathematics,Sri G.V.G visalakshi college for women(Autonomous), for her
untiring efforts and constant encouragement wise council and valuable suggestion
in the formation and completion of this project.

We are also thankful to all members of the Department of mathematics,Sri

G.V.G visalakshi college for women(Autonomous), for extending warm
helpful hand and valuable suggestions through this project.

We are also pleased to express our sincere thanks to the Librarian Mrs.P.
Kavitha B.B.A., B.L.I.Sc.,M.L.I.Sc.,M.Phil.,PGDLAN., for her timely support
and guidance for the reference work to carry out this project.

II
CHAPTER I
 CHAPTER I

INTRODUCTION

Cryptography is the science of protecting information by transforming it into a secure format.

An example of basic cryptography is a encrypted message in which letters are replaced with
other characters. To decode the encrypted contents, one needs a grid or table that defines how
the letters are transposed. The goal of modern cryptography is to ensure the preservation of
information properties through mathematically sound means. Confidentiality is the assurance
that only the intended recipient of a message can read it. Cryptography is a field of maths,
specifically Numbers theory. A good example of a cryptography method is public key
cryptography which uses two set of keys. One key is public while the other is private which is
distributed only to the intended recipient of the information.

Cryptography, or cryptology, is the practice and study of hiding information. When a

message is sent using cryptography, it is changed (or encrypted) before it is sent. The method
of changing text is called a "code" or, more precisely, a "cipher". The changed text is called
"cipher text".

1
 Sender Receiver

Encryption Key Decryption Key

Plaintext Encryption Ciphertext Decryption Plaintext

Algorithm Algorithm

Interceptor

2
CHAPTER II
 CHAPTER II

PRELIMINARIES OF CRYPTOGRAPHY

In this chapter provides the basic terms related to Cryptography.

Definition. 2.1
An encoder is an electronic device used to convert an analogue signal to a digital signal.
Definition. 2.2
The decoder an electronic device that is used to convert digital signal to an analogue
signal.

Definition. 2.3
Cipher text is encrypted text. Plaintext is what you have before encryption, and cipher
text is the encrypted result. The term cipher is sometimes used as a synonym for cipher text,
but it more properly means the method of encryption rather than the result.

Definition. 2.4
Cryptography is the study of methods to send and receive secret message.In private
key cryptography, the sender and receiver agree in advance on a secret code, and then send
message using the code.In public key cryptography, the encoding method can be published.
Each person has a public key used to encrypt message.The original message is called the
plain text.The encoded text is called Cipher text.

3
CHAPTER III
 CHAPTER III
MATRICES THEORY IN CRYPTOGRAPHY

This chapter deals with how matrices are used in encoding and decoding process of
cryptography.

Definition. 3.1
A matrix is a rectangular array of m×n elements, in which m is the number of rows and n
is the number of columns A matrix is normally denoted with a boldface uppercase letter such
as A. The element aij is located in the ith row and jth column . Although the elements can be a
set of numbers. We discuss only the matrices with elements in Z.
Matrix A: n columns
 a11 a12  a1m 
a a 22  a 2 m 
m rows  21
 .. .. .. ... 
 
 a l1 al 2  alm 

Definition. 3.2
We can multiply two matrices of different sizes if the number of columns of the first
matrix is the same as the number of rows of the second matrix. If A is an l × m matrix and B
is an m × p matrix, the product of the two is a matrix C of size 1 × p. If each element of
matrix A is called aij, each element of matrix B is called bjk, then each element of matrix C,
Cik can be calculated as

Cjk=  aij × bjk = ail × blj + ai2 × b2j+ …..+ aim × bmj

Definition. 3.3
Let A denote an n × n symmetric matrix with real entries and let x denote an n × 1
column vector. Then Q = x’ Ax is said to be quadratic form.
Definition. 3.4
If A is an n × n matrix and I be an n × n identity matrix, then the n × n matrix B (also
called as B = A−1 ) said to be inverse matrix such that AB = BA =I.

4
Definition. 3.5
An n × n matrix A is called nonsingular or invertible if and only if there exists an n × n
matrix B such that AB = BA = In. Where Inis the identity matrix. The matrix B is called the
inverse matrix of A.

Definition. 3.6
A Square matrix, all of whose elements, except those in the leading diagonal are zero
is called Diagonal Matrix

Definition. 3.7
If the transpose of a matrix is equal a to itself, that matrix is said to be symmetric.
For example: ie, A=AT

Definition.3.8
A Cofactor is the number when the column and row of a designated element in a
matrix is removed, which is just a numerical grid in the form of a rectangular or a square.

Definition.3.9
The Adjoint of a square matrix A= [aij] n x n is defined as the transpose of the
matrix [Aij] n x n, where aij is the cofactor of the element aij. Adjoining of the matrix A is
denoted by adj A.

Theorem. 3.1
A text message of strings of some length / size L can be converted in to a matrix
(called a message matrix M)of size m× n where n ‹ m and n is the least such that m × n ≥ l
depending up on the length of the message with the help of suitably chosen numerals and
zeros.
Proof:
The proof is by enumeration on numbers.
Consider the following, For the text message of length up to l=9; then we have m=3; n=3.
Similarly, for the text message of length up to1=12 we have m=4; n=3…..,. Hence the proof
5
EXAMPLE 3.3.1:
Encoding process:
Consider the message to be sent
PACK MY BAG
STEP 1: Assign the number to the alphabets
Alphabet A B C D E F G H I
Number 1 -1 2 -2 3 -3 4 -4 5

J K L M N O P Q R S
-5 6 -6 7 -7 8 -8 9 -9 10

T U V W X Y Z Space

-10 11 -11 12 -12 13 -13 0

Also, assign the number 0 to a blank or space between two words.

STEP 2: Convert the text message into numerals.

P A C K M Y B A G

-8 1 2 6 0 7 13 0 -1 1 4

STEP 3: Rearrange these numbers in to a matrix M(Row wise and column wise)
−8 1 2
 
 6 0 7
M=  of order 4 by 3
13 0 − 1
 
 1 4 0 

STEP 4:Multiply this message matrix by the encoder A

6
  − 1 − 10 − 8 
 
A=  − 1 − 6 − 5 
 0 −1 −1
 

−8 1 2
   − 1 − 10 − 8 
 6 0 7 
X=MA=    −1 − 6 − 5
13 0 −1 
  0 − 1 − 1 
 1
 4 0  

 7 72 57 
 − 6 − 67 − 55 
X=  
− 13 − 129 − 103
 
 − 5 − 34 − 28 

STEP 5: The encoded numeric messages to be sent

7 72 57 -6 67 -55 -13 -129 -103 -5 -34 -28

Decoding process:
STEP 1: Find the inverse matrix A
 − 1 − 10 − 8 
 
A=  − 1 − 6 − 5 
 0 −1 −1
 
1
A −1 = adj A
A

− 1 − 10 − 8
│A│= − 1 − 6 − 5 = -1(6-5) + 10(1+0) -8(1+0)
0 −1 −1

= -1(1)+10-8
=1

7
 t
 −6 −5 −1 −5 −1 −6 
+ − + 
 −1 −1 −1 −1   1 −1 1 
t
0 0
 − 10  
−8 −1 −8 −1 − 10  − 2 1 − 1
adjA=  − + −  =
 −1 −1 0 −1 0 −1   2 3 − 4 

 − 10 −8 −1 −8 −1 − 10 
 + − + 
 −6 −5 −1 −5 −1 − 6 

 1 −2 2 
 
adjA =  − 2 1 − 1 
 2 3 − 4 


 1 −2 2 
1 1 
-1
A = (adjA)=  − 1 1 3 
A 1 
 1 −1 − 4 

 1 −2 2 
 
A =  −1 1
-1
3 
 1 −1 − 4 
 
STEP 2: Multiply this encoded matrix by the decoder A-1
 7 72 57 
 − 6 − 67 − 55   1 −2 2 
 
M=XA-1=    −1 1 3 
− 13 − 129 − 103  1 −1 − 4 
   
 − 5 − 34 − 28 
−8 1 2
 
 6 0 7
M= 
13 0 − 1
 
 1 4 0 


STEP 3: This stream of numerals converted to the text of the original message.
-8 1 2 6 0 7 13 0 -1 1 4
P A C K MY B A G
8
3.4 METHOD 2
A text message of strings of some length/size 1 from the sender is converted in to a
stream of numerals with the help of some coding process (Probably may be the standard
codes like A - 1, B - 2,…z - 26 and for space - 0) which is again converted in to a matrix
(called a message matrix M) of size m × n where n ‹ m and n is the least such that m × n ≥ 1
depending upto the length of the message. In such case the size of the Encoder (The induced

Diagonal matrix of a Quadratic form of suitable variables) becomes N . Then the Encode
need not to be an arbitrary matrix where as it may be taken as a diagonal matrix of size n
whose inverse can be readily obtained.
Then the message matrix is converted into a New Matrix X (Encoded Matrix) using Matrix
Multiplication as X = ME. Then this is sent to the receiver. Then the receiver decodes this
matrix with the help of a matrix D (Decoder matrix) which is nothing but the inverse of the
encoder (ie, A=A-1), to get the message matrix back as M = XE-1. Then with the previously
used codes the receiver can get back the message in terms of the numerals which again can be
converted to the original text message. When the length/size of the text message is too large,
the value of n become higher, leading to the need of higher order diagonal matrices induced
from the quadratic forms of higher number of variables.
3.3.1: Algorithm
Encoding process
1. Covert the next message of length l in to a stream of Numerals using a user friendly
scheme for both the sender and the receiver.
2. Place the numerals into matrix of order m × n where n ‹ m and n is the least such that m
≥ 1 where n depends on the size of the message and call this as a Message Matrix M.
3. Multiply this message matrix by the Encoder E of size n. (Normally a induced diagonal
matrix compatible for the product X = ME) and get the encoded matrix X.
4. Convert the message matrix in to the stream of numbers that contains the encrypted
message and send to the receiver.
Decoding Process:
1. Place the encrypted streams of numbers that represent the encrypted message to a
matrix.

9
 2. Multiply the encoded matrix X with the decoder D = E -1 (The inverse of E) to get back
the message matrix M.
3. Convert this message matrix in to a stream of numbers with the help of originally used
scheme.
4. Convert this stream of numerals in to the text of the original message.

EXAMPLE. 3.4.1:

ENCODING PROCESS:

Consider the message to be sent: GOOD MORNING

STEP 1: The standard codes as follows:

A → 1 ; B → 2 ; ……………. ; Z → 26 and space → 0

STEP 2: Convert the above message in to a stream of numerical values as follows :

GO O D M O R N I N G

7 15 15 4 0 13 15 18 14 9 14 7

STEP 3: Construct the message matrix M with this stream of numerals as

7 15 15
4 0 13
M=[ ]Which is of order 4×3.(using theorem)
15 18 14
9 14 7

STEP 4: Based on this, the 3rd order diagonal matrix (The diagonalized matrix of the matrix
of a Quadratic form of suitable variables otherwise called the matrix of the canonical form).

Example: If the Quadratic form is 2x12+x22+x32+2x1x2-2x1x3-4x2x3

then the matrix of the Quadratic form is

10
 2 1 −1
[1 1 −2] . Also , the canonical form is –y12+y22+4y32 whose matrix is given by D(-
−1 −2 1
−1 0 0
1,1,4)=[ 0 1 0]
0 0 4

−1 0 0
STEP 5: Then the Encoder as E =[ 0 1 0]
0 0 4

STEP 6: Then the encoded matrix is given by

7 15 15 −7 15 60
−1 0 0
4 0 13 −4 0 52
X = ME =[ ][ 0 1 0]=[ ]
15 18 14 −15 18 56
0 0 4
9 14 7 −9 14 28

STEP 7:The encoded numeric message is given by

-7 15 60 -4 0 52 -15 18 56 -9 14 28

DECODING PROCESS:

STEP 1: Find the Decoder E-1 is given by

−1 0 0
E=[ 0 1 0]
0 0 4

1
E-1= |𝐸| (adjE)

−1 0 0
|𝐸|=| 0 1 0|=-1(4-0)-0+0 =4
0 0 4

11
 1 0 0 0 0 1
+| | −| | +| |
0 4 0 4 0 0
0 0 −1 0 −1 0
AdjE= − | | +| | −| |
0 4 0 4 0 0
0 0 −1 0 −1 0
(+ |1 0
| −|
0 0
| +|
0 1)
|

4 0 0
= [0 −4 0 ]
0 0 −1

4 0 0 −1 0 0
1 1
-1
E = |𝐸|
(adjE) = [0
−4
−4 0 ] =[ 0 1 01 ]
0 0 −1 0 0 4

STEP 2: The encoded numeric message is to be decoded by first writing the encoded matrix
from the received message as

−7 15 60 −1 0 0 7 15 15
−4 0 52 0 1 0] =[ 4 0 13
M= XE-1 = [ ][ ]
−15 18 56 0 0 1 15 18 14
−9 14 28 4 9 14 7

STEP 3: The matrix M is converted in to numeric message as

7 15 15 4 0 13 15 18 14 9 14 7

STEP 4: This stream of numerals is converted in to the text message as

7 15 15 4 0 13 15 18 14 9 14 7
GO O D M O R N I N G
3.5 METHOD 3:

ALOGRITHM:

ENCODING PROCESS:
1. Convert the text message of length I into a stream of Numerals using a user friendly scheme
for both the sender and the receiver again convert the text message into a stream of
numerals using the standard codes.
2. First text message is converted into a matrix using A-7,B-6,……,Z-21.Again the text
message is converted into matrix using standard codes ( A-1,B-2,……Z-26 ).
12
3. Standard codes matrix is converted into a confusing message using A-7,B-6,…….Z-21.
DECODING PROCESS:
Reversing the process of encoding.

EXAMPLE. 3.5.1
Instead of using the standard codes

Alphabet A B C D E F G H I J K L M
Number 1 2 3 4 5 6 7 8 9 10 11 12 13
Alphabet N O P Q R S T U V W X Y Z Space
Number 14 15 16 17 18 19 20 21 22 23 24 25 26 0

Use the codes assigned as

Alphabet A B C D E F G H I J K L M
Number 7 6 5 4 3 2 1 8 9 10 11 12 13

Alphabet N O P Q R S T U V W X Y Z Space
Number 15 16 17 18 19 14 20 26 25 24 23 22 21 0

(In a random way or by using some generator using Number theory or Combinatorics)
By above method we can also solve this for assigned codes

1 16 16 7 15 15
4 0 13 4 0 13
M =[ ] Instead of M = [ ]
16 19 15 15 18 14
9 15 1 9 14 7
Anyone who intervene the communication uses the standard codes for this message
matrix will get a confusing like ANNO MNQSISA. So messengers are advised to make use of
their convenient system of codes in order to have higher security level.

13
3.6 OPERATION ON STRINGS:
Define the operator +(The string addition) as usual in the case of addition of strings.
Example: Good+Morning = Good morning.
Using this operation, decompose the message of larger length in to message of shorter
lengths and finally these are coined to get the message of larger length.
EXAMPLE 3.6.1:
Consider the message
M: GOOD LUCK AND ALL THE BEST. This message is decomposed in to two
message as follows,
M = M1 + M2 Where M1 = GOOD LUCK & M2 = AND ALL THE BEST.
We can also solve this example by above methods.

14
CHAPTER IV
 CHAPTER IV

NUMBER THEORY IN CRYPTOGRAPHY

This chapter deals the concepts of number theory and applications of number theory in
encoding and decoding process of cryptography.

4.1 Number Theory:

Number theory is a branch of pure mathematics devoted to the study of the natural numbers
and the integers. It is the study of the set of positive whole numbers which are usually called
the set of natural numbers. As it holds the foundational plane in the discipline, Number Theory
is also called “THE QUEEN OF MATHEMATICS”.

4.2 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

Alphabet A B C D E F G H I J K L M
Assigning D E F G H I J K L M N O P
Alphabet

Alphabet N O P Q R S T U V W X Y Z
Assigning Q R S T U V W X Y Z A B C
Alphabet

4.3 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. m/a-b. It is

denoted by ab(mod m)

For example 133(mod 5)

15
4.3.1 Properties of congruence

1). a  b(mod m) if and only if b  a(mod m)

2). a  b + c( mod m) if and only if a-c  b (mod m)

3). a  b (mod m) and a b( mod m ) then a + a b + b( mod m)

4). a  b (mod m) and c is any integer then ca  cb (mod m)

5). a + mk  a(mod m) where k is any integer

4.3.2 Congruence Modulo :

Let m be a positive integer, a is congruent to b(mod m) if m/(a-b) where a and b are integers
that is a = b + km and k∊ z, a  b(mod m) is called congruence relation, the number m is the
modulus of congruence.

4.4 METHOD 1:
4.4.1 Algorithm:
Encoding Process:
1. Convert the text message into numerals.
2. By using congruence CP+3(mod26) numerals values converted into another number
value.
3. This numeral values are converted into confusing message.

Decoding Process:

1. Covert the confusing message into Numerals.

2. By using congruence PC-3 (mod 26)
3. This numeral values are converted into text message.

16
4.4.2 EXAMPLE:

NUMBER THEORY IS EASY is transformed into QXPEHU WKHRUPLV 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

Alphabet A B C D E F G H I J K L M
Number 0 1 2 3 4 5 6 7 8 9 10 11 12

Alphabet N O P Q R S T U V W
Number 13 14 15 16 17 18 19 20 21 22

Alphabet X Y Z
Number 23 24 25

Now if P is the plain text and C is the cipher text then CP+3(mod 26)

N U M B E R T H E O R Y I S EA S Y

13 20 12 1 417 19 7 4 14 17 24 8 18 4 0 18 24

Using Congruence C=P+3(mod 26),for each alphabet and corresponding digit we get

16 23 15 4 7 20 22 10 7 17 20 1 11 21 7 3 21 1

Q X P E H U WK H R U B L V HDV B

To recover plain text this procedure is reversed by using C-3=P(mod 26)

That is PC-3 (mod 26)

17
4.5 METHOD 2:

4.5.1 Algorithm:

Encoding Process:

1.Splitting the plaintext into successive letters of three

2.Assigning numeral values to each letter and arrange them as m × n matrix.

3.multiply the message matrix and key matrix A with (mod 26). Where A as a non-
singular matrix and get the m × n matrix.

4.This m × n matrix is converted into the text message. The text message is considered as
a encrypted message.

Decoding Process:

1.Splitting the encrypted message into successive letters of three.

2.Assigning numeral values to each letter and arrange them as m × n matrix.

3.Multiply the encrypted matrix and inverse of A with (mod 26) and get the m × n
matrix.

4.This m × n matrix is converted into the text message. The text message is considered
as a decrypted message.

4.5.2 EXAMPLE 1:

As there are 26 letters in alphabet, so taking matrix modulo 26.

Alphabet A B C D E F G H I

Number 1 2 3 4 5 6 7 8 9

Alphabet J K L M N O P Q R

Number 10 11 12 13 14 15 16 17 18

18
 Alphabet S T U V W X Y Z

Number 19 20 21 22 23 24 25 26

The encoded matrix can be formed by multiplying a non - singular matrix by the
corresponding column vectors. Consider the

Alphabet A B C D E F G H I

Number 1 2 3 4 5 6 7 8 9

-26 -25 -24 -23 -22 -21 -20 -19 -18

Alphabet J K L M N O P Q R

Number 10 11 12 13 14 15 16 17 18

-17 -16 -15 -14 -13 -12 -11 -10 -9

Alphabet S T U V W X Y Z space

Number 19 20 21 22 23 24 25 26 0

-8 -7 -6 -5 -4 -3 -2 -1 0

Encoding process:

Consider the message to be sent

TIT FOR TAT

STEP 1: Spiliting the plaintext into successive letters of three

TIT FOR TAT

19
STEP 2: Assigning numerical value to each letters from the above table,and arrange them as
3 x 1 matrix

 20  6  20 
TIT =  9  FOR= 15 TAT =  1 
 20  18  20 

STEP 3: Multiply this message matrix by the key matrix A with (mod 26)

1 2 3
A= 0 1 4
5 6 0

1 2 3  20   98   20 
0 1 4  9  mod26 =  89  mod26 = 11  →ULY
      
5 6 0  20  154  24 

1 2 3  6   90  12
0 1 4 15 mod26 =  87  mod26 =  9  →MJQ
      
5 6 0 18 120 16

1 2 3  20   82  4
0 1 4  1  mod26 =  81  mod26 =  3  →EDC
      
5 6 0  20  106  2 

STEP 4: The encrypted message to be sent is

ULYMJQEDC

20
Decoding process:
STEP 1: Find the inverse matrix A

1 2 3
A= 0 1 4
5 6 0

1
A−1 = (adjA)
A

− 24 28 5
A =  20 − 15 − 4
−1
 − 5 4 1 

 2 18 5 
= 20 11 12
 21 4 1 

STEP 2: Multiply this encrypted matrix by the inverse of key matrix A with (mod26)

 2 18 5  U   2 18 5  20  358  20

20 11 22  L  mod 26 = 20 11 22 11 mod 26 = 1049 mod 26 =  9 
         
 21 4 1   Y   21 4 1  24  488  20

→TIT

 2 18 5  M   2 18 5  12 266 6

20 11 22  J  mod 26 = 20 11 22  9  mod 26 =  691 mod 2615
         
 21 4 1   Q   21 4 1  16 304 18

→FOR

21
 2 18 5   E   2 18 5  4  72  20
20 11 22  D mod 26 = 20 11 22 3 mod 26 = 157 mod 26 =  1 
         
 21 4 1  C   21 4 1  2  98  20

→TAT

STEP 3: The decrypted message is

TIT FOR TAT

22
CHAPTER V
 CHAPTER V

APPLICATIONS OF CRYPTOGRAPHY IN REAL LIFE

Cryptography in modern living

• Secure Communications
➔ Document/Data/email Encryption
Cryptography in everyday life' contains a range of situations where the use of
cryptography facilitates the provision of a secure service: cash withdrawal from an
ATM, Pay TV, email and file storage using Pretty Good Privacy (PGP) freeware,
secure web browsing, and use of a GSM mobile phone.

• Identification and Authentication

➔ Smart Cards
Cryptography allows us to have confidence in our electronic transactions.

• Electronic Commerce and Payments

➔ ATMs / Credit Cards
➔ Net Banking / Web Security
Encryption is used in electronic transactions to protect data such as account
numbers and transaction amounts, digital signatures replace handwritten signatures
or credit card authorizations, and public-key encryption provides confidentiality.

23
CONCLUSION
 CONCLUSION

Keeping a secret is the standard use of cryptography. This is where one wants to either send
some information to someone else, or wants to store information in a way that prevents others
from snooping the files. Secure network communication, financial, government, medical,
even multiplayer games. Applications of number theory allow the development of
mathematical algorithms that can make information (data) unintelligible to everyone except
for intended users.

24