On Circulant-Like Rhotrices over Finite Fields

Authors

P. L. Sharma, Himachal Pradesh University
Shalini Gupta, Bahra University
Mansi Rehan, Government College Nahan (H.P.)

Abstract

Circulant matrices over finite fields are widely used in cryptographic hash functions, Lattice based cryptographic functions and Advanced Encryption Standard (AES). Maximum distance separable codes over finite field GF2 have vital a role for error control in both digital communication and storage systems whereas maximum distance separable matrices over finite field GF2 are used in block ciphers due to their properties of diffusion. Rhotrices are represented in the form of coupled matrices. In the present paper, we discuss the circulant- like rhotrices and then construct the maximum distance separable rhotrices over finite fields.

Recommended Citation

Sharma, P. L.; Gupta, Shalini; and Rehan, Mansi (2017). On Circulant-Like Rhotrices over Finite Fields, Applications and Applied Mathematics: An International Journal (AAM), Vol. 12, Iss. 1, Article 33.
Available at: https://digitalcommons.pvamu.edu/aam/vol12/iss1/33