FAST COMPUTATION OF DIRECT EXPONENTIATION TO SPEED UP IMPLEMENTATION OF DYNAMIC BLOCK CIPHERS
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/38/4/17226Keywords:
MDS matrix;, Direct exponentiation;, Dynamic algorithms.Abstract
MDS (maximum distance separable) matrices are ones that come from MDS codes that have been studied for a long time in error correcting code theory and have many applications in block ciphers. To improve the security of block ciphers, dynamic block ciphers can be created. Using MDS matrix transformations is a method used to make block ciphers dynamic. Direct exponentiation is a transformation that can be used to generate dynamic MDS matrices to create a dynamic diffusion layer of the block ciphers. However, for cryptographic algorithms that use an MDS matrix as a component of them, the implementation of matrix multiplication is quite expensive, especially when the matrix has a large size. In this paper, the mathematical basis for quick calculation of direct exponentiation of an MDS matrix will be presented. On that basis, it is to
suggest how to apply that fast calculation to dynamic algorithms using the direct exponentiation. This result is very meaningful in software implementation for MDS matrices, especially when implementing dynamic block ciphers to increase execution speed.
Metrics
References
A. H. Al-Wattar, R. Mahmod, Z. A. Zukarnain , N. Udzir, A new DNA based approach of generating key dependent Mixcolumns transformation, International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015. DOI: https://doi.org/10.5121/ijcnc.2015.7208
F. Ahmed and D. Elkamchouchi, “Strongest aes with s-boxes bank and dynamic key mds matrix (sdk-aes),” International Journal of Computer and Communication Engineering, vol. 2, no. 4, p. 530, 2013. DOI: https://doi.org/10.7763/IJCCE.2013.V2.242
F.J. MacWilliams, N.J.A. Sloane, The theory of error-correcting codes. Elsevier, 1977.
G. Murtaza, A. A. Khan, S. W. Alam, A. Farooqi, “Fortification of aes with dynamic mix-column transformation,” IACR Cryptology ePrint Archive, vol. 2011, p. 184, 2011.
G. Murtaza, N. Ikram, “Direct Exponent and Scalar Multiplication Classes of an MDS Matrix”, [EB/OL], National University of Sciences and Technology, Pakistan, (2011-01-10), pp. 2-5.
I.A. Ismil, H. G. Galal, S. Khattab and M. A. E, I. M.E. Bahtity, Performance examination of AES encrytion algorithm with constant and dynamic rotation, International Journal of Reviews in Computing, ISSN: 2076-3328, 31st December 2012. Vol. 12, 2012.
K.C.Shyamala Bai, Dr.M.V.Satyanarayana, Dr. P.A. Vijaya, Variable Size Block Encryption using Dynamic-key Mechanism (VBEDM), International Journal of Computer Applications (0975 – 8887), Volume 27– No.7, August 2011. DOI: https://doi.org/10.5120/3311-4539
T. T. Luong, “Building the dynamic diffusion layer for SPN block ciphers based on direct exponent and scalar multiplication”, Journal of Science and Technology on Information Security of Viet Nam Government Information Security Commission, Vol. 1. No. (15), pp. 10–16, 2022. DOI: https://doi.org/10.54654/isj.v1i15.836
T. T. Luong, N. N. Cuong, “Direct exponent and scalar multiplication transformations of mds matrices: some good cryptographic results for dynamic diffusion”, Journal of Computer Science and Cybernetics, vol.32, no.1, pp. 1–17, 2016. DOI: https://doi.org/10.15625/1813-9663/32/1/7732
T. T. Luong, N. N. Cuong, L. T. Dung, “The preservation of good cryptographic properties of MDS matrix under direct exponent transformation”, Journal of Computer Science and Cybernetics, vol.31, no.4, pp. 291–303, 2015. DOI: https://doi.org/10.15625/1813-9663/31/4/7059
T. T. Luong, N. N. Cuong, L. T. Dung, “The preservation of the coefficient of fixed points of an MDS matrix under direct exponent transformation”, in 2015 IEEE International Conference on Advanced Technologies for Communications (ATC), IEEE, pp. 111–116, 2015. DOI: https://doi.org/10.1109/ATC.2015.7388301
W. Mohamed, Ridza, M. Abdulrashid, “A method for linear transformation in substitution permutation network symmetric-key block cipher,” international application published under the patent cooperation treaty, 10 may 2012, pp. 3-14.
Downloads
Published
How to Cite
Issue
Section
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
