Codes over L(GF(2)^m, GF(2)^m), MDS diffusion matrices and cryptographic applications

DOI10.1007/978-3-319-18681-8_16MaRDI QIDQ2947083zbMATH OpenOpenAlexFDO

Authors

Publication date 21 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18681-8_16

zbMATH Keywords

symmetric cryptographydiffusion layersMDS matricesadditive block codes

Mathematics Subject Classification ID

Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Construction of Recursive MDS Diffusion Layers from Gabidulin Codes
• Construction of efficient MDS matrices based on block circulant matrices for lightweight application
• Diffusion matrices from algebraic-geometry codes with efficient SIMD implementation
• Selected Areas in Cryptography
• scientific article; zbMATH DE number 6830787

Cites work

• scientific article; zbMATH DE number 1682693 (Why is no real title available?)
• scientific article; zbMATH DE number 1284430 (Why is no real title available?)
• Algebraic structure of quasicyclic codes
• Codes over finite quotients of polynomial rings
• On the algebraic structure of quasi-cyclic codes. IV: Repeated roots
• The PHOTON family of lightweight hash functions

Cited in

(4)

• Diffusion matrices from algebraic-geometry codes with efficient SIMD implementation
• Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem
• Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
• Security analysis of a cryptosystem based on subspace subcodes

This page was built for publication: Codes over \(\mathcal{L}(\mathrm{GF}(2)^m, \mathrm{GF}(2)^m)\), MDS diffusion matrices and cryptographic applications

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