An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization

Abstract EN

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.