Efficient construction of a substitution box based on a Mordell elliptic curve over a finite field
- 11 Downloads
Elliptic curve cryptography has been used in many security systems due to its small key size and high security compared with other cryptosystems. In many well-known security systems, a substitution box (S-box) is the only non-linear component. Recently, it has been shown that the security of a cryptosystem can be improved using dynamic S-boxes instead of a static S-box. This necessitates the construction of new secure S-boxes. We propose an efficient method to generate S-boxes that are based on a class of Mordell elliptic curves over prime fields and achieved by defining different total orders. The proposed scheme is developed in such a way that for each input it outputs an S-box in linear time and constant space. Due to this property, our method takes less time and space than the existing S-box construction methods over elliptic curves. Computational results show that the proposed method is capable of generating cryptographically strong S-boxes with security comparable to some of the existing S-boxes constructed via different mathematical structures.
Key wordsSubstitution box Finite field Mordell elliptic curve Total order Computational complexity
Unable to display preview. Download preview PDF.
Compliance with ethics guidelines
Naveed Ahmed AZAM, Umar HAYAT, and Ikram ULLAH declare that they have no conflict of interest.
- Cui LG, Cao YD, 2007. A new S-box structure named affinepower-affine. Int J Innov Comput Inform Contr, 3(3): 751–759.Google Scholar
- Katiyar S, Jeyanthi N, 2016. Pure dynamic S-box construction. Int J Comput, 1:42–46.Google Scholar
- Khan M, Azam NA, 2015b. S-boxes based on affine mapping and orbit of power function. 3D Res, 6(2), Article 43. https://doi.org/10.1007/s13319-015-0043-x
- Shannon CE, 1949. Communication theory of secrecy systems. Bell Syst Tech J, 28(4):656–715. https://doi.org/10.1002/j.1538-7305.1949.tb00928.x MathSciNetCrossRefGoogle Scholar