A Proof of the Beierle-Kranz-Leander Conjecture related to Lightweight Multiplication in F_2^n

12/23/2018
by   Sihem Mesnager, et al.
0

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 cryptographic hardware and software algorithms is of utmost importance to realize the vision of generalized computing. In CRYPTO 2016, Beierle, Kranz and Leander have considered lightweight multiplication in F_2^n. Specifically, they have considered the fundamental question of optimizing finite field multiplications with one fixed element and investigated which field representation, that is which choice of basis, allows for an optimal implementation. They have left open a conjecture related to two XOR-count. Using the theory of linear algebra, we prove in the present paper that their conjecture is correct. Consequently, this proved conjecture can be used as a reference for further developing and implementing cryptography algorithms in lightweight devices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2019

An overview of memristive cryptography

Smaller, smarter and faster edge devices in the Internet of things era d...
research
12/12/2022

A Taxonomy and Review of Lightweight Blockchain Solutions for Internet of Things Networks

Internet of things networks have spread to most digital applications in ...
research
06/24/2020

Lightweight Cryptography for IoT: A State-of-the-Art

With the emergence of 5G, Internet of Things (IoT) has become a center o...
research
04/17/2018

Towards Lightweight Error Detection Schemes for Implementations of MixColumns in Lightweight Cryptography

In this paper, through considering lightweight cryptography, we present ...
research
06/29/2021

Electromagnetic Analysis of an Ultra-Lightweight Cipher: PRESENT

Side-channel attacks are an unpredictable risk factor in cryptography. T...
research
08/27/2021

Pairing for Greenhorn: Survey and Future Perspective

Pairing is the most powerful tool in cryptography that maps two points o...

Please sign up or login with your details

Forgot password? Click here to reset