Heuristic approach for nonlinear n × n (3 ≤ n ≤ 7) substitution-boxes

Ahmad, M. and Alauddin, M. and AlSharari, H.D. (2018) Heuristic approach for nonlinear n × n (3 ≤ n ≤ 7) substitution-boxes. Advances in Intelligent Systems and Computing, 542. pp. 347-355. ISSN 21945357

Full text not available from this repository.
Official URL: https://link.springer.com/chapter/10.1007%2F978-98...

Abstract

Substitution boxes are meant to enact nonlinear transformations of n-bit input streams to n-bit output streams. A highly nonlinear essence of them is imperative to induce obligatory confusion of data and to mitigate the potential linear cryptanalysis as well. It has been known that cryptographically potent S-boxes are creditworthy for the success of modern block encryption systems. This paper proposes to suggest an approach to frame a generic design that has the efficacy of synthesizing highly nonlinear balanced n × n S-boxes for 3 ≤ n ≤ 7. The proposed approach is based on the heuristic optimization that seeks for local and global best S-box candidates on each iteration. The resultant optimized S-boxes are provided and tested for nonlinearity soundness. The performance outcomes and assessment analysis justify that the generic approach is consistent for contriving highly nonlinear key-dependent S-boxes.

Item Type: Article
Uncontrolled Keywords: Block encryption; Heuristic optimization; Linear cryptanalysis; Nonlinearity; Substitution-box
Subjects: T Technology > T Technology (General)
Divisions: Faculties > Faculty of Engineering and Technology
Depositing User: AMU Library
Date Deposited: 20 Jan 2018 06:08
Last Modified: 20 Jan 2018 06:08
URI: http://ir.amu.ac.in/id/eprint/10874

Actions (login required)

View Item View Item