most citedA Proof of the Beierle-Kranz-Leander Conjecture related to Lightweight Multiplication in $\mathds{F}_{2^n}$

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.IT2018★ 1 cited

A Proof of the Beierle-Kranz-Leander Conjecture related to Lightweight Multiplication in $\mathds{F}_{2^n}$

Sihem Mesnager, Kwang Ho Kim, Dujin Jo +3

Lightweight cryptography is a key tool for building strong security solutions for pervasive devices with limited resources. Due to the stringent cost constraints inherent in extrem…