Journal
FRONTIERS OF INFORMATION TECHNOLOGY & ELECTRONIC ENGINEERING
Volume 20, Issue 10, Pages 1378-1389Publisher
ZHEJIANG UNIV
DOI: 10.1631/FITEE.1800434
Keywords
Substitution box; Finite field; Mordell elliptic curve; Total order; Computational complexity; TP309
Categories
Funding
- JSPS KAKENHI [18J23484]
- Grants-in-Aid for Scientific Research [18J23484] Funding Source: KAKEN
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available