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

Azam, Naveed Ahmed; Hayat, Umar; Ullah, Ikram

doi:10.1155/2018/3421725

Cited by 41 publications

(53 citation statements)

References 33 publications

(55 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consequently, dynamic S-boxes harden a cipher against potential brute-force attacks by increasing the key space [10]. In order to measure the strength of an S-box, researchers compare their S-box performance against available benchmark including Nonlinearity (NL), Linear Approximation Probability (LAP), Differential Approximation Probability (DAP), Strict Avalanche Criterion (SAC) and Bit Independence Criterion (BIC) [2,7,[10][11][12][13][14][15][16][17]. Efficient methods for S-box construction, such as [7,11,14], generate a single or a limited number of static S-boxes.…”

Section: A S-box Based Encryptionmentioning

confidence: 99%

Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

Ibrahim

Alharbi

2020

IEEE Access

View full text Add to dashboard Cite

Image encryption schemes can be vulnerable to a variety of cryptanalysis attacks. The use of key-dependent dynamic S-boxes has been shown to improve security. Threats of chosen-plaintext and chosen-ciphertext attacks still linger. In this paper, we present an efficient algorithm for constructing secure dynamic S-boxes derived from Henon map. We use the proposed dynamic S-box to construct an image encryption scheme that includes a novel combination of security features to resist chosen-plaintext and chosen-ciphertext attacks. Namely, a hash verification step at the end of the decryption procedure effectively thwarts chosen-ciphertext attacks. The hash also serves as an image dependent initialization for the keystream, which together with using an image dependent S-box resist known-plaintext attacks. Furthermore, encryption keys are protected against cryptanalysis using elliptic curve cryptography (ECC).Therefore, the recovery of secret keys is as hard as the elliptic curve discrete logarithm problem even in the unlikely case of the recovery of the temporary S-box or keystream. Our evaluation of the proposed image encryption scheme reveals that it achieves a higher security standard than existing techniques. Moreover, the proposed scheme is computationally efficient with encryption throughput approaching 60 MB/s. INDEX TERMS chaotic map, elliptic curve cryptography, image encryption, substitution box.

show abstract

Section: A S-box Based Encryptionmentioning

confidence: 99%

Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

Ibrahim

Alharbi

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…In 2020, Wang et al introduced a novel GA for the generation of bijective substitution boxes with high nonlinearity [49]. Besides the aforementioned, there are some recently published papers that combine chaotic number generators, elliptic curves, quantum computing, and heuristic methods in the design of dynamic and key-dependent S-boxes with good cryptographic properties [22]- [27], [50]- [56], [58]- [60].…”

Section: Introductionmentioning

confidence: 99%

Evolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks

et al. 2020

View full text Add to dashboard Cite

Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphers against linear, differential, or side-channel attacks is dependent on the design of such component and their intrinsic properties. There are several methods that aim to cryptographically define, generate, or search for strong substitution boxes. The application of combinatorial optimization algorithms is one of the most useful methodologies in this research area. In this paper, we present a novel hybrid method based on the Leaders and Followers and hill-climbing over Hamming Weight Classes metaheuristics, coupled with a new trade-off fitness function that generates 8-bit bijective substitution boxes with good resisting properties towards classical cryptanalysis and side-channel attacks by power consumption. We address the best Pareto optimal solutions for the multi-objective optimization of non-linearity and confusion coefficient variance.

show abstract

“…The most popular and standard cryptographic properties of S-boxes are as follows: high nonlinearity, low differential uniformity, the strict avalanche criterion equals to 0.5, the satisfaction of bits independence criterion for high bits independence criterion (BIC) nonlinearity and BIC–strict avalanche criterion (SAC) close to 0.5, and low linear approximation probability. A majority of the existing S-boxes schemes have scrutinized their constructed S-boxes mainly against these security properties [ 37 , 38 , 39 , 40 , 41 ]. The following subsections analyzed the proposed S-boxes under the mentioned properties.…”

Section: Performance Results and Analysesmentioning

confidence: 99%

Evolving Dynamic S-Boxes Using Fractional-Order Hopfield Neural Network Based Scheme

Ahmad

Alsolami

2020

Entropy

View full text Add to dashboard Cite

Static substitution-boxes in fixed structured block ciphers may make the system vulnerable to cryptanalysis. However, key-dependent dynamic substitution-boxes (S-boxes) assume to improve the security and robustness of the whole cryptosystem. This paper proposes to present the construction of key-dependent dynamic S-boxes having high nonlinearity. The proposed scheme involves the evolution of initially generated S-box for improved nonlinearity based on the fractional-order time-delayed Hopfield neural network. The cryptographic performance of the evolved S-box is assessed by using standard security parameters, including nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, etc. The proposed scheme is able to evolve an S-box having mean nonlinearity of 111.25, strict avalanche criteria value of 0.5007, and differential uniformity of 10. The performance assessments demonstrate that the proposed scheme and S-box have excellent features, and are thus capable of offering high nonlinearity in the cryptosystem. The comparison analysis further confirms the improved security features of anticipated scheme and S-box, as compared to many existing chaos-based and other S-boxes.

show abstract

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

Cited by 41 publications

References 33 publications

Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

Evolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks

Evolving Dynamic S-Boxes Using Fractional-Order Hopfield Neural Network Based Scheme

Contact Info

Product

Resources

About