A Novel Construction of Perfect Strict Avalanche Criterion S-box using Simple Irreducible Polynomials [PDF]
An irreducible polynomial is one of the main components in building an S-box with an algebraic technique approach. The selection of the precise irreducible polynomial will determine the quality of the S-box produced. One method for determining good S-box
Alamsyah Alamsyah
doaj +2 more sources
The strict avalanche criterion randomness test
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arturo Ribagorda +2 more
exaly +4 more sources
A Novel Hybrid Chaotic Map and Cryptographic Hash Whitening for Optimized S-Box Design: Construction, Cryptanalysis, and Lightweight IoT Sensor Evaluation [PDF]
In this work, a novel method was introduced for the construction of the S-box based on delayed nonlinear chaotic systems coupled with a hybrid hash whitening mechanism.
Nahar F. Alshammari +5 more
doaj +2 more sources
New Analysis Methods On Strict Avalanche Criterion Of S-Boxes
S-boxes (Substitution boxes) are keystones of modern symmetric cryptosystems (block ciphers, as well as stream ciphers). S-boxes bring nonlinearity to cryptosystems and strengthen their cryptographic security. They are used for confusion in data security An S-box satisfies the strict avalanche criterion (SAC), if and only if for any single input bit of
Phyu Phyu Mar, Khin Maung Latt
openaire +3 more sources
Construction of highly nonlinear resilient Boolean functions satisfying strict avalanche criterion [PDF]
Boolean functions with high nonlinearity, high resiliency and strict avalanche criterion (SAC) play an important role in the designs of conventional cryptographic systems. In this paper, a method is proposed to construct resilient Boolean functions on n variables (n even) satisfying SAC with nonlinearity > 2n−1 − 2n/2.
Weiguo Zhang, Deng Tang
exaly +2 more sources
A quantum algorithm to estimate the closeness to the Strict Avalanche criterion in Boolean functions [PDF]
We propose a quantum algorithm (in the form of a quantum oracle) that estimates the closeness of a given Boolean function to one that satisfies the ``strict avalanche criterion'' (SAC). This algorithm requires $n$ queries of the Boolean function oracle, where $n$ is the number of input variables, this is fewer than the queries required by the classical
C. A. Jothishwaran +4 more
core +4 more sources
Relaxation of Strict Avalanche Criterion on All SHA-256 Sub-Function Combinations
A cryptographic hash function should dissipate patterns, such that highly related inputs are transformed into unrelated outputs. This property, known as diffusion, has been effectively measured on SHA-256 via the Strict Avalanche Criterion (SAC ...
Riley Vaughn, Mike Borowczak
doaj +2 more sources
Generalized triangle group based S-box construction for secure image encryption [PDF]
Cyber image security is an important issue in current communication networks, as secret images are often communicated through insecure channels. Most existing image encryption algorithms based on conventional S-box designs and chaotic maps are mostly ...
Aqsa Zafar Abbasi +5 more
doaj +2 more sources
From Schreier graphs to secure s-boxes using a group-theoretic design framework [PDF]
Secure substitution boxes (S-boxes) are a fundamental design element of modern symmetric cryptography because they provide the necessary nonlinearity to achieve confusion.
Abdul Razaq +4 more
doaj +2 more sources
A lower bound on the number of functions satisfying the strict avalanche criterion [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Biss, Daniel K.
openaire +3 more sources

