Abstract

In the symmetric key cryptography, the purpose of the substitution box is to generate confusion and hence improve the security of the whole cryptosystem. For this reason, many algebraic substitution boxes are constructed depending upon the associative algebras of Galois fields. In this paper, the power associative loop is used for the construction of substitution boxes. This novel structure comprises excellent features which include, the inverse of zero element, non-associativity and fewer constraints as compared to the cyclic group and Galois field. In comparison to existing substitution boxes, the substitution boxes based upon power associative loop are comparatively easy and the above-mentioned properties offer the number of structures to construct highly nonlinear substitution boxes. To obtain the number of substitution boxes, we further applied the symmetric group of order 16 on the proposed substitution box. The evaluation of proposed boxes with different algebraic and statistical analyses like nonlinearity test, strict avalanche criterion, bit independence criterion, linear approximation probability and differential approximation probability indicate the strength of proposed substitution boxes. Majority logic criterion results depict that proposed substitution boxes have better cryptographic strength to apply in different techniques of secure communication.

Highlights

  • Due to the fast access to the internet, the availability of information is possible all around the globe

  • MOTIVATION With this swift publication of S-boxes based on associative algebras of Galois field and their applications in different cryptosystems, the motivations of this research work are given in detail

  • The results show that our proposed S-boxes are secure and best suited for the encryption process

Read more

Summary

INTRODUCTION

Due to the fast access to the internet, the availability of information is possible all around the globe. S. Hussain et al.: Power Associative Loop Structure for the Construction of Non-Linear Components of Block Cipher. With the restrictions and limitations of these structures, it is required to develop and improve these associative structures and explore different structures with fewer constraints and have more strength to counter different attacks For this purpose, it’s time to thoroughly discuss non-associative structures to improve the structure for the construction of S-boxes and eradicate the security flaws in the cryptosystems. B. MOTIVATION With this swift publication of S-boxes based on associative algebras of Galois field and their applications in different cryptosystems, the motivations of this research work are given in detail. 1) S-boxes based upon associative algebras of Galois field have Cayley’s table and structure is public which makes this construction fragile to any invader.

PRELIMINARIES
ALGEBRAIC ANALYSES OF S-BOX
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call