2012Unpublished venueRequires access

A New Approach towards Encryption Schemes: Byte - Rotation Encryption Algorithm

Sunita Bhati, Anita Bhati, Sanjeev Kumar Sharma

Open publisher page 20 citations

Abstract

Information security is a challenging issue in today's technological world. There is a demand for a stronger encryption which is very hard to crack. Earlier many researchers have proposed various encryption algorithms such as AES, DES, Triple DES, RSA, Blowfish etc. Some of them are most popular in achieving data security at a great extent like AES and Blowfish. But, as security level is increased, the time and complexity of algorithm is also increased. This is the major cause of decreasing the speed and efficiency of the encryption system. In this paper we have proposed a new encryption algorithm Byte - Rotation Encryption Algorithm (BREA) with Parallel Encryption Model which enhances the security as well as speed of the encryption scheme. The BREA is applied on different blocks of plaintext and executes in parallel manner through multithreading concept of single processor system. This paper is an attempt to invent a new encryption model which is secure and very fast.

About this research paper

What this paper is about

Information security is a challenging issue in today's technological world. There is a demand for a stronger encryption which is very hard to crack. Earlier many researchers have proposed various encryption algorithms such as AES, DES, Triple DES, RSA, Blowfish etc. Some of them are most popular in achieving data security at a great extent like AES and Blowfish. But, as security level is increased, the time and complexity of algorithm is also increased. This is the major cause of decreasing the speed and efficiency of the encryption system. In this paper we have proposed a new encryption algorithm Byte - Rotation Encryption Algorithm (BREA) with Parallel Encryption Model which enhances the security as well as speed of the encryption scheme. The BREA is applied on different blocks of plaintext and executes in parallel manner through multithreading concept of single processor system. This paper is an attempt to invent a new encryption model which is secure and very fast.

Why it matters

OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Information security is a challenging issue in today's technological world. There is a demand for a stronger encryption which is very hard to crack. Earlier many researchers have proposed various encryption algorithms such as AES, DES, Triple DES, RSA, Blowfish etc. Some of them are most popular in achieving data security at a great extent like AES and Blowfish. But, as security level is increased, the time and complexity of algorithm is also increased. This is the major cause of decreasing the speed and efficiency of the encryption system. In this paper we have proposed a new encryption algorithm Byte - Rotation Encryption Algorithm (BREA) with Parallel Encryption Model which enhances the security as well as speed of the encryption scheme. The BREA is applied on different blocks of plaintext and executes in parallel manner through multithreading concept of single processor system. This paper is an attempt to invent a new encryption model which is secure and very fast.

Key concepts: 56-bit encryption, Encryption, 40-bit encryption, Probabilistic encryption, Computer science, Multiple encryption, On-the-fly encryption, Byte

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Approach towards Encryption Schemes: Byte - Rotation Encryption Algorithm — Research Paper | ScholarLens