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

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 extremely large applications (ranging from RFIDs and smart cards to mobile devices), the efficient implementation of cryptogra...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2018-12
Hauptverfasser:	Mesnager, Sihem, Kwang Ho Kim, Dujin Jo, Choe, Junyop, Han, Munhyon, Dok Nam Lee
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Cryptography Cybersecurity Electronic devices Lightweight Linear algebra Multiplication Optimization Smart cards Weight reduction
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!