preprints.org > computer science and mathematics > computational mathematics > doi: 10.20944/preprints202103.0716.v1

Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

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)

We introduce a novel key exchange protocol based on non-commutative matrix multiplication. The security of our method does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured. We claim that the unique opportunity for the eavesdropper to get the private key is by means of an exhaustive search which is equivalent to searching an unsorted database problem. Therefore, the algorithm becomes a promising candidate to be used in the quantum era to establish shared keys and achieve secret communication. Furthermore, to establish a 256-bit secret key the size of the public key only requires 256 bits while the private key occupies just 384 bits. Matrix multiplications can be done over a reduced 4-bit size modulo. Also, we show that in a generalized method, private numbers become indistinguishable and we discuss how to achieve Perfect Forward Secrecy (PFS). As a consequence, Lizama's protocol becomes a promising alternative for Internet-of-Things (IoT) computational devices in the quantum era.

Non-commutative; matrix; cryptography

Computer Science and Mathematics, Computational Mathematics

* All users must log in before leaving a comment