MPF Problem over Modified Medial Semigroup Is NP-Complete
This paper is a continuation of our previous publication of enhanced matrix power function (MPF) as a conjectured one-way function. We are considering a problem introduced in our previous paper and prove that tis problem is NP-Complete. The proof is based on the dual interpretation of well known mul...
Main Authors: | Eligijus Sakalauskas, Aleksejus Mihalkovich |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-11-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/10/11/571 |
Similar Items
-
Key Exchange Protocol Defined over a Non-Commuting Group Based on an NP-Complete Decisional Problem
by: Aleksejus Mihalkovich, et al.
Published: (2020-08-01) -
Sigma Identification Protocol Construction Based on MPF Defined over Non-Commuting Platform Group
by: Aleksejus Mihalkovich, et al.
Published: (2022-07-01) -
Counter Mode of the Shannon Block Cipher Based on MPF Defined over a Non-Commuting Group
by: Aleksejus Mihalkovich, et al.
Published: (2022-09-01) -
Enhanced Matrix Power Function for Cryptographic Primitive Construction
by: Eligijus Sakalauskas
Published: (2018-02-01) -
On the associativity property of MPF over M16
by: Aleksejus Mihalkovich
Published: (2018-12-01)