RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2021 Volume 12, Issue 4, Pages 125–143 (Mi mvk398)

Construction of orthomorphic $\mathrm{MDS}$ matrices with primitive characteristic polynomial

O. C. Puente, R. A. de la Cruz Jiménez

Institute of Cryptography, Havana University, Cuba

Abstract: Matrices having the Maximum Distance Separable property ($\mathrm{MDS}$ matrices) are a vital component for the design of symmetric-key algorithms to achieve the diffusion property. In a number of papers the construction and characterization of $\mathrm{MDS}$ matrices with a low implementation cost in the context of the so-called lightweight schemes were considered. However, small attention was paid to the influence of reducibility of the proposed $\mathrm{MDS}$ matrices; this property may be used by an adversary to exploit the nontrivial invariant subspaces associated to corresponding mappings. We propose some methods for constructing $\mathrm{MDS}$ matrices with primitive characteristic polynomial that provide better resistance against the so-called invariant subspaces attacks.

Key words: $\mathrm{MDS}$-matrix, recursive matrix, companion matrix, Feistel network, invariant subspaces, linear orthomorphism.

UDC: 519.719.2

Received 20.XI.2020

Language: English

DOI: 10.4213/mvk391



© Steklov Math. Inst. of RAS, 2024