Registration number: 16mtcsnt11__ Subject Code CST-6201

Term Paper On Encryption Techniques

Rajesh kumar
M.Tech. Student
Centre for Computer Science & Technology
Central University of Punjab, Bathinda (Punjab).

Abstract
Encryption is the process of the transforming plaintext Fig.1 Encryption Process
into the ciphertext where the plaintext is the input to these
encryption process and ciphertext is the output of the encryption Decryptions are the process to transforms or converting the
process. Decryption is the process of transforming ciphertext into encoded data into some meaningfuls.It can also be said that
the plaintext where ciphertext are the input to the decryption decryption is the process of transforming ciphertext into the
process and plaintext is the output of the decryption process. plaintext where ciphertext is the input to the decryption process
Therese are various encryption algorithms exists classified as
and plaintext is the output of the decryption process.
symmetric and asymmetrics encryption algorithms. Here, I
present an algorithm for data encryption and decryption which is
based on the ASCII values of characters in the plaintext. That Key
algorithm are used to encrypt data by using ASCII values of the Encoded Decryption Original Data
data to be encrypted. The secrets used will be modifying o Data Or
Process
another string and that string is used as a key to encrypt or Or Plaintext
decrypt the data. So, it can be said that its is a kind of symmetric Ciphertext
encryption algorithm because it uses same key for encryption
and decryption but by slightly modifying it. This algorithm
operates when the length of input and the length of key are same.

Keywords Encryption Algorithms, Cryptography, Caesar Cipher,

Vigenere Cipher, Playfair Cipher,RSA,DES,AES

I. INTRODUCTION
Cryptography is the art and science of study of
designing or make the secret message i.e. code or ciphers of
the originals message for the secures communications
between sender and the receiver. The main goals of
cryptography are Authentication, Privacy, Integrity, Non-
repudiation and Access Control. Encryptions are basically a
process or algorithm to make information hidden or secret. It
is considered as the subset of cryptography. It is the actual
process of applying cryptography. It is the process to
transform or converting the data into some another form that
appears to be random, meaningless and unintelligible. It can Secret Key
also be said that encryption is the process of transforming
plaintext into the ciphertext where plaintext is the input to the
Fig.2 Decryption Process
encryption process and ciphertext is the output of the
encryption process.
A cryptographic algorithm is a mathematical functions and
unchanging set of steps to perform encryption anddecryption of the
original data possible to decrypt the generated ciphertext without
Origina Encoded using the key. If a really good cryptographic algorithm is used,
l Data Encryption Data then there is no technique significantly better than methodically
Or Process Or trying every possible combination of key
Plainte Ciphertex I. Encryption Algorithm:
xt t Encryption Algorithm are categorized into two categories as
follows:-
a) Symmetric Key Encryption

1
Registration number: 16mtcsnt11__ Subject Code CST-6201

In symmetric encryption algorithm, only one key is used for both

encryption and decryption process. The key is transmitted to both the
sender and receiver before. The key is transmitted to both the sender
and receiver before the process of encryption and decryption. So, the
secret key plays an important role and its strength depends on the
length of key (in Secret bits). .
b) Asymmetric Key Encryption-
In symmetric key encryption algorithm, it is necessary to distribute
the key before the encryption and decryption because the same key
is used for both purposes. This problem of distribution of key in
symmetric algorithms is solved by asymmetric key encryption
algorithm. It uses two types of keys, Private keys and Public Keys.
Public Key is used to encrypt the original data or plaintext and
generate a ciphertext. This ciphertext is decoded by the receiver as
and when it receives by using its own Private Key. Private Key is a) Caesar Cipher:
also known as secret key because it is unknown to all or known only Ceasar cipher is a classical substitution cipher, and one of the
to the person who is intender to receive it or can say authorized simplest example of substitution cipher , suppose plaintext is
person. But public keys can be stored in public databases for anyone HELLOwith key is 3 then it convert into ciphertext then result
to see. Asymmetric key encryption algorithms are RSA decryption of ciphertext is KHOOR Substitution cipher: We can replace one
the original data. The main objective of every cryptographic character with another
algorithm is to make it as difficult as possible to decrypt the b) Vigenere Cipher
generated ciphertext without using the key. If a really good At vigenere cipher it does not depend on the plaintext character ,it
depend only on the position of the character in the plaintext.This
cryptographic algorithm is used, then there is no technique
keyword is repeated to cover the length of these plain text that is tobe
significantly better than methodically trying every possible encrypted example is shown below:Suppose keyword fauzan then
combination of key. repeated
Key: KEY: f a u z a n f a u z a n
A Keys are a numeric or alpha numeric text or may be special Plaintext: c r y p t o g r a p h y
symbol. The Key is used at the time of encryption takes place on Cipher: H R S O T B L R U O H L
these Plain Text and at the time of decryption place on the Cipher As we can see from above example that fauzan is the keyword and
Text. The selection of key in Cryptography is very important since plain text is cryptography which was encrypted in to
the security of encryption algorithm depends directly on it. HRSOTBLRUOHL
c) Playfair Cipher
I. Purpose of Cryptography: Another example of classical cipher is Playfair cipher that has a
square of matrix of 5X5 alphabetic letters arranged in an appropriate
Cryptography provides a number of security goals to ensures the manner. We can select a key and place it in the matrix the remaining
privacy of data, non alteration of data and so on. Due to the great letters of English alphabet are then one by one placed in the matrix of
security advantages of cryptographyit is widely used today. Playfair cipher, the plain text is broken in to pairs and if a pair has
Following are the various goals ofcryptography same alphabet then they are separated by introducing a filler letter
a) Authentication: like x,
The process of proving ones identity.The privacy form s of host-to- otherwise
host authentication on the Internet today named based or address 1) If both letters fall in the same row,replace each with letter to
right(wrapping back to start from end )
based both of which are notoriously week .
2) If both letter fall in the same column,replace each with the letter
b) Confidentiality below it(again wrapping to top from bottom)
Information in computer is transmitted and has to be accessed only 3) Otherwise each letter is replace d by the letter in the same row
by the authorized party means that no one can read the message and in the column of the other letter of the pair.Plaintext is encrypted
except receiver. two letters at time.
c) Integrity For Example:
Only the authorized party is allowed to modify the transmitted
information.Assuring the receiver that the received the has not been Keyword=Galois
altered in any way from the original message . Plaintext=comes c means communications security
d) Non Repudiation Then matrix 5X5
Table
A mechanism to prove that the sender really send this message.
G A L O I/J
Figure: Depicting some of the techniques of Classical and Modern
Encryption S B C D E
F H K M N
P Q R T U
V W X Y Z

2
Registration number: 16mtcsnt11__ Subject Code CST-6201

Choose D(private key) such that ,

D*Emod(P-1)(Q-1)=1
Then cipher text(C.T)=(P.T)^EmodN
Ciphertext: DL FD SD ND IH BD DT YK ZU LE OQ GI UN BS Plain text(P.T)=(C.T)^DmodN
ER UL YO Example
Suppose two prime number 7 and 11, Encryption key is 13 and
plaintext is 5,find decryption key and cyphertext

Then P=7,Q=11
Then calculate,N=P*Q,N=77
Cryptography D*13mod=1
D=37
C.T=(5)^13mod77=26 the also
P.T=(26)^37mod77
II. Block cipher:
Asymmetric Symmetric Processing or encoding of a plaintext is done as a fixed length block
Encryption Encryption one by one.A block for example could 64,128 bit in size.A same key
is used to encrypts each of the block.more secures in most cases.kook
more likes an extremely large substitution.Usually more complex and
slowers in operation.

RSA
n-bit plaintext n-bit Plaintext

Block Cipher Stream Cipher

DES

RC4

Encryption k-bit key Decryption

AES

Blowfish

n-bit ciphertext n-bit ciphertext

I. RSA: figure:Block cipher

In RSA algorithm sender is encrypting with receivers public key and
receiver is decrypting its own private key.RSA algorithm comes
under asymmetric key cryptography.It is used to public key III. Stream cipher:
algorithm.Means public key algorithm are two type,One key is used
to encryption and another key is used to decryption.Encryption and
decryption used modular exponentially. Processing or encoding of plaintext is done bit by bit.A differencekey
Choose two large prime number P and Q, Calculate N, is used to encrypts each of the bit.High speed and low hardware
N=P*Q complexity.Equally secure if properly designe.Usually very simples
and much faster
3
 Registration number: 16mtcsnt11__ Subject Code CST-6201

KnK2,K1 Kn.K2,
K1

Cn.C2C1
Encryption Decryption

In presents day cryptography, AES is widely adopte and supporte in

Pn..P2P1 Pn..P2P1 both hardware and software. DES, the numbers of rounds in AES is
variables and depends on these lengths of these key. AES uses 10
round for 128-bit keys, 12 rounds for 192-bit keys and 14 rounds for
IV. Data Encryption Standard:
256-bit keys. Each of these rounds uses a differents 128-bit rounds
Overview: key, which is calculated from these originals AES key
Des is a block cipher as shown in figure,
The features of AES are as follows

64-bit plaintext 64-bit plaintext

128-bit data, 128/192/256-bit keys.Stronger and faster than

TripelDES .Provide full specification and design details.Software

implementable in C and Java

Blowfish:Blocks cipher: 64-bit,blocksVariable key length:32 bits to

448 bit Designed by Bruce Schneier,Much faster than DES and

DES
DES 56-bit key IDEAUnpatented and royalty-free,No licenses required
reverse
cipher
cipher

64-bit ciphertext 64-bit ciphertext

Figure: Encryption and Decryption withDES
At the encryption sites DES takes a 64-bit plaintext and create a
64-bit ciphertexts at the decryptions sites DES takes a ciphertext and
creates a 64-bit blocks of plaintext.The same 56-bit cipher keys is
used for both encryption and decryptions
Advanced Encryption Standard:
V. CONCLUSIONS
We use different type of algorithm to stablish security
services in different services mechanism.We use either private
key cryptography or public key cryptography according to
requirement.If we want to send message quickly we use
private key algorithm and we want to send messages secretely
we use public key algorithm.The tell us that algorithm for
modern and classicals technique have been builts by many
researcher overs a long period of time consisting implicitly of
something like a
worldwides human research networks.

VI. ACKNOWLEDGMENT
The satisfaction and euphoria that accompany the successful
completion of any task would be incomplete without
mentioning the names of people who made it possible, whose

4
Registration number: 16mtcsnt11__ Subject Code CST-6201

constant guidance and encouragement crowns all efforts with 2009.

our success. [6] Turki Al-Somani ,Khalid Al-Zamil Performance
This paper is dedicated to all the people, whom Evaluation of Three Encryption/Decryption Algorithms on
we met, took guidance, talk, interviewed and learn something the SunOS and Linux Operating Systems, Theses
from them. At this occasion we sincerely thank all of them
while submitting this term paper.
I extend my gratitude to Er. Meenakshi Mittal, who has
provided me with excellent infrastructure and awesome
environment that laid potentially strong foundation for my
professional life. We are thankful to him for giving time
totime and valuable guidance during the project period and
giving us guidance in taking our curriculum decision and
choosing, initiating and getting on with the projecte

VII. REFERENCES
[1] Gurjeevan Singh, Ashwani Kumar Singla, K.S. Sandha, Throughput
Analysis of Various Encryption Algorithms, International
Journal of Computer Science and Technology, Vol. 2, Issue 3, Septemver
2011.
[2] Diaa Salama Abd Elminaam, Hatem Mohamed Abdual Kader, and
Mohiy Mohamed Hadhoud, Evaluating the Performance of
Symmetric Encryption Algorithms, International Journal of Network
Security, Vol.10, No.3, PP.216222, May 2010.
[3] Gary C. Kessler An Overview of Cryptography , May 1998
[4] Fauzan Saeed and Mustafa Rashid, Integrating Classical Encryption
with Modern Technique, IJCSNS, Vol. 10, no.5, May 2010
[5] M. H. Ibrahim, Receiver-deniable public-key encryption",
International Journal of Network Security, Vol. 8, no. 2, pp. 159-165,