Paper 2019/229
XOR-counts and lightweight multiplication with fixed elements in binary finite fields
Lukas Kölsch
Abstract
XOR-metrics measure the efficiency of certain arithmetic operations in binary finite fields. We prove some new results about two different XOR-metrics that have been used in the past. In particular, we disprove an existing conjecture about those XOR-metrics. We consider implementations of multiplication with one fixed element in a binary finite field. Here we achieve a complete characterization of all elements whose multiplication matrix can be implemented using exactly 2 XOR-operations. Further, we provide new results and examples in more general cases, showing that significant improvements in implementations are possible.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- A minor revision of an IACR publication in EUROCRYPT 2019
- Keywords
- Lightweight cryptographyLinear layerXOR-countMultiplicationFinite fields
- Contact author(s)
- lukas koelsch @ uni-rostock de
- History
- 2019-03-06: revised
- 2019-02-28: received
- See all versions
- Short URL
- https://ia.cr/2019/229
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/229,
author = {Lukas Kölsch},
title = {{XOR}-counts and lightweight multiplication with fixed elements in binary finite fields},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/229},
year = {2019},
url = {https://eprint.iacr.org/2019/229}
}
