Abstract
Abstract— Substitution box plays an essential role in block ciphers as their main non-linear component in the round function, providing confusion. In this paper, it will be proven how the action of any substitution box on every fixed element can be represented through an affine transformation using an invertible matrix in a finite field. Furthermore, a particular way to represent the action of permutations on every element through a modular addition is given. An analysis of the AES substitution box is conducted based on the theoretical results obtained.
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 callMore From: Journal of Science and Technology on Information security
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
