Abstract

The paper describes a symmetric encryption algorithm based on bit permutations and using an iterative process combined with a chaotic function. The main advantages of such a cryptosystem is its ability to encrypt securely bit sequences and assuring confusion, diffusion and indistinguishability properties in the cipher. The algorithm is applied on the image encryption where the plain-image is viewed as binary sequence. The results of statistical analysis about randomness, sensitivity and correlation on the cipher-images show the relevance of the proposed cryptosystem.

Highlights

  • The use of the internet and network applications becomes indispensable in the modern society and the necessity to protect and secure such applications from prying eyes is essential

  • The paper describes a symmetric encryption algorithm based on bit permutations and using an iterative process combined with a chaotic function

  • The cryptosystem is applied on the image encryption where the original image is treated as a sequence of bits

Read more

Summary

Introduction

The use of the internet and network applications becomes indispensable in the modern society and the necessity to protect and secure such applications from prying eyes is essential. BLOWFISH has a 64-bits block size and a key length from 32 bits to 448 bits. IDEA operates with 64bits block size and is controlled by a 128-bits key while AES uses various keys of 128, 192 and 256 bits. These algorithms do not always keep the same efficiency (quality of the cipher, execution time, etc.) depending on the structure of the input data (texts, images). The algorithm directly works on the entire input block of bits and uses an iterative process of substitution-permutation combined with a chaotic function. The plaintext and ciphertext are bit sequences of various length Such an algorithm encrypts any kind of binary sequence and produces highly secure ciphers.

The Proposed Encryption Method
The Used Chaotic Function
Description of the Algorithm
Determination of the Round Number R
16: Q3 Q1 Q2 mod 2
Key Space
Results and Security
The Used Images for Analysis
Key Sensitivity Analysis
Plain-Image Sensitivity Analysis
Efficiency Analysis
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call