Some Binomial and Trinomial Differentially 4-Uniform Permutation Polynomials

2015 ◽  
Vol 26 (04) ◽  
pp. 487-497 ◽  
Author(s):  
Xishun Zhu ◽  
Xiangyong Zeng ◽  
Yuan Chen
Keyword(s):  
Finite Field ◽  
Block Ciphers ◽  
Permutation Polynomials ◽  
Differential Uniformity ◽  
Substitution Boxes

Permutation polynomials with low differential uniformity are important candidate functions to design substitution boxes of block ciphers. In this paper, we investigate several classes of differential 4-uniform binomial and trinomial permutation polynomials over the finite field [Formula: see text] of [Formula: see text] elements.

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 Differentially 4-Uniform Permutations with the Best Known Nonlinearity from Butterflies

2017 ◽  
pp. 228-249 ◽  
Author(s):  
Shihui Fu ◽  
Xiutao Feng ◽  
Baofeng Wu
Keyword(s):  
Finite Field ◽  
Open Problem ◽  
Block Ciphers ◽  
Algebraic Degree ◽  
Differential Uniformity ◽  
Almost Perfect Nonlinear ◽  
High Nonlinearity ◽  
Very High ◽  
Lack Of Knowledge

Many block ciphers use permutations defined over the finite field F22k with low differential uniformity, high nonlinearity, and high algebraic degree to provide confusion. Due to the lack of knowledge about the existence of almost perfect nonlinear (APN) permutations over F22k, which have lowest possible differential uniformity, when k > 3, constructions of differentially 4-uniform permutations are usually considered. However, it is also very difficult to construct such permutations together with high nonlinearity; there are very few known families of such functions, which can have the best known nonlinearity and a high algebraic degree. At Crypto’16, Perrin et al. introduced a structure named butterfly, which leads to permutations over F22k with differential uniformity at most 4 and very high algebraic degree when k is odd. It is posed as an open problem in Perrin et al.’s paper and solved by Canteaut et al. that the nonlinearity is equal to 22k−1−2k. In this paper, we extend Perrin et al.’s work and study the functions constructed from butterflies with exponent e = 2i + 1. It turns out that these functions over F22k with odd k have differential uniformity at most 4 and algebraic degree k +1. Moreover, we prove that for any integer i and odd k such that gcd(i, k) = 1, the nonlinearity equality holds, which also gives another solution to the open problem proposed by Perrin et al. This greatly expands the list of differentially 4-uniform permutations with good nonlinearity and hence provides more candidates for the design of block ciphers.

Several classes of permutation trinomials from Niho exponents over finite fields of characteristic 3

2019 ◽  
Vol 18 (04) ◽  
pp. 1950069
Author(s):  
Qian Liu ◽  
Yujuan Sun
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Coding Theory ◽  
Permutation Polynomials ◽  
Combinatorial Designs ◽  
Dickson Polynomial ◽  
Niho Exponents ◽  
Characteristic 3 ◽  
Permutation Trinomials ◽  
Algebraic Forms

Permutation polynomials have important applications in cryptography, coding theory, combinatorial designs, and other areas of mathematics and engineering. Finding new classes of permutation polynomials is therefore an interesting subject of study. Permutation trinomials attract people’s interest due to their simple algebraic forms and additional extraordinary properties. In this paper, based on a seventh-degree and a fifth-degree Dickson polynomial over the finite field [Formula: see text], two conjectures on permutation trinomials over [Formula: see text] presented recently by Li–Qu–Li–Fu are partially settled, where [Formula: see text] is a positive integer.

scholarly journals On the number of permutation polynomials over a finite field

2016 ◽  
Vol 12 (06) ◽  
pp. 1519-1528
Author(s):  
Kwang Yon Kim ◽  
Ryul Kim ◽  
Jin Song Kim
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Roots Of Unity ◽  
Permutation Polynomials

In order to extend the results of [Formula: see text] in [P. Das, The number of permutation polynomials of a given degree over a finite field, Finite Fields Appl. 8(4) (2002) 478–490], where [Formula: see text] is a prime, to arbitrary finite fields [Formula: see text], we find a formula for the number of permutation polynomials of degree [Formula: see text] over a finite field [Formula: see text], which has [Formula: see text] elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree [Formula: see text] over a finite field [Formula: see text], using the permanent of a matrix whose entries are [Formula: see text]th roots of unity and using this we obtain a nontrivial bound for the number. Finally, we provide a formula for the number of permutation polynomials of degree [Formula: see text] less than [Formula: see text].

scholarly journals Evolving Dynamic S-Boxes Using Fractional-Order Hopfield Neural Network Based Scheme

Entropy ◽  
2020 ◽  
Vol 22 (7) ◽  
pp. 717 ◽  
Author(s):  
Musheer Ahmad ◽  
Eesa Al-Solami
Keyword(s):  
Neural Network ◽  
Fractional Order ◽  
Hopfield Neural Network ◽  
Performance Assessments ◽  
Comparison Analysis ◽  
Differential Uniformity ◽  
High Nonlinearity ◽  
Substitution Boxes ◽  
Strict Avalanche Criterion ◽  
Independence Criterion

Static substitution-boxes in fixed structured block ciphers may make the system vulnerable to cryptanalysis. However, key-dependent dynamic substitution-boxes (S-boxes) assume to improve the security and robustness of the whole cryptosystem. This paper proposes to present the construction of key-dependent dynamic S-boxes having high nonlinearity. The proposed scheme involves the evolution of initially generated S-box for improved nonlinearity based on the fractional-order time-delayed Hopfield neural network. The cryptographic performance of the evolved S-box is assessed by using standard security parameters, including nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, etc. The proposed scheme is able to evolve an S-box having mean nonlinearity of 111.25, strict avalanche criteria value of 0.5007, and differential uniformity of 10. The performance assessments demonstrate that the proposed scheme and S-box have excellent features, and are thus capable of offering high nonlinearity in the cryptosystem. The comparison analysis further confirms the improved security features of anticipated scheme and S-box, as compared to many existing chaos-based and other S-boxes.

More permutation polynomials with differential uniformity six

2017 ◽  
Vol 61 (3) ◽  
Author(s):  
Ziran Tu ◽  
Xiangyong Zeng ◽  
Zhiyong Zhang
Keyword(s):  
Permutation Polynomials ◽  
Differential Uniformity

Further results on permutation polynomials of the form (xpm − x + δ)s + L(x) over 𝔽p2m

2016 ◽  
Vol 15 (05) ◽  
pp. 1650098 ◽  
Author(s):  
Guangkui Xu ◽  
Xiwang Cao ◽  
Shanding Xu
Keyword(s):  
Finite Field ◽  
Permutation Polynomials ◽  
Linearized Polynomial

Several classes of permutation polynomials with given form over [Formula: see text] were recently proposed by Tu, Zeng, Li and Helleseth. In this paper, continuing their work, we present more permutation polynomials of the form [Formula: see text] over the finite field [Formula: see text] where [Formula: see text] is a linearized polynomial with coefficients in [Formula: see text].

scholarly journals The factorable core of polynomials over finite fields

1990 ◽  
Vol 49 (2) ◽  
pp. 309-318 ◽  
Author(s):  
S. D. Cohen
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Algebraic Closure ◽  
Permutation Polynomials ◽  
Linearized Polynomial ◽  
Polynomials Over Finite Fields ◽  
Value Sets

AbstractFor a polynomial f(x) over a finite field Fq, denote the polynomial f(y)−f(x) by ϕf(x, y). The polynomial ϕf has frequently been used in questions on the values of f. The existence is proved here of a polynomial F over Fq of the form F = Lr, where L is an affine linearized polynomial over Fq, such that f = g(F) for some polynomial g and the part of ϕf which splits completely into linear factors over the algebraic closure of Fq is exactly φF. This illuminates an aspect of work of D. R. Hayes and Daqing Wan on the existence of permutation polynomials of even degree. Related results on value sets, including the exhibition of a class of permutation polynomials, are also mentioned.

Sign in / Sign up

Export Citation Format

Share Document