scholarly journals Relating Undisturbed Bits to Other Properties of Substitution Boxes

2015 ◽  
pp. 109-125 ◽  
Author(s):  
Rusydi H. Makarim ◽  
Cihangir Tezcan
Keyword(s):  
Substitution Boxes

Design and Analysis of Substitution Boxes in GOST Lightweight Security Algorithm

2019 ◽  
Vol 28 (1) ◽  
pp. 361-368
Author(s):  
Bassam Abshosha ◽  
Mohamed Dessouky ◽  
Rabie Ramdan ◽  
Ayman EL-SAYED
Keyword(s):  
Substitution Boxes ◽  
Security Algorithm

Optimum criterion for lightweight nonlinear confusion component with multi-criteria decision making

2021 ◽  
pp. 1-12
Author(s):  
Nabilah Abughazalah ◽  
Majid Khan ◽  
Noor Munir ◽  
Amna Zafar
Keyword(s):  
Decision Making ◽  
Multi Criteria Decision Making ◽  
Ideal Solution ◽  
Mathematical Structures ◽  
Substitution Boxes

In this article, we have designed a new scheme for the construction of the nonlinear confusion component. Our mechanism uses the notion of a semigroup, Inverse LA-semigroup, and various other loops. With the help of these mathematical structures, we can easily build our confusion component namely substitution boxes (S-boxes) without having specialized structures. We authenticate our proposed methodology by incorporating the available cryptographic benchmarks. Moreover, we have utilized the technique for order of preference by similarity to ideal solution (TOPSIS) to select the best nonlinear confusion component. With the aid of this multi-criteria decision-making (MCDM), one can easily select the best possible confusion component while selecting among various available nonlinear confusion components.

Design of Highly Nonlinear Substitution Boxes Based on I-Ching Operators

2018 ◽  
Vol 48 (12) ◽  
pp. 3349-3358 ◽  
Author(s):  
Tong Zhang ◽  
C. L. Philip Chen ◽  
Long Chen ◽  
Xiangmin Xu ◽  
Bin Hu
Keyword(s):  
I Ching ◽  
Substitution Boxes ◽  
Highly Nonlinear

scholarly journals More Low Differential Uniformity Permutations over F22k with k Odd

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Yue Leng ◽  
Jinyang Chen ◽  
Tao Xie
Keyword(s):  
Block Ciphers ◽  
Algebraic Degree ◽  
Differential Uniformity ◽  
Numerical Examples ◽  
High Nonlinearity ◽  
Substitution Boxes ◽  
Theoretical Results

Permutations with low differential uniformity, high algebraic degree, and high nonlinearity over F22k can be used as the substitution boxes for many block ciphers. In this paper, several classes of low differential uniformity permutations are constructed based on the method of choosing two permutations over F22k to get the desired permutations. The resulted low differential uniformity permutations have high algebraic degrees and nonlinearities simultaneously, which provide more choices for the substitution boxes. Moreover, some numerical examples are provided to show the efficacy of the theoretical results.

scholarly journals Particle Swarm Optimization Based Highly Nonlinear Substitution-Boxes Generation for Security Applications

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 116132-116147 ◽  
Author(s):  
Musheer Ahmad ◽  
Ishfaq Ahmad Khaja ◽  
Abdullah Baz ◽  
Hosam Alhakami ◽  
Wajdi Alhakami
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Security Applications ◽  
Substitution Boxes ◽  
Highly Nonlinear

scholarly journals Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Amer Awad Alzaidi ◽  
Musheer Ahmad ◽  
Hussam S. Ahmed ◽  
Eesa Al Solami
Keyword(s):  
Fitness Function ◽  
Chaotic Map ◽  
Search Space ◽  
Initial Population ◽  
Substitution Boxes ◽  
Novel Method ◽  
Sine Cosine Algorithm ◽  
And Performance ◽  
Optimization Mechanism ◽  
Independence Criterion

This paper proposes a novel method of constructing strong substitution-boxes (S-boxes) of order n (4 ≤ n ≤ 8) based on a recent optimization algorithm known as sine-cosine algorithm (SCA). The paper also proposes a new 1D chaotic map, which owns enhanced dynamics compared to conventional chaotic map, for generating initial population of S-boxes and facilitating the optimization mechanism of SCA. The proposed method applies the SCA with enhanced chaotic map to explore and exploit the search space for obtaining optimized S-boxes on the basis of maximization of nonlinearity as fitness function. The S-box construction involves three phases such as initialization of population, optimization, and adjustment. The simulation and performance analyses are done using standard measures of nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, and autocorrelation function. The obtained experimental results are compared with some immediate optimization-based and other S-boxes to show the strength of proposed method for constructing bijective S-boxes of salient cryptographic features.

A Method of Generating 8 × 8 Substitution Boxes Based on Elliptic Curves

2018 ◽  
Vol 101 (1) ◽  
pp. 439-451 ◽  
Author(s):  
Umar Hayat ◽  
Naveed Ahmed Azam ◽  
Muhammad Asif
Keyword(s):  
Elliptic Curves ◽  
Substitution Boxes
Sign in / Sign up

Export Citation Format

Share Document