Cryptology ePrint Archive: Report 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.

Category / Keywords: implementation / Lightweight cryptography, Linear layer, XOR-count, Multiplication, Finite fields

Original Publication (with minor differences): IACR-EUROCRYPT-2019

Date: received 26 Feb 2019, last revised 6 Mar 2019

Contact author: lukas koelsch at uni-rostock de

Available format(s): PDF | BibTeX Citation

Version: 20190306:120437 (All versions of this report)

Short URL: ia.cr/2019/229


[ Cryptology ePrint archive ]