International Journal of Engineering and Technical Research (IJETR)

ISSN: 2321-0869 (O) 2454-4698 (P) Volume-7, Issue-5, May 2017

Survey and Analysis of Data Encryption Methods

and Development of A Security Model to
Encrypt/Decrypt Messages
Dr. Amit Mishra, Abdulrahman Abdulganiyu, Usman M Gana, Ayesha Awwal
propose and implement software architecture for message
Abstract Survey of the different encryption algorithms is encryption base on DES (data encryption standard) or AES
carried out and also the analysis of those algorithms in other to (Advance encryption standards).
determine their advantages and disadvantages. A message
encryption and encryption architecture is being proposed and II. LITERATURES REVIEW
implemented for secure communication among the members of
ibbu.edu.ng. Cryptography is the discipline of writing a message in cipher
text, usually by a translation from plaintext according to some
Index Terms Encryption, Decryption, Security Model (frequently changing) key text, with the aim of protecting a
secret from adversaries, interceptors, intruders, interlopers,
I. INTRODUCTION eavesdroppers, opponents or simply attackers, enemies.
It's no new news that we are gradually shifting into a digital Professional cryptography protects not only the plaintext, but
world where all most everything is processed electronically. also the key and more generally tries to protect the whole
As good as it may sound; it will definitely have issues when it cryptosystem
comes to unauthorized access to confidential data and private Cryptography is also the mathematics of making a system
network. We need to provide a mechanism for protecting such secure which is different from making the actual system
data. secure (Schneier, 1995). It can also be defined as the science
Although authentication is used to provide security to a and art of securing your communication from unwanted
certain extent but it takes far more than that when the network person or adversary.
is been hijacked/compromised by hackers for personal a. Encryption Schemes
interest. Encryption provides us with higher level of security The problem of providing secret communication over
because the data stolen will be of no use to the hacker because insecure media is the most traditional and basic problem of
its been converted to a cipher. A text, message or data that is cryptography. The setting consists of two parties
converted into gibberish format using any the encryption communicating over a channel that possibly may be tapped by
algorithm is known as a cipher. a third party, called the wire-tapper or hacker. The parties
Encryption these days is used to protect unwanted access to wish to exchange information with each other, but keep the
data ranging from government confidential information, third party as ignorant as possible regarding the content of
companies research, communication between two or more their communication. An encryption scheme is a protocol
device ( i.e. computers, smart-phones, tablets) and also our allowing two or more parties to communicate secretly with
personal information and confidential data on our Personal each other while keeping the third party as ignorant as
computers. possible regarding the content of their communication. This
Although encryption seems to provide the needed security on encryption scheme consists of a pair of algorithms.
our data, definitely it has its own short comings because no One algorithm, called encryption, is applied by the sender
system is perfect. A smart hacker can find such vulnerabilities while the other algorithm, called decryption, is applied by the
and exploit the system so that he can have his hands on the receiver. Hence, in order to send a message, the sender first
data he needs. Most common problem of data encryption is: applies the encryption algorithm to the message and sends the
keeping key safe to ensure that only the intended receiver has result, called the ciphertext, over the channel. Upon receiving
the key to decrypt the message, having a reliable encryption a ciphertext, the receiver applies the decryption algorithm to it
algorithm that is difficult to hack. and retrieves the original message called the plaintext.
This paper carries out Survey and analysis of the different Plaintext is denoted by M, for message, or P, for plaintext. It
encryption algorithms, and tries to find out the weakness in can be a stream of bits, a text file, a bitmap, and a stream of
the commonly used data encryption algorithms, it also digitized voice, a digital video image etc. As far as a computer
is concerned, M is simply binary data. The plaintext can be
intended for either transmission or storage. In any case, M is
Dr. Amit Mishra, Department of Mathematics/Computer Science the message to be encrypted. Ciphertext is denoted by C. It is
Ibrahim Badamasi Babangida University Lapai, Nigeria also binary data: sometimes the same size as M, sometimes
Abdulrahman Abdulganiyu, Department of Mathematics/Computer larger. (By combining encryption with compression, C may
Science Ibrahim Badamasi Babangida University Lapai, Nigeria be smaller than M. However, encryption does not accomplish
Usman M Gana, Department of Mathematics/Computer Science Ibrahim
Badamasi Babangida University Lapai, Nigeria
this.) The encryption function E, operates on M to produce C.
Ayesha Awwal, Department of Mathematics/Computer Science Ibrahim Or, in mathematical notation:
Badamasi Babangida University Lapai, Nigeria E (M) = C (1)

190 www.erpublication.org
Survey and Analysis of Data Encryption Methods and Development of A Security Model to Encrypt/Decrypt Messages

In the reverse process, the decryption function D operates on Encryption and decryption with a symmetric algorithm are
C to produce M: denoted by:
D(C) = M (2)
Since the whole point of encrypting and then decrypting a EK(M) = C equation 10
message is to recover the original plaintext, the following D(C) = M equation 11
identity must hold true: Symmetric algorithms are divided into two main categories.
D (E (M)) = M (3) Some operate on the plaintext/ciphertext a single bit (or
sometimes byte) at a time; these are known as stream
b. Algorithms and Keys
algorithms or stream ciphers.
A cryptographic algorithm, also called a cipher, is the
mathematical function used for encryption and decryption. i. AES/Rijndael encryption
(Generally, there are two related functions: one for encryption Rijndael is a block cipher, designed by Joan Daemen and
and the other for decryption.) Vincent Rijmen as a candidate algorithm for the AES. AES
If the security of an algorithm is based on keeping the way that stands for Advanced Encryption Standard. AES is a
algorithm works a secret, it is a restricted algorithm. symmetric key encryption technique which will replace the
Restricted algorithms have historical interest, but are commonly used Data Encryption Standard (DES). The
woefully inadequate by todays standards. A large or Advanced Encryption Standard algorithm approved by NIST
changing group of users cannot use them, because every time in December 2001 uses 128-bit blocks.
a user leaves the group everyone else must switch to a
different algorithm. If someone accidentally reveals the ii. Blowfish
secret, everyone must change their algorithm. (Schneier, Blowfish is a symmetric encryption algorithm designed in
1995) 1993 by Bruce Schneier as an alternative to existing
Modern cryptography solves this problem with a key, denoted encryption algorithms. Blowfish has a 64-bit block size and a
by K. This key might be any one of a large number of values. variable key length - from 32 bits to 448 bits. It is a 16-round
The range of possible values of the key is called the key space. Feistel cipher and uses large key-dependent S-boxes. While
Both the encryption and decryption operations use this key doing key scheduling, it generates large pseudo-random
(i.e., they are dependent on the key and this fact is denoted by lookup tables by doing several encryptions.
the k subscript), so the functions now become:
EK(M) = C (4) iii. CAST
DK(C) = M (5) CAST stands for Carlisle Adams and Stafford Tavares, the
Those functions have the property that inventors of CAST. CAST is a popular 64-bit block cipher
DK(EK(M)) = M (6) which belongs to the class of encryption algorithms known as
Some algorithms use a different encryption key and Feistel ciphers. CAST-128 is a DES-like
decryption key. That is, the encryption key, K1, is different Substitution-Permutation Network (SPN) cryptosystem. It
from the corresponding decryption key, K2. In this case: has the Feistel structure and utilizes eight fixed S-boxes.
EK1(M) = C (7) CAST-128 supports variable key lenghts between 40 and 128
DK2(C) = M (8) bits.
DK2(EK1(M)) = M (9)
All of the security in these algorithms is based in the key (or iv. Data Encryption Standard (DES)
keys); none is based in the details of the algorithm. This In 1977 the Data Encryption Standard (DES), a symmetric
means that the algorithm can be published and analyzed. encryption algorithm, was adopted in the United States as a
Products using the algorithm can be mass-produced. It federal standard. Digital Encryption Standard (DES) is a
doesnt matter if an eavesdropper knows your algorithm; if symmetric block cipher with 64-bit block size that uses a
she doesnt know your particular key, she cant read your 56-bit key.
messages.
c. Symmetric Algorithms v. Triple DES
Triple DES encrypts data three times and uses a different key
Symmetric algorithms is one of the two types of encryption
for at least one of the three passes giving it a cumulative key
algorithms, sometimes called conventional algorithms, are
size of 112-168 bits. That should produce an expected
algorithms where the encryption key can be calculated from
strength of something like 112 bits, which is more than
the decryption key and vice versa. In symmetric algorithms,
enough to defeat brute force attacks. Triple DES is much
they use the same key for both encryption and decryption.
stronger than (single) DES; however, it is rather slow
compared to some new block ciphers.

vi. Lucifer
Developed in the 1960s, by IBM initiated research program in
computer cryptography, led by Horst Feistel and later led by
Walt Tuchman. Lucifer is a substitution-permutation network,
with building blocks similar to DES. In DES, the output of the
function f is XORed with the input of the previous round to
form the input of the next round. Table 2.1: Advantage and
Figure 2.1: Diagram illustrating symmetric encryption. weakness in symmetric algorithms

191 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P) Volume-7, Issue-5, May 2017
a series of modular multiplications. The basic RSA algorithm
Types Advantages Weakness
for confidentiality can be explained as below.
Susceptible to Ciphertext = (plaintext)^e mod n
Easy to be
differential Plaintext = (ciphertext)^d mod n
cryptanalysis and Private Key = {d, n}
implemented. It is ideal
DES similar algorithms,
for use on a
linear cryptanalysis, Public Key = {e, n}.
special-purpose chip. The basic RSA algorithm for authentication can be explained
brute force attack and
improved davies attack as below.
Vulnerable to ciphertext = (plaintext)^d mod n
Has a key schedule
differential plaintext = (ciphertext)^e mod n
LUCIFER cryptanalysis and private key = {d, n}
simpler than DES
related key
cryptanalysis
public key = {e, n}
Vulnerable to
2.5.2 Elliptic Curve Cryptography (ECC)
Faster DES in cryptanalysis, brute
FEAL Elliptic Curve Cryptography (ECC) provides similar
encrypting plaintext force attack and linear
cryptanalysis functionality to RSA. Elliptic Curve Cryptography (ECC) is
A strong algorithm, not being implemented in smaller devices like cell phones.
susceptible to linear and Vulnerable to brute
CAST
differential forms of force attack
cryptanalysis 2.5.3 El Gamal
El Gamal is an algorithm used for transmitting digital
signatures and key exchanges. The method is based on
A strong algorithm, not Has a weak key which calculating logarithms. Its algorithm is based on the
BLOWFISH susceptible to linear might make susceptible
forms of cryptanalysis to differential attack characteristics of logarithmic numbers and calculations. The
Digital Signature Algorithm (DSA) is based on El Gamal
algorithm.

2.5 Public-Key Algorithms 2.5.4 Digital Signature Algorithm (DSA)

The Digital Signature Algorithm (DSA) was developed by the
Public-key algorithms (also called asymmetric algorithms) United States government for digital signatures. Digital
are designed so that the key used for encryption is different Signature Algorithm can be used only for signing data and it
from the key used for decryption. Furthermore, the decryption cannot be used for encryption. The DSA signing process is
key cannot (at least in any reasonable amount of time) be performed through a series of calculations based on a selected
calculated from the encryption key. prime number. Although intended to have a maximum key
size of 1,024 bits, longer key sizes are now supported.
ElGamal digital signature scheme and borrows ideas from
Schnorr digital signatures for reducing signature size. We
describe a slight generalization of the algorithm that allows
for an arbitrary security parameter, whereas the standard only
supports a fixed parameter.

TABLE 2.2: Advantage and Weakness in asymmetric

algorithms
Types Advantages Weakness

Figure 2.1: Diagram illustrating asymmetric encryption. Susceptible to differential

Easy to be
cryptanalysis and similar
implemented. It is
Encryption using public key K is denoted by: algorithms, linear
DES ideal for use on a
cryptanalysis, brute force
EK (M) = C (12) special-purpose
attack and improved davies
Even though the public key and private key are different, chip.
attack
decryption with the corresponding private key is denoted by: Has a key Vulnerable to differential
DK(C) = M (13) LUCIFER schedule simpler cryptanalysis and related key
than DES cryptanalysis
Sometimes, messages will be encrypted with the private key Faster DES in Vulnerable to cryptanalysis,
and decrypted with the public key; this is used in digital FEAL encrypting brute force attack and linear
signatures (see Section 2.6). Despite the possible confusion, plaintext cryptanalysis
these operations are denoted by, respectively: A strong
EK(M) = C (14) algorithm, not
susceptible to Vulnerable to brute force
DK(C) = M (15) CAST
linear and attack
2.5.1 Rivest Shamir Adleman (RSA) differential forms
Ron Rivest, Adi Shamir, and Len Adleman released the of cryptanalysis
Rivest-Shamir-Adleman (RSA) public key algorithm in 1978. A strong
algorithm, not Has a weak key which might
This algorithm can be used for encrypting and signing data. BLOWFISH susceptible to make susceptible to
The encryption and signing processes are performed through linear forms of differential attack
cryptanalysis

192 www.erpublication.org
Survey and Analysis of Data Encryption Methods and Development of A Security Model to Encrypt/Decrypt Messages

2.5 Cryptanalysis Given: C1, P1= Dk(C1), C2, P2= Dk(C2),...Ci, Pi= Dk(Ci)
Deduce: k
The whole point of cryptography is to keep the plaintext (or This attack is primarily applicable to public-key algorithms. A
the key, or both) secret from eavesdroppers (also called chosen-ciphertext attack is sometimes effective against a
adversaries, attackers, interceptors, interlopers, intruders, symmetric algorithm as well. (Sometimes a chosen-plaintext
opponents, or simply the enemy). Eavesdroppers are assumed attack and a chosen-ciphertext attack are together known as a
to have complete access to the communications between the chosen-text attack.)
sender and receiver.
There are four general types of cryptanalytic attacks. Each of 6. Chosen-key attack. This attack doesnt mean that the
them with the assumptions that the cryptanalyst has complete cryptanalyst can choose the key; it means that he has some
knowledge of the encryption algorithm used in the system: knowledge about the relationship between different keys. Its
strange and obscure, not very practical.
1. Ciphertext-only attack. The cryptanalyst has the
ciphertext of several messages, in which all of them have been 7. Rubber-hose cryptanalysis. The cryptanalyst threatens,
encrypted using the same encryption algorithm. The blackmails, or tortures someone until they give him the key.
cryptanalysts job is to recover the plaintext of as many Bribery is sometimes referred to as a purchase-key attack.
messages as he can possibly recover, or to deduce the key or These are all very powerful attacks and often the best way to
keys used to encrypt these messages, in order to decrypt other break an algorithm.
messages encrypted with the same keys. 2.6 Security of Algorithms
Given: C1= Ek(P1), C2= Ek(P2),...Ci= Ek(Pi)
Different algorithms offer different level of security; it all
Deduce: Either P1, P2,...Pi; k; or an algorithm to infer Pi+1from
depends on how hard they are to break. If the cost required to
Ci+1= Ek(Pi+1)
break an algorithm is greater than the value of the encrypted
data, then youre probably safe. Lars Knudsen classified these
2. Known-plaintext attack. The cryptanalyst has access not
different categories of breaking an algorithm. In decreasing
only to the ciphertext of several messages, but also to the
order of severity:
plaintext of those messages. His job is to deduce the key (or
keys) used to encrypt the messages or an algorithm to decrypt
1. Total break. A cryptanalyst finds the key, K, such that
any new messages encrypted with the same key (or keys).
DK(C) = P.
Given: P1, C1= Ek(P1), P2, C2= Ek(P2),...Pi, Ci= Ek(Pi)
2. Global deduction. A cryptanalyst finds an alternate
Deduce: Either k, or an algorithm to infer P i+1from Ci+1=
algorithm, A, equivalent to DK(C), without knowing K.
Ek(Pi+1)
3. Instance (or local) deduction. A cryptanalyst finds the
plaintext of an intercepted
3. Chosen-plaintext attack. The cryptanalyst not only has
ciphertext.
access to the ciphertext and associated plaintext for several
4. Information deduction. A cryptanalyst gains some
messages, but he also chooses the plaintext that gets
information about the key or plaintext.
encrypted. This is more powerful than a known-plaintext
This information could be a few bits of the key, some
attack, because the cryptanalyst can choose specific plaintext
information about the form of the plaintext, and so forth.
blocks to encrypt, ones that might yield more information
An algorithm is unconditionally secure if, no matter how
about the key. His job is to deduce the key (or keys) used to
much ciphertext a cryptanalyst has, there is not enough
encrypt the messages or an algorithm to decrypt any new
information to recover the plaintext.
messages encrypted with the same key (or keys).
Cryptography is more concerned with cryptosystems that are
Given: P1, C1= Ek(P1), P2, C2= k(P2),...Pi, Ci= Ek(Pi), where
computationally infeasible to break. An algorithm is
the cryptanalyst gets to choose P1, P2,...Pi
considered computationally secure (sometimes called strong)
Deduce: Either k, or an algorithm to infer Pi+1from Ci+1=
if it cannot be broken with available resources, either current
Ek(Pi+1)
or future. Exactly what constitutes "available resources" is
open to interpretation.
4. Adaptive-chosen-plaintext attack. This is a special case
of a chosen-plaintext attack. Not only can the cryptanalyst
Complexity can be measured in different ways:
choose the plaintext that is encrypted, but he can also modify
his choice based on the results of previous encryption. In a
1. Data complexity. The amount of data needed as input to
chosen-plaintext attack, a cryptanalyst might just be able to
the attack.
choose one large block of plaintext to be encrypted; in an
2. Processing complexity. The time needed to perform the
adaptive chosen-plaintext attack he can choose a smaller
attack. This is often called the work factor.
block of plaintext and then choose another based on the
results of the first, and so forth. 3. Storage requirements. The amount of memory needed to
There are at least three other types of cryptanalytic attack. do the attack.
Still, if you assume that you have enough computing speed to
5. Chosen-ciphertext attack. The cryptanalyst can choose perform a million operations every second and you set a
different ciphertexts to be decrypted and has access to the million parallel processors against the task, it will still take
decrypted plaintext. For example, the cryptanalyst has access over 1019 years to recover the key. Thats a billion times the
to a tamperproof box that does automatic decryption. His job age of the universe.
is to deduce the key.

193 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P) Volume-7, Issue-5, May 2017
III. METHODOLOGY documents the keys are generated at the runtime by the sender
A. SOFTWARE REQUIREMENT of the message.
The software needed by the new system are series of 3) E. Proposed Architecture of the Encryption System
multi-user operating system that will support, control and Sender

co-ordinate the activities of the hardware. Therefore, the

software requirements include the following:
1. Multi user operating system like Window XP or Message(M) Key(k)

later versions, Unix, Linux etc.

2. A webserver like Apache, IIS for running your PHP
code. Encryption algorithm
3. Web browser like Mozilla, Internet explorer, Opera, Rijndael

Safari etc. to view the front end of the system.

4. A database management system, MySQL server
preferably for keeping of needed record.
Encrypted message
5. Jquery development library.
6. PHP 5 which is the language used in implementing our
encryption and decryption model.
Receiver
Rijndael algorithm

B. Program Design Methodology

The program for this system was designed using top down
approach. The problem was broken down into simple units.
The units were solved separately and later built up to form a Message(m)

whole system. The program was design under which each

module performs a specific operation; the modules were later
joined together using menu options for effective operation. B. SYSTEM FLOW CHART
C. Encryption/Decryption Scheme The encryption system is made up of file(s) sub-system
Rijndael/AES was used to in encrypting and decrypting the namely.
message. The AES is a symmetric block algorithm whose
i. Control subsystem: - this provides an interface
plaintext and ciphertext block size is 128 bits, and its keys can
between the user and the system and the
be 128, 192, or 256 bits long.
various sub systems. It is the part that
D. Proposed Database Design comes to play when the system is run.
The proposed database was designed in a way that it would ii. Inbox subsystem: - this displays each of the
suit the application flow and all the entities of the application. messages sent to that user. It displays the
The database consists of the following main entities to record message sender, subject and date in a
the application flow: users and messages. tabular form.
message iii. Encryption subsystem: - this describes
users encryption and sending of messages to the
PK messageid
desired receiver.
PK username
sender iv. Decryption subsystem: - this describes
password FK1 username decryption and receiving of messages from
subject the sender
message start

Figure 4.1: Database structure and entity relationship for the Username
& password

implementation of the project

No
Is valid?

1) 1. Users Yes

The users entity consist all the usernames and password of the Load inbox
users of the system. The username is used in establishing a
session for security of the program.
2) 2. Message
This entity contains all the information that is related to a Compose message View messages

message and which belongs to a user. The messageid in this Write message Decryption key
&key
entity includes a unique ID allotted to each record in this table
Encrypt message message
to uniquely identifying the message and username which
specifies to whom the message belongs to, message subject, send

sender and date the message was sent. The original message is
End
stored in encrypted format in the database. For encrypting the
Flow diagram of the system

194 www.erpublication.org
Survey and Analysis of Data Encryption Methods and Development of A Security Model to Encrypt/Decrypt Messages

A. Login Interface
The login interface is the first interface you will come across
in the system. It carries out the following; performs
authentication of the users and create session for managing
access

REFRENCES
Asymmetric Algorithms. (n.d.). Retrieved january 13, 2013,
from encryption and decryption:
http://www.encryptionanddecryption.com/algorithms/asymmetric_algorith
ms.html
[1] Huang, J. Z.-z. (2010). A Method for Secure Real-Time Image
Transmission Based on Optical Encryption. international conference
on the Intelligent Signal Processing and Communication Systems.
[2] Kuo, D. X.-C. (2004). Enhanced multiple Huffman table (mht) . IEEE
Transactions, 568-571.
[3] Mort Naraghi-Pour, V. S. (2011). Secure Detection in Wireless Sensor
Networks Using a Simple Encryption Method . IEEE transactions.
B. Inbox Interface [4] public key encryption. (n.d.). Retrieved january 13, 2013, from
encryption and decryption:
This displays each of the messages sent to that user. It http://www.encryptionanddecryption.com/encryption/public_key_en
displays the message sender, subject and date in a tabular cryption.html
form. [5] Rajashekarappa, K. M. (2013). Study on Cryptanalysis of the Tiny
Encryption. International Journal of Innovative Technology and
Exploring Engineering, 2(3), 88-89.
[6] Schneier, B. (1995). Applied Cryptography:Protocols, Algorithms,
and source code in c. Wiley.
[7] Suhaila O. Sharif, L. K. (2010). Classifying Encryption Algorithms
Using Pattern Recognition techniques. IEEE Transactions,
1168-1172.
[8] symmetric algorithms. (n.d.). Retrieved January 13, 2014, from
Encryption And Decryption:
http://www.encryptionanddecryption.com/algorithms/symmetric_alg
orithms.html
[9] Tilborg, H. C. (2005). Encyclopedia of Cryptography and secuirty.
Springer.

C. Encryption Interface
This is the interface where the message is being written and
encrypted using the encryption key.

D. Decryption interface
This is where messages are being decrypted and used viewed
using the decryption key.

195 www.erpublication.org