Skip to main content

On the Construction Structures of \(3 \times 3\) Involutory MDS Matrices over \(\mathbb {F}_{2^{m}}\)

  • Conference paper
  • First Online:
Nonlinear Dynamics and Applications

Abstract

In this paper, we propose new construction structures, in other words, transposition-permutation path patterns for \(3 \times 3\) involutory and MDS permutation-equivalent matrices over \(\mathbb {F}_{2^{3}}\) and \(\mathbb {F}_{2^{4}}\). We generate \(3 \times 3\) involutory and MDS matrices over \(\mathbb {F}_{2^{3}}\) and \(\mathbb {F}_{2^{4}}\) by using the matrix form given in [1], and then all these matrices are analyzed by finding all their permutation-equivalent matrices. After that, we extract whether there are any special permutation patterns, especially for this size of the matrix. As a result, we find new 28,088 different transposition-permutation path patterns to directly construct \(3 \times 3\) involutory and MDS matrices from any \(3 \times 3\) involutory and MDS representative matrix over \(\mathbb {F}_{2^{3}}\) and \(\mathbb {F}_{2^{4}}\). The 35 patterns are in common with these finite fields. By using these new transposition-permutation path patterns, new \(3 \times 3\) involutory and MDS matrices can be generated especially for different finite fields such as \(\mathbb {F}_{2^{8}}\) (is still an open problem because of the large search space). Additionally, the idea of finding the transposition-permutation path patterns can be applicable to larger dimensions such as \(8 \times 8\), \(16 \times 16\), and \(32 \times 32\). To the best of our knowledge, the idea given in this paper to find the common and unique transposition-permutation path patterns over different finite fields is the first work in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Guzel, G.G., Sakallı, M.T., Akleylek, S., Rijmen, V., Cengellenmis, Y.: A new matrix form to generate all \(3 \times 3\) involutory MDS matrices over \(\mathbb{F}_{2^{m}}\). Inf. Process. Lett. 147, 61–68 (2019)

    Article  Google Scholar 

  2. Duval, S., Leurent, G.: MDS matrices with lightweight circuits. IACR Trans. Sym. Crypt. 2, 48–78 (2018)

    Article  Google Scholar 

  3. Tan, Q.Q., Peyrin, T.: Improved heuristics for short linear programs. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(1), 203–230 (2020)

    Google Scholar 

  4. Youssef A.M., Mister S., Tavares S.E. On the design of linear transformation for substitution permutation encryption networks. In: Selected Areas in Cryptography (SAC), pp. 40–48, Ottawa Ontario, Canada, (1997)

    Google Scholar 

  5. Guo, J., Peyrin, T., Poschmann, A.: The PHOTON family of lightweight hash functions. In: Rogaway, P. (eds.) Advances in Cryptology - CRYPTO 2011. CRYPTO 2011. LNCS, vol 6841. pp. 222–239. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22792-9_13

  6. Gupta, K.C., Ray, I.G.: On Constructions of circulant MDS matrices for lightweight cryptography. In: Huang X., Zhou J. (eds) Information Security Practice and Experience. ISPEC 2014. LNCS, vol. 8128, pp. 29–43. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-06320-1_41

  7. Pehlivanoglu, M.K., Sakallı, M.T., Akleylek, S., Duru, N., Rijmen, V.: Generalisation of Hadamard matrix to generate involutory MDS matrices for lightweight cryptography. IET Inf. Secur. 12(4), 348–355 (2018)

    Article  Google Scholar 

  8. Zhou, L., Wang, L., Sun, Y.: On efficient constructions of lightweight MDS matrices. IACR Trans. Symmetric Cryptol. 2018(1), 180–200 (2018)

    Article  Google Scholar 

  9. Wang, S., Li, Y., Tian, S., Zeng, X.: Four by four MDS matrices with the fewest XOR gates based on words. Adv. Math. Commun. 1–28 (2021)

    Google Scholar 

  10. Li, S., Sun, S., Li, C., Wei, Z., Hu, L.: Constructing low-latency involutory MDS matrices with lightweight circuits. IACR Trans. Symmetric Cryptol. 2019(1), 84–117 (2019)

    Article  Google Scholar 

  11. Yang, Y., Zeng, X., Wang, S.: Construction of lightweight involutory MDS matrices. Des. Codes Cryptogr. 89, 1453–1483 (2021)

    Article  MathSciNet  Google Scholar 

  12. Maximov, A., Ekdahl, P.: New circuit minimization techniques for smaller and faster AES Sboxes. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(4), 91–125 (2019)

    Article  Google Scholar 

  13. Xiang, Z., Zeng, X., Lin, D., Bao, Z., Zhang, S.: Optimizing implementations of linear layers. IACR Trans. Symmetric Cryptol. 2020(2), 120–145 (2020)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Meltem Kurt Pehlivanoğlu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kurt Pehlivanoğlu, M., Ali Demir, M., Büyüksaraçoğlu Sakallı, F., Akleylek, S., Tolga Sakallı, M. (2022). On the Construction Structures of \(3 \times 3\) Involutory MDS Matrices over \(\mathbb {F}_{2^{m}}\). In: Banerjee, S., Saha, A. (eds) Nonlinear Dynamics and Applications. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-030-99792-2_48

Download citation

Publish with us

Policies and ethics