A large family of Boolean functions
Acta Arithmetica, Tome 172 (2016) no. 3, pp. 251-262
Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences
In a series of papers many Boolean functions with good cryptographic properties were constructed using number-theoretic methods. We construct a large family of Boolean functions by using polynomials over finite fields, and study their cryptographic properties: maximum Fourier coefficient, nonlinearity, average sensitivity, sparsity, collision and avalanche effect.
Keywords:
series papers many boolean functions cryptographic properties constructed using number theoretic methods construct large family boolean functions using polynomials finite fields study their cryptographic properties maximum fourier coefficient nonlinearity average sensitivity sparsity collision avalanche effect
Affiliations des auteurs :
Huaning Liu 1 ; Min Zhang 1
@article{10_4064_aa8107_1_2016,
author = {Huaning Liu and Min Zhang},
title = {A large family of {Boolean} functions},
journal = {Acta Arithmetica},
pages = {251--262},
publisher = {mathdoc},
volume = {172},
number = {3},
year = {2016},
doi = {10.4064/aa8107-1-2016},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/aa8107-1-2016/}
}
Huaning Liu; Min Zhang. A large family of Boolean functions. Acta Arithmetica, Tome 172 (2016) no. 3, pp. 251-262. doi: 10.4064/aa8107-1-2016
Cité par Sources :