Abstract
The paper presents a review of algebraic methods for generating cryptographic S-boxes. In this paper, we consider methods for generating S-boxes based on the use of polynomial transformations (linear, quadratic, cubic), fractional linear transformations, and other special types of algebraic transformations. A number of examples of generating S-boxes using quasigroups and other algebraic structures are also given. The considered methods for generating S-boxes make it possible to obtain new S-boxes that have the necessary cryptographic properties that are the same or even better than those of the S-box built for the Rijndael algorithm.
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: Bulletin of the National Engineering Academy of the Republic of Kazakhstan
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.
