XOR-counts and lightweight multiplication with fixed elements in binary finite fields

DOI10.1007/978-3-030-17653-2_10zbMath1470.94093OpenAlexW2927143860MaRDI QIDQ2292647

Lukas Kölsch

Publication date: 4 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17653-2_10

zbMATH Keywords

finite fieldsmultiplicationlightweight cryptographylinear layerXOR-count

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices ⋮ Three input exclusive-or gate support for Boyar-Peralta's algorithm ⋮ Recursive MDS matrices over finite commutative rings ⋮ A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in \(\mathbb{F}_{2^n} \) ⋮ Construction of MDS matrices from generalized Feistel structures ⋮ Construction of lightweight involutory MDS matrices

This page was built for publication: XOR-counts and lightweight multiplication with fixed elements in binary finite fields