A Novel Efficient and Simple Method for Designing Chaotic S-boxes

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 piece-wise linear chaotic maps. The S-box so
constructed has very low differential and linear
approximation probabilities. The proposed S-box is more
secure against the differential and linear cryptanalysis
compared to the recently proposed chaotic S-boxes [1]-[2].