Results 181 to 190 of about 778,010 (200)
Some of the next articles are maybe not open access.
An upper bound on the number of functions satisfying the Strict Avalanche Criterion
Information Processing Letters, 1994The Strict Avalanche Criterion (SAC) is used for cryptographic functions to guarantee that each ciphertext bit must change with probability one half when a single input bit is changed. Evidently an \(n\)-bit function is SAC if it is \(50\%\)-dependent in all \(n\) variables.
Luke O'Connor
exaly +2 more sources
Comment on “bounds on the number of functions satisfying the strict avalanche criterion”
Information Processing Letters, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amr M. Youssef, Stafford E. Tavares
exaly +3 more sources
Research on the Balanced Boolean Functions Satisfying Strict Avalanche Criterion
2015 International Conference on Computational Science and Computational Intelligence (CSCI), 2015The balanced Boolean functions satisfying the strict avalanche criterion (SAC) are widely used in stream cipher and block cipher. By introducing the representation matrix of the transition function of Boolean function, we provide a special method for seeking the Boolean functions satisfying the SAC. Moreover, the strong strict avalanche criterion (SSAC)
Fangyue Chen
exaly +2 more sources
A new S-box construction method meeting strict avalanche criterion
Journal of Information Security and Applications, 2022Lang Li, Ying Guo, Botao Liu
exaly +3 more sources
A New Design of Substitution Box with Ideal Strict Avalanche Criterion
Malaysian Journal of Mathematical Sciences, 2022The use of S-boxes (substitution boxes) to provide nonlinear properties is known to be a common way to design a block cipher. These nonlinear properties are necessary to ensure the security of a block cipher. This manuscript proposes a design construction of a new S-box using affine transformation via cellular automata as a permutation matrix.
Mohd Esa, N. F. +2 more
openaire +1 more source
Strict avalanche criterion in Boolean functions-a spectral approach
ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196), 2002For the first time, the Strict Avalanche Criterion (SAC) in Boolean functions is identified through the Walsh spectral symmetries. In order to reduce the processing time, a filtering procedure to eliminate the Boolean functions that do not satisfy the SAC is proposed.
Bogdan J. Falkowski, Sudha Kannurao
openaire +2 more sources
2023 3rd International Conference on Technological Advancements in Computational Sciences (ICTACS), 2023
exaly +2 more sources
exaly +2 more sources
S-Boxes with Optimal Strict Avalanche Criterion using Chaotic Map
2024 9th International Conference on Integrated Circuits, Design, and Verification (ICDV)Cong-Kha Pham +2 more
exaly +2 more sources
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
openaire +2 more sources
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
openaire +2 more sources
S-box Construction of Highly Strict Avalanche Criterion Using Algebraic Technique
2018 Third International Conference on Informatics and Computing (ICIC), 2018A strong S-box construction will determine the level of data security during the data encryption and decryption processes. One of the methods for S-boxes construction is using algebraic technique. In algebraic technique, S-box construction is built based on the selected irreducible polynomial.
null Alamsyah +2 more
openaire +1 more source