Tạp chí Khoa học và Công nghệ trong lĩnh vực An toàn thông tin

(Journal of Science and Technology on Information security) ISSN 2615-9570

Articles

Bài viết #447

Từ khóaMa trận MDSmã khối động

Tóm tắt

Chưa có tóm tắt.

Lượt tải theo tháng

051010/2209/2405/2509/2501/26

Di chuột vào cột để xem số lượt tải.

Cách trích dẫn

Tran Thi Luong (2022). Bài viết #447. Hội thảo nghiên cứu ứng dụng Mật mã và An toàn thông tin, 1(15), 39-45.

Tài liệu tham khảo

  1. 1.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.
  2. 2.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.
  3. 3.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.
  4. 4.. 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.
  5. 5.. 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
  6. 6.January 2016).
  7. 7.. 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).
  8. 8.. T. T. Luong, N. N. Cuong, “Direct exponent and scalar multiplication transformations of mds
  9. 9.matrices: some good cryptographic results for dynamic diffusion”, Journal of Computer Science and Cybernetics, vol.32, no.1, pp. 1–17, 2016.
  10. 10.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.
  11. 11.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.
  12. 12.F.J. MacWilliams, N.J.A. Sloane, The theory of error-correcting codes. Elsevier, 1977.
  13. 13.M.R.Z’aba, Analysis of Linear Relationships in BlockCiphers. Ph.D. Thesis, Queensland University of Technology, Brisbane, Australia, 2010.
  14. 14.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.
  15. 15.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.
  16. 16.Matsui M. (1994), “Linear cryptanalysis method for des cipher”, Advances in Cryptology|EUROCRYPT'93, LNCS 765, pp. 386-397, Springer-Verlag.
  17. 17.Shannon C.E. (1949), “Communication theory of secrecy systems,” Bell System Technical Journal, vol. 28, no. 4, pp. 656-715.

Bài viết liên quan