%0 Journal Article
%T Generating dynamical S-boxes using 1D Chebyshev chaotic maps
%J Journal of Computing and Security
%I University of Isfahan & Iranian Society of Cryptology
%Z 2322-4460
%A Shakiba, Ali
%D 2020
%\ 01/01/2020
%V 7
%N 1
%P 1-17
%! Generating dynamical S-boxes using 1D Chebyshev chaotic maps
%K (Substitution box) S-box
%K Chaos
%K Chebyshev
%R 10.22108/jcs.2020.116547.1023
%X This paper considers the construction of chaotic dynamic substitution boxes (S-boxes) using chaotic Chebyshev polynomials of the first kind. The proposed algorithm provides dynamic S-boxes with acceptable security performance compared to twenty-one recent schemes. This algorithm is used to generate 80 random 8 × 8 S-boxes and analyzed their security performance. Their average performance shows acceptable security. The security of the generated S-boxes is measured against several mandatory security requirements for S-box designs including bijective property, strict avalanche criterion (SAC), linear approximation probability (LAP), differential approximation probability, bit independence criterion, correlation immunity, algebraic immunity, auto-correlation, and propagation criterion. Moreover, the set of majority logic criterion measures is used to measure the quality and robustness of the generated S-boxes in image encryption. Because obtaining a chaotic sequence with one dimensional Chebyshev polynomials of the first kind is very simpler and efficient than the hyper-chaotic mappings, the proposed algorithm is of lower computational costs compared with recent chaotic S-box generation algorithms.
%U http://jcomsec.ui.ac.ir/article_24638_c526be9a9e77ded28728acb64a5a1ea3.pdf