A new construction of lightweight MDS matrices
发布时间：2025-03-31
点击次数：
- DOI码：
- 10.1109/CompComm.2017.8322997
- 发表刊物：
- 2017 3rd IEEE International Conference on Computer and Communications (ICCC)
- 刊物所在地：
- Chengdu, China
- 关键字：
- Finite element analysis;Ciphers;Galois fields;Hardware;Electronic mail;Logic gates;MDS matrix;companion matrix;XOR counts
- 摘要：
- Since maximum distance separable (MDS) matrices can be used as the best building blocks of diffusion layer of block cipher or hash functions, extensive studies have been investigated. In this article, we provide a new method to search lightweight MDS matrices. By providing a new matrix representation of elements of finite fields and observing the special form of the matrices, we exhibit new search algorithms that greatly reduce the search space and make lightweight MDS matrices with low XOR counts. We provide the non-involutory MDS matrices with the least possible XOR gates for dimension 4×4 over finite fields GF(2^4) and GF(2^8) respectively. Compared to the best known matrices, our new candidates have advantages for hardware implementation.
- 合写作者：
- Ying Gao
- 第一作者：
- Dapeng Yin
- 论文类型：
- 会议论文
- 页面范围：
- 2560-2563
- ISSN号：
- 978-1-5090-6353-6
- 是否译文：
- 否
- 上一条：基于区块链的多方隐私保护公平合同签署协议
- 下一条：更高效的指纹生物特征加密
