Related Experiment Video
Updated: Aug 24, 2025

07:56
Formation of Biomembrane Microarrays with a Squeegee-based Assembly Method
Published on: May 8, 2014
13.8K
A strong construction of S-box using Mandelbrot set an image encryption scheme
Mazzamal Aslam1, Saira Beg1, Adeel Anjum2
1Computer Science, COMSATS Institute of Information Technology, Islamabad, Pakistan.
Peerj. Computer Science
|October 20, 2022
Summary
This study introduces a novel Mandelbrot set substitution box (S-box) using complex numbers and the Chen chaotic map for enhanced digital encryption. The proposed S-box construction improves confusion and diffusion, offering greater resistance to cryptanalysis than existing methods.
Area of Science:
- Cryptography
- Applied Mathematics
- Computer Science
Background:
- Substitution boxes (S-boxes) are crucial for confusion in digital encryption.
- Fractal chaotic mechanisms enhance S-boxes but face cryptanalysis weaknesses.
- Achieving high nonlinearity and low correlation in S-boxes remains a challenge.
Purpose of the Study:
- To propose a new S-box construction using the Mandelbrot set and complex numbers.
- To enhance the robustness of encryption schemes against cryptanalytic attacks.
- To improve confusion and diffusion through chaotic map integration.
Main Methods:
- A complex number-based S-box construction utilizing the Mandelbrot set.
- Integration of the Chen chaotic map for diffusion in a substitution permutation network (SPN).
- Analysis of S-box properties including nonlinearity, Strict Avalanche Criterion, and Bit Independent Criterion.
Main Results:
- The proposed Mandelbrot set S-box exhibits high nonlinearity and low correlation.
- The system demonstrated strong resistance against differential and linear cryptanalysis.
- Image encryption tests confirmed the S-box's effectiveness and security.
Conclusions:
- The proposed complex number-based S-box with Chen chaotic map offers superior security standards.
- This novel approach enhances randomness and robustness against various attacks.
- The method provides a promising direction for secure digital encryption systems.
Related Concept Videos
Convolution: Math, Graphics, and Discrete Signals
347
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
347
Norton's Theorem
733
Norton's theorem is a fundamental principle stating that a linear two-terminal circuit can be substituted with an equivalent circuit, which comprises a current source (ⅠN) in parallel with a resistor (RN). Here, ⅠN represents the short-circuit current flowing through the terminals, and RN stands for the input or equivalent resistance at the terminals when all independent sources are deactivated. This implies that the circuit illustrated in Figure (a) can be exchanged with the...
733
Hückel's Rule Diagram of π MOs: Frost Circle
4.6K
The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...
4.6K
Convolution Properties I
218
Convolution computations can be simplified by utilizing their inherent properties.
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
218

