Abstract
In this paper, the method of constructing algorithm for the implementation of large-scale S-box is proposed. Method is based on the composition primitive polynoms under GF(2) allowing to maximize the performance of S-box of a given implementation on different platforms, or to minimize the complexity of a given speed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alex Biryukov, Christophe De Cannire, An Braeken, and Bart Preneel, A toolbox for cryptanalysis: Linear and affine equivalence algorithms. In Advances in Cryptology—EUROCRYPT 2003, volume 2656 (Springer, 2003).
A. A. Bolotov, A. B. Frolov, A. A. Chasovskikh, and S. B. Gashkov, An elementary introduction to elliptic cryptography: protocols of elliptic curve cryptography (Moscow, 2011).
V. V. Yashchenko, O. A. Logachev, and A. A. Salnikov, Boolean functions and coding theory and cryptography (Moscow, 2004).
E. D. Mahovenko and A. G. Rostovtsev, Theoretical cryptography (St. Petersburg, 2005).
M. A. Ivanov and O. S. Zenzin, Advanced Encryption Standard-AES: Finite Fields (Moscow, KUDITS IMAGE, 2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by F. M. Ablayev
Rights and permissions
About this article
Cite this article
Tho, H.D. Application of composition primitive polynomials for implementation of large-scale S-boxes. Lobachevskii J Math 34, 316–318 (2013). https://doi.org/10.1134/S1995080213040136
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080213040136