Journal
SECURITY AND COMMUNICATION NETWORKS
Volume -, Issue -, Pages -Publisher
WILEY-HINDAWI
DOI: 10.1155/2018/3421725
Keywords
-
Funding
- JSPS KAKENHI [18J23484]
- Grants-in-Aid for Scientific Research [18J23484] Funding Source: KAKEN
Ask authors/readers for more resources
Elliptic curves (ECs) are considered as one of the highly secure structures against modern computational attacks. In this paper, we present an efficient method based on an ordered isomorphic EC for the generation of a large number of distinct, mutually uncorrelated, and cryptographically strong injective S-boxes. The proposed scheme is characterized in terms of time complexity and the number of the distinct S-boxes. Furthermore, rigorous analysis and comparison of the newly developed method with some of the existing methods are conducted. Experimental results reveal that the newly developed scheme can efficiently generate a large number of distinct, uncorrelated, and secure S-boxes when compared with some of the well-known existing schemes.
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