Abstract
MDS matrices are from the MDS codes in coding theory that are being used widely in cryptographic applications. Recursive MDS matrix is an matrix that is a power of some simple companion matrix. These matrices are so convenient for execution especially for hardware implementation using LFSRs. Therefore, these matrices have attracted the interest of many scientists. In this paper, we give a way to directly build 8 × 8 self-reciprocal recursive MDS matrices efficient for execution over the field GF(q), (q = pr, pis a prime number) using the Reed-Solomon codes. These matrices are significant in practice because they have the potential to be used in lightweight cryptographic algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences & Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
