Constructing Highly Nonlinear Cryptographic Balanced Boolean Functions on Learning Capabilities of Recurrent Neural Networks

Citations

WEB OF SCIENCE

3
Citations

SCOPUS

4

초록

This study presents a novel approach to cryptographic algorithm design that harnesses the power of recurrent neural networks. Unlike traditional mathematical-based methods, neural networks offer nonlinear models that excel at capturing chaotic behavior within systems. We employ a recurrent neural network trained on Monte Carlo estimation to predict future states and generate confusion components. The resulting highly nonlinear substitution boxes exhibit exceptional characteristics, with a maximum nonlinearity of 114 and low linear and differential probabilities. To evaluate the efficacy of our methodology, we employ a comprehensive range of traditional and advanced metrics for assessing randomness and cryptanalytics. Comparative analysis against state-of-the-art methods demonstrates that our developed nonlinear confusion component offers remarkable efficiency for block-cipher applications.

키워드

Cryptography; Recurrent neural networks; Monte Carlo methods; Estimation; Ciphers; Boolean functions; Approximation algorithms; Vectors; Training; Time series analysis; Block ciphers; confusion components; Monte Carlo estimation; recurrent neural networks; substitution boxes; IMAGE ENCRYPTION; S-BOXES; CRYPTANALYSIS; CHAOS; ALGORITHM; MODEL
제목
Constructing Highly Nonlinear Cryptographic Balanced Boolean Functions on Learning Capabilities of Recurrent Neural Networks
저자
Muhammad Waseem, Hafiz; Asfand Hafeez, Muhammad; Ahmad, Shabir; David Deebak, Bakkiam; Munir, Noor; Majeed, Abdul; Hwang, Seoung Oun
DOI
10.1109/ACCESS.2024.3477260
발행일
2024-10
유형
Article
저널명
IEEE Access
권
12
페이지
150255 ~ 150267