Release time:2025-03-31

Hits:

DOI number:10.1109/CompComm.2017.8322997

Journal:2017 3rd IEEE International Conference on Computer and Communications (ICCC)

Place of Publication:Chengdu, China

Key Words:Finite element analysis;Ciphers;Galois fields;Hardware;Electronic mail;Logic gates;MDS matrix;companion matrix;XOR counts

Abstract: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.

Co-author:Ying Gao

First Author:Dapeng Yin

Indexed by:会议论文

Page Number:2560-2563

ISSN No.:978-1-5090-6353-6

Translation or Not:no