%I ETRI
%P 170-172
%R 10.4218/etrij.08.0207.0188
%D 2008
%A M. Asim
%A V. Jeoti
%K Algorithms; Approximation theory; Chaotic systems; Linear systems; Map symbols; Probability distributions, Linear chaotic maps; Linear cryptanalysis; Substitution box (S-box), Public key cryptography
%O cited By 64
%N 1
%T Efficient and simple method for designing chaotic S-boxes
%J ETRI Journal
%V 30
%X A substitution box (S-box) plays a central role in cryptographic algorithms. In this paper, an efficient method for designing S-boxes based on chaotic maps is proposed The proposed method is based on the mixing property of piecewise linear chaotic maps. The S-box so constructed has very low differential and linear approximation probabilities. The proposed S-box is more secure against differential and linear cryptanalysis compared to recently proposed chaotic S-boxes.
%L scholars515