More Constructions of Light MDS Transforms Based on Known MDS Circulant Matrices

نویسندگان

چکیده

Maximum distance separable (MDS) codes have the maximum branch number in cryptography, and they are generally used diffusion layers of symmetric ciphers. The layer Advanced Encryption Standard (AES) uses circulant MDS matrix with row element {2;3;1;1} F28. It is simplest F2n4, recorded as A=Circ(2;3;1;1). In this paper, we study more extensive constructions A F2n4. By transforming multiplication operation finite field into bit-level operation, propose a multivariable definition based on simple operations, such cyclic shift, XOR. We apply to lightweight discuss classification clusters. also give an example cluster A. Without changing structure, elements, implementation cost known matrix, existing transformations expanded n2/2 times that its original. paper provide rich component materials for design cryptographic algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lightweight MDS Generalized Circulant Matrices

In this article, we analyze the circulant structure of generalized circulant matrices to reduce the search space for finding lightweight MDS matrices. We first show that the implementation of circulant matrices can be serialized and can achieve similar area requirement and clock cycle performance as a serial-based implementation. By proving many new properties and equivalence classes for circul...

متن کامل

On Constructions of MDS Matrices From Circulant-Like Matrices For Lightweight Cryptography

Maximum distance separable (MDS) matrices have applications not only in coding theory but are also of great importance in the design of block ciphers and hash functions. It is highly nontrivial to find MDS matrices which could be used in lightweight cryptography. In a SAC 2004 paper, Junod et. al. constructed a new class of efficient MDS matrices whose submatrices were circulant matrices and th...

متن کامل

Lightweight MDS Generalized Circulant Matrices (Full Version)

In this article, we analyze the circulant structure of generalized circulant matrices to reduce the search space for finding lightweight MDS matrices. We first show that the implementation of circulant matrices can be serialized and can achieve similar area requirement and clock cycle performance as a serial-based implementation. By proving many new properties and equivalence classes for circul...

متن کامل

On the Construction of Lightweight Circulant Involutory MDS Matrices

In the present paper, we investigate the problem of constructing MDS matrices with as few bit XOR operations as possible. The key contribution of the present paper is constructing MDS matrices with entries in the set of m ×m non-singular matrices over F2 directly, and the linear transformations we used to construct MDS matrices are not assumed pairwise commutative. With this method, it is shown...

متن کامل

Constructions of MDS-convolutional codes

Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information

سال: 2022

ISSN: ['2078-2489']

DOI: https://doi.org/10.3390/info13070347