Next Article in Journal
Constraining Forces Stabilizing Superconductivity in Bismuth
Previous Article in Journal
Diagonally Implicit Multistep Block Method of Order Four for Solving Fuzzy Differential Equations Using Seikkala Derivatives
Article Menu
Issue 2 (February) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(2), 43; doi:10.3390/sym10020043

Enhanced Matrix Power Function for Cryptographic Primitive Construction

Department of Applied Mathematics, Faculty of Mathematics and Natural Sciences, Kaunas University of Technology, Studentu Str. 50-324, LT-51368 Kaunas, Lithuania
Received: 29 December 2017 / Revised: 2 February 2018 / Accepted: 7 February 2018 / Published: 10 February 2018
View Full-Text   |   Download PDF [306 KB, uploaded 12 February 2018]

Abstract

A new enhanced matrix power function (MPF) is presented for the construction of cryptographic primitives. According to the definition in previously published papers, an MPF is an action of two matrices powering some base matrix on the left and right. The MPF inversion equations, corresponding to the MPF problem, are derived and have some structural similarity with classical multivariate quadratic (MQ) problem equations. Unlike the MQ problem, the MPF problem seems to be more complicated, since its equations are not defined over the field, but are represented as left–right action of two matrices defined over the infinite near-semiring on the matrix defined over the certain infinite, additive, noncommuting semigroup. The main results are the following: (1) the proposition of infinite, nonsymmetric, and noncommuting algebraic structures for the construction of the enhanced MPF, satisfying associativity conditions, which are necessary for cryptographic applications; (2) the proof that MPF inversion is polynomially equivalent to the solution of a certain kind of generalized multivariate quadratic (MQ) problem which can be reckoned as hard; (3) the estimation of the effectiveness of direct MPF value computation; and (4) the presentation of preliminary security analysis, the determination of the security parameter, and specification of its secure value. These results allow us to make a conjecture that enhanced MPF can be a candidate one-way function (OWF), since the effective (polynomial-time) inversion algorithm for it is not yet known. An example of the application of the proposed MPF for the Key Agreement Protocol (KAP) is presented. Since the direct MPF value is computed effectively, the proposed MPF is suitable for the realization of cryptographic protocols in devices with restricted computation resources. View Full-Text
Keywords: matrix power function (MPF); cryptography; key agreement protocol (KAP); conjectured one-way function (OWF) matrix power function (MPF); cryptography; key agreement protocol (KAP); conjectured one-way function (OWF)
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. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Sakalauskas, E. Enhanced Matrix Power Function for Cryptographic Primitive Construction. Symmetry 2018, 10, 43.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top