Paper 2016/119 Original: eprint.iacr.org/2016/119 ↗
Lightweight Multiplication in GF(2^n) with Applications to MDS Matrices
Abstract
In this paper we consider the fundamental question of optimizing finite field multiplications with one fixed element. Surprisingly, this question did not receive much attention previously. We investigate which field representation, that is which choice of basis, allows for an optimal implementation. Here, the efficiency of the multiplication is measured in terms of the number of XOR operations needed to implement the multiplication. While our results are potentially of larger interest, we focus on a particular application in the second part of our paper. Here we construct new MDS matrices which outperform or are on par with all previous results when focusing on a round-based hardware implementation.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2017-02-17: last updated
- 2016-02-14: published
- Short URL
- https://ia.cr/2016/119
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2016/119,
author = {Christof Beierle and Thorsten Kranz and Gregor Leander},
title = {Lightweight Multiplication in GF(2^n) with Applications to MDS Matrices},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/119},
year = {2016},
url = {https://eprint.iacr.org/2016/119}
}