4 4 recursive MDS matrices effective for implementation from Reed-Solomon code over GF(q) field

DOI10.1007/978-3-030-92666-3_33MaRDI QIDQ6629063zbMATH OpenFDO

Authors Thi Luong Tran, Ngoc Cuong Nguyen, Duc Trinh Bui

Publication date 29 October 2024

Full work available at URL https://doi.org/10.1007/978-3-030-92666-3_33

zbMATH Keywords

MDS matrixrecursive MDS matricesRS codes

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites work

• Direct construction of recursive MDS diffusion layers using shortened BCH codes
• On the direct construction of recursive MDS matrices
• On the need for multipermutations: Cryptanalysis of MD4 and SAFER
• Recursive diffusion layers for block ciphers and hash functions

This page was built for publication: \(4 \times 4\) recursive MDS matrices effective for implementation from Reed-Solomon code over \(GF(q)\) field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629063)