Article
Version 2
Preserved in Portico This version is not peer-reviewed
Non-Commutative Key Exchange Protocol
Version 1
: Received: 30 March 2021 / Approved: 30 March 2021 / Online: 30 March 2021 (09:35:46 CEST)
Version 2 : Received: 18 March 2022 / Approved: 23 March 2022 / Online: 23 March 2022 (11:08:28 CET)
Version 2 : Received: 18 March 2022 / Approved: 23 March 2022 / Online: 23 March 2022 (11:08:28 CET)
How to cite: Lizama-Pérez, L.A.; Romero, J.M.L. Non-Commutative Key Exchange Protocol. Preprints 2021, 2021030716. https://doi.org/10.20944/preprints202103.0716.v2 Lizama-Pérez, L.A.; Romero, J.M.L. Non-Commutative Key Exchange Protocol. Preprints 2021, 2021030716. https://doi.org/10.20944/preprints202103.0716.v2
Abstract
We introduce a novel key exchange protocol based on non-commutative matrix multiplication defined in $\mathbb{F}_p^{n \times n}$. The security of our method does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured. We show that the public, secret and channel keys become indistinguishable to the eavesdropper under matrix multiplication. Remarkably, for achieving a 512-bit security level, the public key is 1024 bits and the private key is 768 bits, making them the smallest keys among post-quantum key exchange algorithms. Also, we discuss how to achieve key authentication, interdomain certification and Perfect Forward Secrecy (PFS). Therefore, Lizama's algorithm becomes a promising candidate to establish shared keys and secret communication between (IoT) devices in the quantum era.
Keywords
Non-commutative; matrix; cryptography
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
