Abstract
A Substitution box (S-box) is an important component used in symmetric key cryptosystems to satisfy Shannon’s property on confusion. As the only nonlinear operation, the S-box must be cryptographically strong to thwart any cryptanalysis tools on cryptosystems. Generally, the S-boxes can be constructed using any of the following approaches: the random search approach, heuristic/evolutionary approach or mathematical approach. However, the current S-box construction has some drawbacks, such as low cryptographic properties for the random search approach and the fact that it is hard to develop mathematical functions that can be used to construct a cryptographically strong S-box. In this paper, we explore the non-permutation function that was generated from the binomial operation of the power function to construct a cryptographically strong S-box. By adopting the method called the Redundancy Removal Algorithm, we propose some enhancement in the algorithm such that the desired result can be obtained. The analytical results of our experiment indicate that all criteria such as bijective, nonlinearity, differential uniformity, algebraic degree and linear approximation are found to hold in the obtained S-boxes. Our proposed S-box also surpassed several bijective S-boxes available in the literature in terms of cryptographic properties.
Funder
Ministry of Higher Education
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference94 articles.
1. Communication Theory of Secrecy Systems;Shannon;Bell Syst. Tech. J.,1949
2. Differential Cryptanalysis of DES-like Cryptosystems;Menezes;Advances in Cryptology—CRYPT0 ’90,1991
3. Linear Cryptanalysis Method for DES Cipher;Helleseth;EUROCRYPT ’93,1994
4. Higher Order Derivatives and Differential Cryptanalysis;Blahut;Communications and Cryptography,1994
5. Truncated and Higher Order Differentials;Preneel;Fast Software Encryption,1995
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献