Results 11 to 20 of about 812,055 (158)
A quantum algorithm to estimate the closeness to the Strict Avalanche criterion in Boolean functions [PDF]
CoRR, 2022 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
openaire +3 more sources
New Analysis Methods On Strict Avalanche Criterion Of S-Boxes
, 2008 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
MODIFICATION ADVANCED ENCRYPTION STANDARD (AES) ALGORITHM WITH PERFECT STRICT AVALANCHE CRITERION S-BOX [PDF]
Jurnal Teknik Informatika (Jutif), 2022 The Advanced Encryption Standard or better known as the AES Algorithm is a standard algorithm and has been widely used as an application of cryptography. Currently, a lot of research is developing about attacks on the AES algorithm. Therefore, there have been many studies related to modifications to the AES algorithm with the aim of increasing the ...
Novita Angraini, Yohan Suryanto
openaire +2 more sources
Analysis of the Strict Avalanche Criterion in Variants of Arbiter-Based Physically Unclonable Functions [PDF]
, 2019 Arbiter-based Physically Unclonable Functions (Arbiter PUF) were introduced to generate cryptographically secure secret keys during runtime, rather than storing it in Non-Volatile Memory (NVM) which are vulnerable to physical attacks. However, its construction was a target to several statistical and modeling attacks.
Akhilesh Anilkumar Siddhanti +5 more
core +4 more sources
Construction of Highly Nonlinear Resilient Boolean Functions Satisfying Strict Avalanche Criterion. [PDF]
IACR Cryptol. ePrint Arch., 2010 A method is proposed to construct resilient Boolean functions on $n$ variables ($n$ even) satisfying strict avalanche criterion (SAC) with nonlinearity $>2^{n-1}-2^{n/2}$.
WeiGuo Zhang 0001, GuoZhen Xiao
core +3 more sources
ComputationThis study describes the implementation of two algorithms in a parallel environment. These algorithms correspond to two statistical tests based on the bit’s independence criterion and the strict avalanche criterion. They are utilized to measure avalanche
Evaristo José Madarro-Capó +3 more
doaj +2 more sources
Extended SAC: A review and new algorithms of differential cryptanalysis of 4-bit s-boxes and strict avalanche criterion of BFs and 4-bit s-boxes again with a new extension to HO-SAC criterion [PDF]
, 2017 Bitwise-Xor of two 4 bit binary numbers or 4-bit bit patterns entitled 4-bit differences carries information in Cryptography. The Method to Analyze Cryptographic cipher algorithms or 4-bit substitution boxes with 4-bit differences is known as Differential Cryptanalysis.
Dey, Sankhanil, Ghosh, Ranjan
openaire +3 more sources
, 1993 Nonlinearity, 0–1 balancedness and strict avalanche criterion (SAC) are important criteria for cryptographic functions. Bent functions have maximum nonlinearity and satisfy SAC however they are not 0–1 balanced and hence cannot be directly used in many cryptosystems where 0–1 balancedness is needed.
Jennifer Seberry, Xian-Mo Zhang
openaire +2 more sources
An extension of the avalanche criterion in the context of c-differentials [PDF]
, 2021 The Strict Avalanche Criterion (SAC) is a property of vectorial Boolean functions that is used in the construction of strong S-boxes. We show in this paper how to generalize the concept of SAC to address possible c-differential attacks, in the realm of ...
Riera, Constanza +3 more
core +1 more source
Mathematics, 2022 The main component of a cryptographic system that allows us to ensure its strength against attacks, is the substitution box. The strength of this component can be validated by various metrics, one of them being the nonlinearity.
Francisco Gonzalez +2 more
doaj +1 more source