HomeIssuesSome methods for constructing MDS-matrices over finite field

Some methods for constructing MDS-matrices over finite field | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 46. DOI: 10.17223/20710410/46/1

In this work, we propose new methods for constructing MDS-matrices by raising the degree of the accompanying matrices of polynomials over a finite field. We study a series of irreducible polynomials of degrees t = 4 and 6, the accompanying matrix of which, when raised to the corresponding degree t, is an MDS-matrix. A new method for constructing MDS matrices oriented to low-resource software and hardware implementations is presented.
Download file
Counter downloads: 137
  • Title Some methods for constructing MDS-matrices over finite field
  • Headline Some methods for constructing MDS-matrices over finite field
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 46
  • Date:
  • DOI 10.17223/20710410/46/1
Keywords
MDS-матрицы, сопровождающие матрицы многочленов, неприводимые многочлены, линейные регистры сдвига, конечные поля, XOR-сложность, MDS-matrices, companion matrices, irreducible polynomials, LFSR, finite field, lightweight cryptography, XOR-count
Authors
References
Shannon C. E. Communication theory of secrecy systems // Bell System Technical J. 1949. V.28. No.4. P. 656-715
Augot D. and Finiasz M. Direct construction of recursive MDS diffusion layers using shortened BCH codes // Intern. Workshop on Fast Software Encryption. Springer, 2014. P. 3-17
Guo J., Peyrin T., and Poschmann A. The PHOTON family of lightweight hash functions // Ann. Cryptology Conf. Springer, 2011. P. 222-239
Gupta K. C. and Ray I. G. On constructions of MDS matrices from companion matrices for lightweight cryptography // Intern. Conf. Availability, Reliability, and Security. Springer, 2013. P. 29-43
Sarkar S. and Sim S. M. A deeper understanding of the XOR count distribution in the context of lightweight cryptography // Intern. Conf. Cryptology in Africa. Springer, 2016. P. 167-182
Toh D., Teo J., Khoo K., and Sim S. M. Lightweight MDS serial-type matrices with minimal fixed XOR count // Intern. Conf. Cryptology in Africa. Springer, 2018. P. 51-71
Burov D. A. and Pogorelov B. A. The influence of linear mapping reducibility on the choice of round constants // Математические вопросы криптографии. 2017. Т. 8. № 2. С. 51-64
Глухов М. М., Елизаров В. П., Нечаев А. А. Алгебра: 2-е изд., испр. и доп. Санкт-Петербург; Москва; Краснодар: Лань, 2015
Some methods for constructing MDS-matrices over finite field | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 46. DOI: 10.17223/20710410/46/1
Some methods for constructing MDS-matrices over finite field | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 46. DOI: 10.17223/20710410/46/1
Download full-text version
Counter downloads: 433