Abstract
Lightweight cryptography is an important tool for building strong security solutions for pervasive devices with limited resources. Due to the stringent cost constraints inherent in extremely large applications, 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 \(\mathbb {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 an XOR-count of two. 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.
Similar content being viewed by others
References
Beierle C., Kranz T., Leander G.: Lightweight multiplication in \(GF(2^n)\) with application to MDS matrices. In: Robshaw M., Katz J. (eds.) CRYPTO 2016, LNCS, vol. 9814, pp. 625–653. Springer, Heidelberg (2016).
Dummit D.S., Foote R.M.: Abstract Algebra. Wiley, Hoboken (2004).
Jean J., Peyrin T., Sim S.M., Tourteaux J.: Optimizing implementations of lightweight building blocks. In: IACR Transactions on Symmetric Cryptology, vol. 4, pp. 130–168. https://tosc.iacr.org/index.php/ToSC/article/view/806. Cryptology ePrint Archive 2017/101 https://eprint.iacr.org/2017/101 (2017).
Kölsch L.: XOR-counts and lightweight multiplication with fixed elements in binary finite fields. In: EUROCRYPT. https://eprint.iacr.org/2019/229.pdf (2019).
Paar C., Poschmann A., Kumar S., Eisenbarth T., Uhsadel L.: A survey of lightweight-cryptography implementations. IEEE Des. Test Comput. 24, 522–533 (2007).
Pawar S.V., Pattanshetti T.R.: Lightweight-cryptography: a survey. In: International Research Journal of Engineering and Technology (IRJET), vol. 05 (2018).
Sim S.M., Khoo K., Oggier F., Peyrin T.: Lightweight MDS involution matrices. In: Leander G. (ed.) FSE 2015, LNCS, vol. 9054, pp. 471–493. Springer, Heidelberg (2015).
Acknowledgements
The authors thank the Assoc. Edit. and the anonymous reviewers for their valuable comments which have highly improved the manuscript. The Beierle–Kranz–Leander conjecture has been proved independently by Lukas Kölsch in [4].
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by O. Ahmadi.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Mesnager, S., Kim, K.H., Jo, D. et al. A proof of the Beierle–Kranz–Leander conjecture related to lightweight multiplication in \(\mathbb {F}_{2^n}\). Des. Codes Cryptogr. 88, 51–62 (2020). https://doi.org/10.1007/s10623-019-00665-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-019-00665-2