Differential uniformity and linearity of S-boxes by multiplicative complexity

2022 ◽  
Author(s):  
Yongjin Jeon ◽  
Seungjun Baek ◽  
Hangi Kim ◽  
Giyoon Kim ◽  
Jongsung Kim
Keyword(s):  
Differential Uniformity ◽  
Multiplicative Complexity

scholarly journals The multiplicative complexity of the Discrete Fourier Transform

1984 ◽  
Vol 5 (1) ◽  
pp. 87-109 ◽  
Author(s):  
L Auslander ◽  
E Feig ◽  
S Winograd
Keyword(s):  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Multiplicative Complexity

scholarly journals The Role of Multiplicative Complexity in Compiling Low $T$-count Oracle Circuits

2019 ◽  
Author(s):  
Giulia Meuli ◽  
Mathias Soeken ◽  
Earl Campbell ◽  
Martin Roetteler ◽  
Giovanni de Micheli
Keyword(s):  
Multiplicative Complexity

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 The multiplicative complexity of 6-variable Boolean functions

2018 ◽  
Vol 11 (1) ◽  
pp. 93-107 ◽  
Author(s):  
Çağdaş Çalık ◽  
Meltem Sönmez Turan ◽  
René Peralta
Keyword(s):  
Boolean Functions ◽  
Multiplicative Complexity
Sign in / Sign up

Export Citation Format

Share Document