Building the dynamic diffusion layer for SPN block ciphers based on direct exponent and scalar multiplication
DOI:
https://doi.org/10.54654/isj.v1i15.836Keywords:
MDS matrix, dynamic block cipherTóm tắt
Abstract— Maximum Distance Separable (MDS) matrices have been applied not only in coding theory but also in the design of block ciphers and hash functions. In this paper, we propose algorithms for building a dynamic diffusion layer for SPN block ciphers based on the direct exponent and scalar multiplication. The proposed dynamic algorithms contribute to improving the security of SPN block ciphers against strong attacks on block ciphers such as linear attacks, differential attacks.
Downloads
References
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.
K.C Gupta, I.G Ray, “On Constructions of MDS Matrices From Circulant-Like Matrices For Lightweight Cryptography”, Technical Report No. ASU/2014/1, Dated : 14th February, 2014.
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.
. 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.
. T. T. Luong, N. N. Cuong, L. T. Dung, “A new statement about direct exponent of an MDS matrix in block ciphers”, in 2015 IEEE the Seventh International Conference on Knowledge and Systems Engineering (KSE), IEEE, pp. 340– 343, 2015. (Date Added to IEEE Xplore: 07 January 2016).
. 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. (Date Added to IEEE Xplore: 25 January 2016).
. 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.
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.
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.
F.J. MacWilliams, N.J.A. Sloane, The theory of error-correcting codes. Elsevier, 1977.
M.R.Z’aba, Analysis of Linear Relationships in BlockCiphers. Ph.D. Thesis, Queensland University of Technology, Brisbane, Australia, 2010.
Heys H.M. and Tavares S.E. (1996), “The design of product ciphers resistatnt to dierential and linear crypt-analysis”, Journal of cryptography, vol. 9, no. 1, pp. 1-19.
Lai X., Massey J.L. and Murphy S. (1991), “Markov ciphers and differential cryptanalysis”, In Proceedings of Advances in Cryptology, LNCS 473, Springer, pp. 389 - 404.
Matsui M. (1994), “Linear cryptanalysis method for des cipher”, Advances in Cryptology|EUROCRYPT'93, LNCS 765, pp. 386-397, Springer-Verlag.
Shannon C.E. (1949), “Communication theory of secrecy systems,” Bell System Technical Journal, vol. 28, no. 4, pp. 656-715.
Downloads
Published
How to Cite
Issue
Section
License
Proposed Policy for Journals That Offer Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Proposed Policy for Journals That Offer Delayed Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
