A Novel Chaos-Based Cryptography Algorithm and Its Performance Analysis

El‐Latif, Ahmed A. Abd; Janarthanan, R.; Abd-El-Atty, Bassem; Khalifa, Hany S.; Nazarimehr, Fahimeh

doi:10.3390/math10142434

Cited by 24 publications

(10 citation statements)

References 60 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To quantify this, we calculated the correlation coefficient between pairs of adjacent pixels, denoted by r xy . This was done by selecting S random pairs of adjacent pixels and substituting them into Equation (13) to Equation (18):…”

Section: Correlation Analysis and Chi-square Testmentioning

confidence: 99%

See 1 more Smart Citation

Hybrid Chaotic-Based PRNG for Secure Cryptography Applications

Alnajim

Abou-Bakr

Alruwisan³

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

This paper suggests a novel one-dimensional (1D) map to address the limitations of traditional chaotic 1D maps. In contrast to traditional 1D maps, the proposed map has three control parameters a, μ, and c, allowing it to exhibit chaotic behavior over a wide range of values. The dynamic behavior of the new 1D map was analyzed using well-known numerical methods, including the bifurcation diagram and Lyapunov exponent. Both tests showed their complex and diverse behavior. In addition, a novel image encryption scheme was devised using the new function as its pseudorandom number generator. Rigorous statistical testing was applied to the proposed encryption algorithm. The mean square error (MSE) and peak signal-to-noise ratio (PSNR) results, in addition to subjecting 28 images to number of pixels change rate (NPCR) and unified average changing intensity (UACI) tests demonstrated the robustness of the system. The results of this study demonstrate the effectiveness of the new 1D map for use in secure image cryptography applications, providing a more robust and secure alternative to traditional chaotic 1D maps.

show abstract

Section: Correlation Analysis and Chi-square Testmentioning

confidence: 99%

“…Despite the importance of the strength of the key, other critically essential factors should be taken into account, including a novel chaotic oscillator for the overall performance of a novel encryption system [13] covering potential perspectives of the proposed PRNG. The results are produced in the form of the cipher versions of images.…”

Section: Introductionmentioning

confidence: 99%

Hybrid Chaotic-Based PRNG for Secure Cryptography Applications

Alnajim

Abou-Bakr

Alruwisan³

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…Despite the importance of the strength of the key, other critically essential factors should be taken into account, including novel chaotic oscillator for the overall performance of an a novel design encryption system [13] covering potential perspectives of the proposed PRNG. The results are produced in the form of the cipher versions of images.…”

Section: Of 16mentioning

confidence: 99%

“…To quantify this, we calculate the correlation coefficient between pairs of adjacent pixels, denoted by r xy . This is done by selecting S random pairs of adjacent pixels and substituting them into the Equation (13) to Equation (18):…”

Section: Correlation Analysismentioning

confidence: 99%

Hybrid Chaotic Based PRNG for Secure Cryptography Applications

Alnajim¹,

Abou-Bakr²,

Alruwisan³

et al. 2023

Preprint

View full text Add to dashboard Cite

This paper suggests a novel one-dimensional (1D) map to address the limitations of traditional chaotic 1D maps. The main challenge with traditional chaotic 1D maps is the limited control parameter range and the potential risk of collapsing as a result under the finite precision implementation. To overcome these limitations, the new 1D map hybridises the traditional logistic map with tent map, and a linear tent-like function. This hybridization results in a wider range of control parameters to produce chaotic behavior. The dynamic behavior of the new 1D map has been analyzed using well known numerical methods, including the bifurcation diagram and Lyapunov exponent. Both tests have shown their complex and diverse behavior. In addition, a novel image encryption scheme has been devised using the new function as its pseudo-random-number generator. The proposed encryption algorithm has been tested and found to be robust and secure, passing all statistical tests applied to the encrypted images. The results of this study demonstrate the effectiveness of the new 1D map for use in secure image cryptography applications, providing a more robust and secure alternative to traditional chaotic 1D maps. The proposed algorithm has demonstrated high performance in NPCR and UACI tests. It also has shown good results in the MSE and PSNR tests.

show abstract

“…Hua et al [18] presented a robust S-box construction method based on the combination of complete Latin squares and chaotic sequences. The authors of [19] applied chaotic dynamical oscillators to produce pseudo-random integer patterns, which were then used to develop the suggested S-boxes. In [20], a new secure S-box was created based on the cuckoo search algorithm and discrete chaotic functions.…”

mentioning

confidence: 99%

Enhancing the Robustness of Block Ciphers through a Graphical S-Box Evolution Scheme for Secure Multimedia Applications

Razaq

Ahsan

Alolaiyan

et al. 2023

Preprint

View full text Add to dashboard Cite

Block ciphers, which serve as primary components of network security systems, play a crucial role in securely exchanging and communicating confidential information. Substitution boxes (S-boxes) are the most significant components of contemporary block ciphers. Inherently, the security strength of such cryptosystems relies on the quality of the S-box employed. The cryptographically strong S-boxes provide robustness and assurance of the security competency to block ciphers. To generate the strong S-boxes, a number of chaos-based methods have been investigated in the past decade. However, chaos-based methods are random approaches which are computationally intensive and don’t guarantee the generation of strong S-boxes. To meet the challenges of strong and fast S-box generation, a novel coset graphs based algebraic method is proposed to evolve robust and efficient S-box. Firstly, an initial S-box of decent cryptographic strength is generated by using the vertices of coset graphs for two Galois fields and a bijective function. After that, the initial S-box's robustness is improved by rearranging its columns in a particular manner, which yields the strong proposed S-box. The effectiveness of the proposed method is validated by comparing various attributes of our S-box against some recently investigated S-boxes. Additionally, the generated S-box is applied for image encryption and analyzed using the MLC criterions. The results show the suitability of the proposed S-box for secure multimedia applications.

show abstract

A Novel Chaos-Based Cryptography Algorithm and Its Performance Analysis

Cited by 24 publications

References 60 publications

Hybrid Chaotic-Based PRNG for Secure Cryptography Applications

Hybrid Chaotic-Based PRNG for Secure Cryptography Applications

Hybrid Chaotic Based PRNG for Secure Cryptography Applications

Enhancing the Robustness of Block Ciphers through a Graphical S-Box Evolution Scheme for Secure Multimedia Applications

Contact Info

Product

Resources

About