A Simple and Efficient Key-Dependent S-Box Design Using Fisher-Yates Shuffle Technique

26Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The substitution boxes are the only components in most of symmetric encryption systems that induce nonlinearity to provide efficacious data confusion. The cryptographic potency of these systems primarily depends upon the caliber of their S-boxes. This brings new challenges to design cryptographically efficient S-boxes to develop strong encryption systems. Here, a simple and effective method to design an efficient 8×8 S-box is put forward. The proposed design methodology is based on the classical Fisher-Yates shuffle technique. A piece-wise linear chaotic map is incorporated to act as a source to generate random numbers for proficient execution of shuffle technique. The construction of dynamic S-box is under the control of secret key. The performance evaluation of proposed S-box against standard statistical tests like bijective property, nonlinearity, strict avalanche criteria and equiprobable I/O XOR distribution reveals its excellent performance. Moreover, the proposed S-box is also compared with some recent chaos-based S-boxes. The investigations confirm that the design is consistent and suitable for secure communication. © Springer-Verlag Berlin Heidelberg 2014.

Cite

CITATION STYLE

APA

Ahmad, M., Khan, P. M., & Ansari, M. Z. (2014). A Simple and Efficient Key-Dependent S-Box Design Using Fisher-Yates Shuffle Technique. In Communications in Computer and Information Science (Vol. 420 CCIS, pp. 540–550). Springer Verlag. https://doi.org/10.1007/978-3-642-54525-2_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free