arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1812.09666cs.ITcs.CRmath.IT
收藏

关于$\mathds{F}_{2^n}$中轻量级乘法的Beierle-Kranz-Leander猜想的证明

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

Sihem Mesnager, Kwang Ho Kim, Dujin Jo, Junyop Choe, Munhyon Han, Dok Nam Lee

摘要:

轻量级加密是为资源有限的普及设备构建强大安全解决方案的关键工具。由于在非常大的应用(从RFID和灵巧卡到移动设备)中固有的严格的成本约束,密码硬件和软件算法的有效实现对于实现广义计算的愿景至关重要。在2016年,Beierle、Kranz和Leander在$\mathds{F}_{2^n}$中考虑了轻量级乘法。具体来说,他们考虑了优化有限域乘法与一个固定元素的基本问题,并研究了该领域的代表性,即选择的基础,允许最佳的实施。他们留下了一个与两个XOR计数有关的猜想。本文利用线性代数理论证明了他们的猜想是正确的。因此,证明的猜想可以作为进一步开发和实现轻量级设备上的密码算法的参考。

英文摘要:

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 $\mathds{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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑