scispace - formally typeset
Journal ArticleDOI

A Chaos-Based Substitution Box (S-Box) Design with Improved Differential Approximation Probability (DP)

Reads0
Chats0
TLDR
The proposed cryptographically strong S-box shows very low differential approximation probability as compared to other chaos-based S-boxes designed recently, while maintaining good cryptographic properties and high value of linear approximation probability.
Abstract
Substitution box is a vital and the only nonlinear component of modern encryption algorithm. S-box is introduced as a confusion component to resist against differential cryptanalysis. Chaos-based encryption is well liked because it exhibits similarity like cryptography. However, chaotic S-boxes possess high maximum differential approximation probability, measured using difference distribution table (DDT) for differential cryptanalysis. Therefore, this paper reports a systematic design methodology to generate chaotic S-box utilizing DDT and that can be used in multimedia encryption algorithms. DDT within the design loop is used to optimize differential approximation probability. The proposed S-box shows very low differential approximation probability as compared to other chaos-based S-box designed recently, while maintaining good cryptographic properties and high value of linear approximation probability. The strength of the proposed cryptographically strong S-box is vetted in the practical implementation of multimedia encryption.

read more

Citations
More filters
Journal ArticleDOI

Cryptanalysis and constructing S-Box based on chaotic map and backtracking

TL;DR: This work designed an improved coupling quadratic map (ICQM), which is surjective and has good ergodicity and randomness, and reconstructed a keyed strong S-Box scheme without weakness based on ICQM and backtracking, which indicated the effectiveness of the proposed S- box construction scheme.
Journal ArticleDOI

Generation of Highly Nonlinear and Dynamic AES Substitution-Boxes (S-Boxes) Using Chaos-Based Rotational Matrices

TL;DR: The results show that methodology adapted to design proposed key-based dynamic S-boxes entails near-optimal cryptographic properties so that proposed S- boxes are as stronger as AES S-box.
Journal ArticleDOI

Side-Channel Analysis of Chaos-Based Substitution Box Structures

TL;DR: The results show that implementation analysis studies are required in the chaos-based cryptology literature, and showed that chaos- based s-box structures are more resistant against side-channel attacks.
Journal ArticleDOI

An Analysis and Generation Toolbox for Chaotic Substitution Boxes: A Case Study Based on Chaotic Labyrinth Rene Thomas System

TL;DR: This toolbox has shown that the performance measures of the seven previous proposals in the literature are incorrectly calculated and is one of the first steps in addressing the analysis problems of the chaos-based cryptology literature.
Journal ArticleDOI

Constructing Keyed Strong S-Box Using an Enhanced Quadratic Map

TL;DR: In this article, it was shown that an S-box may be vulnerable to fixed point, reverse fixed point or short iteration attacks due to the existence of fixed point and reverse fixed points.
References
More filters
Journal ArticleDOI

Communication theory of secrecy systems

TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
Book ChapterDOI

Linear cryptanalysis method for DES cipher

TL;DR: A new method is introduced for cryptanalysis of DES cipher, which is essentially a known-plaintext attack, that is applicable to an only-ciphertext attack in certain situations.
MonographDOI

Chaos and Nonlinear Dynamics

Journal ArticleDOI

Chaos-based cryptography: a brief overview

TL;DR: In this paper, chaos-based cryptography is discussed from a point of view which the author believes is closer to the spirit of both cryptography and chaos theory than the way the subject has been treated recently by many researchers.
Book ChapterDOI

Differential Cryptanalysis of the Full 16-Round DES

TL;DR: The first known attack is developed which is capable of breaking the full 16 round DES in less than the 255 complexity of exhaustive search and can be carried out in parallel on up to 233 disconnected processors with linear speedup.
Related Papers (5)