z-logo
open-access-imgOpen Access
Efficient and Simple Method for Designing Chaotic S‐Boxes
Author(s) -
Asim Muhammad,
Jeoti Varun
Publication year - 2008
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.08.0207.0188
Subject(s) - s box , chaotic , piecewise linear function , cryptography , linear cryptanalysis , differential (mechanical device) , simple (philosophy) , mixing (physics) , chaotic map , algorithm , piecewise , computer science , mathematics , property (philosophy) , substitution (logic) , cryptanalysis , theoretical computer science , mathematical optimization , block cipher , engineering , artificial intelligence , mathematical analysis , philosophy , physics , epistemology , quantum mechanics , programming language , aerospace engineering
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here