Encrption

Abstract

Advances in technology and the increase in computation power have changed the way of

life. Life has become much easier and mostly digital. Through this facilitation is for the welfare

of people, it also has raised some security as well as privacy concerns. The advancement in

computer networking has also boosted the cyber threats and risks. Intruders can get data and after

changing it they can use it launch different attacks or demand ransom from the individuals and

organizations. Thus to get rid of this, some data encryption methods and techniques have been

introduced. These include Symmetric encryption, Asymmetric encryption and hashing. The

important techniques for encryption are DES, Blowfish, RSA and AES etc. This research paper

aims to explore the importance of encryption, different methods and techniques use to encrypt

data, their advantages and disadvantages and a detailed step by step explanation of the encrypt

with the most used technique.

Keywords: Encryption, DES, Blowfish, RSA, AES

1. Introduction

1.1 Encryption

Encryption is the practice of coding of data for keeping it secure and protected.

Encryption is cultivated. Through a change or replacement of a series of alphabetical letters

having the information or data for creating a new string that is encoded. (Thambiraja, Ramesh, &

Umarani, 2012). This is likewise called cryptogram or cypher text and might be firmly saved or

communicated. Later, it may be translated back to original data, known as plain text, by turning

around the encryption technique used to decrypt data. Information or data encryption has been

utilized to send secret military and political messages from the times of Julius Caesar to the

present (Bauer, 2013). Its applications include the Washington-Moscow hotline, transferring

fund electronically, Email, securing the database, and different conditions where the transmission

of sensitive data is necessary. Applications that are not significant have incorporated Captain
Midnight Secret Decoding Rings that could be traced back to 1950s, puzzles present in

newspapers, and different other negligible applications.

1.2. Importance of Encryption

Development in computer networking technologies prompts a typical culture for

transferring or sharing data over the internet. Subsequently, it becomes very risky and

defenceless against duplicating data and reallocation by the intruders (Koko, Babiker, 2015).

Hence, data integrity is necessary while communicating over the internet, secret information like

Visas, cash exchanges, as well as Social Security or National Identity number, should be secured.

Encryption secures private data, delicate information, and can upgrade the security of

correspondence between client applications and servers. When information is secured by

encryption, regardless of whether an unapproved individual or element accesses it, they will not

have the option to understand it (Koko, Babiker, 2015).

2. Literature Review

This section provides some basic concepts and term related to the topic. Below is a brief

description of each key term.

2.1 Cipher Text

Cypher text is a code or a converted message.  Right when a plain book is arranged using

any sensible arrangement the resulting message is called as encoded text.

2.2 Encryption

The route toward encoding plain texts into figure texts is called encryption

2.3 Decryption

The contrary pattern of changing code texts back to the plain substance is called

decryption.

2.4 Key

A huge piece of performing encryption and deciphering is the key. It is the key used for

encryption and deciphering that makes the pattern of cryptography secure.

2.5 Plain Text

plain substance. It is seen by the sender, the recipient and by any person who gets an induction to

that message.

3. Methodologies/Types of Encryption

There are numerous data encryption approaches accessible to use. Most web security

experts have categorized encryption into three major types: 1) Symmetric, Asymmetric, and 3)

Hashing.

3.1 Symmetric Encryption

Symmetric encryption is also called private-key cryptography or a secret key calculation,

this strategy requires the sender and the beneficiary to access a similar key. In this way, the

beneficiary needs to have the key before the message is decoded. This strategy turns out to be

best for closed frameworks, which have less danger of an outsider interruption. On contrary,

symmetric encryption is quicker. However, both groups need to ensure the key is saved safely

and accessible only to the tool that necessities to utilize it.

3.2 Asymmetric Encryption

Public-key cryptography or Asymmetric encryption strategy utilizes two keys for the

encryption, a private as well as a public key. Both keys are numerically linked. The client utilizes

one key for encrypting and the other for decrypting data. The public key is openly accessible to

anybody, while the private key stays with the planned recipients just, who need it to interpret the

messages (Rewagad & Pawar, 2013). The two keys are basically enormous numbers that are not

identical yet are paired, this is where the asymmetric part comes in.

3.3 Hashing 

Hashing creates a novel signature of fixed length for a message. Every particular message

has a remarkable hash. Information encrypted with hashing cannot be unravelled or turned back

into its original structure. That is the reason hashing is utilized uniquely as a strategy for

verifying information. It is a compelling method of demonstrating that nobody has altered the

data (Korman & Avidan, 2015).

At present, numerous encryption techniques are being used. Few among them are most

successful while others have some risks. Below is the comparison of encryption techniques. 

4.1 Data Encryption Standard (DES)

DES, a block cypher, utilizes common encryption and decryption key to encode as well

as decode.  Data Encryption Standard algorithm as portrayed by Davis R. utilized a constant or

fixed-length line of message in simple language and changes it over a progression of muddled

tasks in numeric words or digit characters’ line of a similar length. In the Data Encryption

Standard algorithm, every words block has a 64-bit length (Lakhtaria, 2011). Moreover, Data

Encryption Standard utilizes a 56 bits long key to customize any change, thus decoding must be

carried by individuals that are aware of the specific key utilized for decoding a message. It has

16 indistinguishable phases of operation (Mitali & Sharmagone, 2014). It likewise has a first and

last Permutations (Kusuma et al. 2016). These are abbreviated as IP and FP, which are contrary

to each other (IP "fixes" an activity of FP, and vice versa). The key stages in the Data Encryption

Standard algorithm are given below:

 The first stage/ step has a 64-bit plain instant message which is passed to an Initial

Permutation (IP) task.

 In this step, the IP or Initial Permutation is actually carried on the provided or given plain

message.

 The above message generates the two permutations for a single message. One is Left

Plain Text (LPT) and the other is Right Plain Text (RPT) (Kusuma et al. 2016).

 Next, Left Plain Text (LPT) as well as the Right Plain Text (RPT) (Mitali & Sharmagone,

2014) through a 2 byte or 16 bits encryption procedure (Kusuma et al. 2016).

 At last, Final Permutation is carried out on LPT and RPT.

 This technique generates 64bits encrypted text in form of numbers (Kusuma et al. 2016). 

4.1.1 Advantages of Data Encryption Standard (DES)

numerous businesses as well as cash or money-related applications.

 Even though it was introduced in 1976, it proved to be resistant to maximum crypto-

analysis.

4.1.2 Diasadvanatags of Data Encryption Standard (DES)

 The key size utilized in this encryption algorithm is excessively little as per the current

encryption standards and its whole 56 character bits key can be found in around one day.

 It was found that the Data Encryption Standard algorithm is not secure and capable

enough due to advances in computational powers and technologies.

4.2 Advanced Encryption Standard (AES)

The more popular and for the most utilized symmetric encryption strategy these days is

the Advanced Encryption Standard (AES). It is discovered to be much faster than ECC and DES.

A substitute for Data Encryption Standard (DES) was necessary because the reason the key size

of DES was close to nothing. With expanded preparing power, it was seen as defenceless against

thorough key chase attack. AES supplanted DES (Dakate & Dube, 2012). That join supplanting

responsibilities by replacements and others consolidate changing pieces around these stages.

Amazingly, AES plays out the total of its assessments on bytes rather than bits. Instead of DES,

the total of rounds in AES varies depending on the length of the key. These cycles or rounds in

AES utilize another 128-digit key, which is determined from the essential key AES key

4.2.1 Advantages of Advanced Encryption Standard (AES)

 The AES technique aims to supplant the less secure and old algorithms, for example, the

DES technique.

 Highly confidential data can be successfully encrypted with AES by utilizing 192 or 256-

bit key.

 This technique of encryption is adaptable as well as quick.

 The application of this technique can be seen in different domains for example to make

sure about data in E-transfer and smart cards.

 The length or size of the key in this encryption method is too lengthy which makes this

technique difficult or complicated in some cases.  

 The execution of Advanced Encryption Standard technique becomes a challenge in the

case of  Galois or Counter Mode (GCM).

4.3 Blowfish Encryption

Blowfish is one of the well-known public key encoding techniques introduced by Bruce

Schneider. He is one of the world's famous cryptologists. The Blowfish technique was first

presented in 1993. Blowfish encodes 64 bits block cypher with a variable length of the key. It

contains two sections. The first is the creation of a sub-key (Kakkar et al., 2012). This section

changes over the key almost up to 448 (bits) in size form of subkeys to a sum of 4168 bits. The

second section is Data Encryption. This stage includes the iterations of a plain task to 16 times

(Kakkar et al., 2012). Each round contains permutation dependent on key and key permutation

dependent on data subordinate. This encryption technique is the most suitable where the key

stays consistent for a long time however not where the key changes regularly.

4.3.1 Advantages of Blowfish

 Blowfish is one of the quickest block codes encryption technique.

 Blowfish technique is not dependent upon any licenses and is consequently openly

accessible for anybody to utilize.

4.3.2 Disadvantages of Blowfish

 Every sender and receiver need a special key, so when the number of the client enhances,

key management gets convoluted.

 Blowfish technique cannot give confirmation as two individuals have a similar key. It

additionally has the shortcoming in decoding measure over different techniques as time

utilization and sequentially in throughput.

4.3 Rivest Shamir Adleman (RSA) Encryption

It is the best-protected strategy for data encoding.  The RSA was introduced in 1978 by three

persons (Rivest, Shamir and Adleman). Therefore, it is called RSA (Masadeh et al., 2010). It

holds the following features:

 The RSA technique is considered as a standard encryption algorithm for a closed or

restricted domain over the entire numbers along with prime numbers.

 Two keys in this method are again the public and the private keys.

 The keys produced or used in this technique are sufficiently gigantic which makes it

difficult for intruders to comprehend it. 

  

4.3.1 Advantages of Rivets Shamir Adleman (RSA)

 Exceptionally quick, straightforward encryption and check.

 Simpler to actualize than others.

 Marking and unscrambling are comparable; encryption and check are comparative.

 Broadly used, better industry uphold.

4.3.2 Disadvantages of Rivets Shamir Adleman (RSA)

 Exceptionally moderate key age.

 Slow marking and unscrambling, which are marginally precarious to actualize safely.

 The two-section key is helpless against GCD assault if ineffectively actualized.

5. Encryption with Most Used Technique (AES)

This section explains how the AES algorithm is actually performed. For this purpose, an

example is used.

The example utilizes 128 bits key and a message in 16 ASCI I characters.

Message in English: Thats my Kung Fu 

First, convert the given message into Hex.

T h a t s   m y   K u n g   F u
 It can be concluded from the above discussion that encryption is necessary for protecting

data from the intruders. Not all encryption techniques are fully successful but few techniques

from each type of encryption produce good results. The complexity of the encryption method

depends on the size of the key. The most used encryption technique is AES encryption. Though

encryption has helped a lot to protect the data but still more secure techniques are required.
 References

Dakate, D. K., & Dubey, P. (2012). Performance comparison of symmetric data

encryption techniques. IDEA, 128, 58.

Koko, S. O. F. M., & Babiker, A. (2015). Comparison of Various Encryption Algorithms

and Techniques for improving secured data Communication. IOSR Journal of Computer

Engineering (IOSR-JCE), 17(1), 62-69.

Korman, S., & Avidan, S. (2015). Coherency sensitive hashing. IEEE transactions on

pattern analysis and machine intelligence, 38(6), 1099-1112.

Kusuma, E. J., Indriani, O. R., Sari, C. A., & Rachmawanto, E. H. (2017, November). An

imperceptible LSB image hiding on edge region using DES encryption. In 2017 International

Conference on Innovative and Creative Information Technology (ICITech) (pp. 1-6). IEEE.

Kakkar, A., Singh, M. L., & Bansal, P. K. (2012). Comparison of Various Encryption

Algorithms and Techniques for Secured Data Communication. In in Multinode Network”,

International Journal of Engineering and Technology Volume.

Lakhtaria, K. I. (2011, April). Protecting computer network with encryption technique: A

Study. In International Conference on Ubiquitous Computing and Multimedia Applications (pp.

381-390). Springer, Berlin, Heidelberg.

Masadeh, S. R., Aljawarneh, S., Turab, N., & Abuerrub, A. M. (2010, August). A

comparison of data encryption algorithms with the proposed algorithm: Wireless security. In The

6th International Conference on Networked Computing and Advanced Information

Management (pp. 341-345). IEEE.

Mitali, V. K., & Sharma, A. (2014). A survey on various cryptography

techniques. International Journal of Emerging Trends & Technology in Computer Science

(IJETTCS), 3(4), 307-312.

Rewagad, P., & Pawar, Y. (2013, April). Use of digital signature with diffie hellman key

exchange and AES encryption algorithm to enhance data security in cloud computing. In 2013
International Conference on Communication Systems and Network Technologies (pp. 437-439).

IEEE.