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

DOI10.1007/978-3-030-17653-2_10MaRDI QIDQ2292647zbMATH OpenOpenAlexFDO

Authors 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 fieldslightweight cryptographylinear layermultiplicationXOR-count

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Lightweight multiplication in \(\mathrm{GF}(2^n)\) with applications to MDS matrices
• A deeper understanding of the XOR count distribution in the context of lightweight cryptography
• A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in \(\mathbb{F}_{2^n} \)
• On multiplication in finite fields
• Implementing fast carryless multiplication

Cited in

(11)

• Construction of MDS matrices from generalized Feistel structures
• Construction of lightweight involutory MDS matrices
• Recursive MDS matrices over finite commutative rings
• A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in \(\mathbb{F}_{2^n} \)
• A deeper understanding of the XOR count distribution in the context of lightweight cryptography
• Three input exclusive-or gate support for Boyar-Peralta's algorithm
• Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count
• On the construction of near-MDS matrices
• Circulant, circulant-like and orthogonal MDS generalized Cauchy matrices
• On the construction of ultra-light MDS matrices
• Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292647)