Key Exchange Protocol Defined over a Non-Commuting Group Based on an NP-Complete Decisional Problem

Symmetry

Aleksejus Mihalkovich¹  Kestutis Luksys¹  Eligijus Sakalauskas¹ 

[1] Department of Applied Mathematics, Kaunas University of Technology, Studentu str. 50-324, 44249 Kaunas, Lithuania;

关键词: non-commuting cryptography;    matrix power function;    key exchange protocol;    cryptographic security;   

DOI  :  10.3390/sym12091389

来源: DOAJ

【 摘 要 】

In this paper we present a cryptographic primitive based on non-commutative cryptography. This primitive is used for key exchange protocol (KEP) construction. We prove that the security of this primitive relies on a nondeterministic polynomial complete (NP-Complete) decisional problem. Recently there are no known quantum cryptanalysis algorithms effectively solving NP-Complete problems. So far, KEPs are widely used in secure communication channel creation, e.g., in hypertext transfer protocol secure (https://) and are based on traditional cryptographic primitives representing commutative cryptography. However, the security of these protocols does not rely on NP-Complete problems and hence, according to P. W. Shorr, they are vulnerable to quantum cryptanalysis. We use one of seven non-commuting groups of order 16 which is not isomorphic to any other group to define a platform group for a key exchange protocol based on previously considered matrix power function (MPF). By investigating basic properties on the group ${\mathbf{M}}_{16}$ and their implementation for our goals we fix the order of actions in MPF from left to right. Furthermore, we define a special form of the base matrix and separate templates for left and right power matrices. Using properties of the specified templates and Schaeffer criteria we prove that the security of the proposed key exchange relies on an NP-Complete decisional problem.

【 授权许可】

Unknown