Efficient Cryptographic Substitution Box Design Using Travelling Salesman Problem and Chaos
This work addresses the need for secure nonlinear components in modern block symmetric ciphers, representing an incremental improvement in cryptographic substitution-box design.
The paper tackled the design of efficient 8x8 substitution-boxes for symmetric encryption by exploring the travelling salesman problem and piecewise linear chaotic map, resulting in a configuration that is cryptographically more impressive compared to recent investigations, as justified by standard performance indexes.
Symmetric encryption has been a standout amongst the most reliable option by which security is accomplished. In modern block symmetric ciphers, the substitution-boxes have been playing a critical role of nonlinear components that drives the actual security of ciphers. In this paper, the travelling salesman problem and piecewise linear chaotic map are explored to synthesize an efficient configuration of 8x8 substitution-box. The proposed anticipated design has the consistency which is justified by the standard performance indexes. The statistical results manifest that the prospective substitution-box is cryptographically more impressive as compared to some recent investigations.