搜索结果: 1-6 共查到“军事学 Permutation Polynomials”相关记录6条 . 查询时间(0.046 秒)
On the Boomerang Uniformity of some Permutation Polynomials
Vectorial Boolean functions Boomerang uniformity Boomerang connectivity table
2019/8/2
The boomerang attack, introduced by Wagner in 1999, is a cryptanalysis technique against block ciphers based on differential cryptanalysis. In particular it takes into consideration two differentials,...
On cryptographic parameters of permutation polynomials of the form xrh(x(q−1)/d)
Permutation Polynomials Differential Uniformity Boomerang Uniformity
2019/7/8
The differential uniformity, the boomerang uniformity, and the extended Walsh spectrum etc are important parameters to evaluate the security of S(substitution)-box. In this paper, we introduce efficie...
New Results about the Boomerang Uniformity of Permutation Polynomials
Finite Field Boomerang Connectivity Table Boomerang Uniformity
2019/1/29
In EUROCRYPT 2018, Cid et al. introduced a new concept on the cryptographic property of S-boxes: Boomerang Connectivity Table (BCT for short) for evaluating the subtleties of boomerang-style attacks. ...
Permutation Polynomials and Their Differential Properties over Residue Class Rings
residue class ring Almost Perfect Nonlinear (APN)
2014/3/13
This paper mainly focuses on permutation polynomials over the residue class ring $\mathbb{Z}_{N}$, where $N>3$ is composite. We have proved that for the polynomial $f(x)=a_{1}x^{1}+\cdots +a_{k}x^{k}$...
On permutation polynomials EA-equivalent to the inverse function over GF(2^n)
Inverse function EA-equivalence Permutation polynomial S-box Kloosterman sums
2010/11/16
It is proved that there does not exist a linearized polynomial L(x) 2 F2n[x] such that x−1+L(x) is a permutation on F2n when n≥ 5, which is proposed as a conjecture in [15]. As a consequence, a ...
Permutation Polynomials modulo pn
Permutation polynomials Finite rings Combinatorial problem
2009/8/18
A polynomial f over a finite ring R is called a permutation polynomial if the mapping
R ! R defined by f is one-to-one. In this paper we consider the problem of characterizing
permutation polynomial...