Advertisement

Journal of Applied and Industrial Mathematics

, Volume 13, Issue 2, pp 302–309 | Cite as

Experimental Methods for Constructing MDS Matrices of a Special Form

  • M. I. RozhkovEmail author
  • S. S. MalakhovEmail author
Article
  • 7 Downloads

Abstract

MDS matrices are widely used as a diffusion primitive in the construction of block type encryption algorithms and hash functions (such as AES and GOST 34.12-2015). The matrices with the maximum number of 1s and minimum number of different elements are important for more efficient realizations of the matrix-vector multiplication. The article presents a new method for the MDS testing of matrices over finite fields and shows its application to the (8 × 8)-matrices of a special form with many 1s and few different elements; these matrices were introduced by Junod and Vaudenay. For the proposed method we obtain some theoretical and experimental estimates of effectiveness. Moreover, the article comprises a list of some MDS matrices of the above-indicated type.

Keywords

MDS matrix MDS code 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V. Anashkin, “A Complete Description of a Class of MDS-Matrices over Finite Field of Characteristic 2,” Mat. Vopr. Kriptogr. 8(4), 5–28 (2017).MathSciNetCrossRefGoogle Scholar
  2. 2.
    F. M. Malyshev, “The Duality of Differential and Linear Methods in Cryptography,” Mat. Vopr. Kriptogr. 5(3), 35–47 (2014).CrossRefGoogle Scholar
  3. 3.
    F. M. Malyshev and D. I. Trifonov, “Diffusion Properties of XSLP-Ciphers,” Mat. Vopr. Kriptogr. 7(3), 47–60 (2016).CrossRefGoogle Scholar
  4. 4.
    M. Matsui, “On Correlation between the Order of S-Boxes and the Strength of DES,” in Advances in Cryptology — EUROCRYPT’ 94: (Proceedings of the Workshop on Theory and Application of Cryptography Techniques, Perugia, Italy, May 9–12, 1994) (Springer, Heidelberg, 1995), pp. 366–375.CrossRefGoogle Scholar
  5. 5.
    D. Augot and M. Finiasz, “Exhaustive Search for Small Dimension Recursive MDS Diffusion Layers for Block Ciphers and Hash Functions,” in Proceedings of 2013 IEEE International Symposium on Information Theory (Istanbul, Turkey, July 7–12, 2013) (IEEE, Piscataway, 2013), pp. 1551–1555.CrossRefGoogle Scholar
  6. 6.
    A. V. Belov, A. B. Los, and M. I. Rozhkov, “Some Approaches to Construct MDS Matrices over a Finite Field,” Commun. Appl. Math. Comp. 31(2), 143–152 (2017).zbMATHGoogle Scholar
  7. 7.
    A. V. Belov, A. B. Los, and M. I. Rozhkov, “Some Classes of the MDS Matrices over a Finite Field,” Lobachevskii J. Math. 38(5), 880–883 (2017).MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    E. Couselo, S. González, V. Markov, and A. Nechaev, “Recursive MDS-Codes and Recursive Differentiable Quasigroups,” Discrete Math. Appl. 8(3), 217–245 (1998).MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    E. Couselo, S. González, V. Markov, and A. Nechaev, “Parameters of Recursive MDS-Codes,” Discrete Math. Appl. 10(5), 433–453 (2000).MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    K. C. Gupta and I. G. Ray, “On Constructions of MDS Matrices from Companion Matrices for Lightweight Cryptography,” in Security Engineering and Intelligence Informatics (Proceedings. CD-ARES 2013 Workshops: MoCrySEn SeCIHD, Regensburg, Germany, September 2–6, 2013) (Springer, Heidelberg, 2013), pp. 29–43.Google Scholar
  11. 11.
    K. C. Gupta and I. G. Ray, “On Constructions of Circulant MDS Matrices for Lightweight Cryptography,” in Information Security Practice and Experience (Proceedings of 10th International Conference, Fuzhou, China, May 5–8, 2014) (Springer, Cham, 2014), pp. 564–576.CrossRefGoogle Scholar
  12. 12.
    P. Junod and S. Vaudenay, “Perfect Diffusion Primitives for Block Ciphers: Building Efficient MDS Matrices,” in Selected Areas in Cryptography (Revised Selected Papers. 11th International Conference, Waterloo, Canada, August 9–10, 2004) (Springer, Heidelberg, 2005), pp. 84–99.Google Scholar
  13. 13.
    R. Lidl and H. Niederreiter, Finite Fields (Camb. Univ. Press, Cambridge, 1985; Mir, Moscow, 1988).zbMATHGoogle Scholar
  14. 14.
    F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1977; Svyaz’, Moscow, 1979).zbMATHGoogle Scholar
  15. 15.
    M. Hall, Jr., Combinatorial Theory (Blaisdell, Waltham, MA, 1967; Mir, Moscow, 1970).zbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2019

Authors and Affiliations

  1. 1.National Research University Higher School of EconomicsMoscowRussia

Personalised recommendations