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

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

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 ther...

Full description

Bibliographic Details
Main Authors: Aleksejus Mihalkovich, Eligijus Sakalauskas, Kestutis Luksys
Format: Article
Language:English
Published: MDPI AG 2020-08-01
Series:Symmetry
Subjects:
non-commuting cryptography
matrix power function
key exchange protocol
cryptographic security
Online Access:https://www.mdpi.com/2073-8994/12/9/1389

Internet

https://www.mdpi.com/2073-8994/12/9/1389

Similar Items