International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: XOR-Counts and Lightweight Multiplication with Fixed Elements in Binary Finite Fields

Authors:
Lukas Kölsch
Download:
DOI: 10.1007/978-3-030-17653-2_10
Search ePrint
Search Google
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 a conjecture from [10]. 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, confirming a conjecture from [2]. Further, we provide new results and examples in more general cases, showing that significant improvements in implementations are possible.
BibTeX
@article{eurocrypt-2019-29338,
  title={XOR-Counts and Lightweight Multiplication with Fixed Elements in Binary Finite Fields},
  booktitle={Advances in Cryptology – EUROCRYPT 2019},
  series={Advances in Cryptology – EUROCRYPT 2019},
  publisher={Springer},
  volume={11476},
  pages={285-312},
  doi={10.1007/978-3-030-17653-2_10},
  author={Lukas Kölsch},
  year=2019
}