Four by four MDS matrices with the fewest XOR gates based on words

DOI10.3934/AMC.2021025zbMath1518.94096OpenAlexW3179241074MaRDI QIDQ6167301

Shi Wang, Shizhu Tian, Xiangyong Zeng, Yongqiang Li

Publication date: 7 July 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2021025

zbMATH Keywords

implementationinvolutory matrixMDS matrixlightweightsequential XOR count based on words

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Other types of codes (94B60)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
• Logic minimization techniques with applications to cryptology
• Midori: A Block Cipher for Low Energy
• Lightweight Multiplication in $$GF(2^n)$$ with Applications to MDS Matrices
• Lightweight MDS Involution Matrices
• The LED Block Cipher
• Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions
• PRESENT: An Ultra-Lightweight Block Cipher
• Lightweight MDS Generalized Circulant Matrices
• On the Construction of Lightweight Circulant Involutory MDS Matrices
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• GIFT: A Small Present
• The PHOTON Family of Lightweight Hash Functions
• Fast Software Encryption

This page was built for publication: Four by four MDS matrices with the fewest XOR gates based on words