scholarly journals Security analysis of key agreement protocol based on matrix power function

2012 ◽  
Vol 53 ◽  
Author(s):  
Paulius Vitkus ◽  
Eligijus Sakalauskas
Keyword(s):  
Power Function ◽  
Key Agreement ◽  
Security Analysis ◽  
Braid Groups ◽  
Quadratic Problem ◽  
Key Agreement Protocol ◽  
Np Complete ◽  
Matrix Power ◽  
The One ◽  
One Way Function

Key agreement protocol (KAP) using Burau braid groups representation and matrix power function (MPF) is analyzed. MPF arguments are Burau representation matrices defined over finite field or ring. It is shown that KAP security relies on the solution of matrix multivariate quadratic system of equations over the ring with additional commutation constraints for matrices to be found. We are making a conjecture that proposed KAP is a candidate one-way function since its inversion is related with the solution of known multivariate quadratic problem which is NP-complete over any field. The one of advantages of proposed KAP is its possible effective realization even in restricted computational environments by avoiding arithmetic operations with big integers.

scholarly journals MPF Problem over Modified Medial Semigroup Is NP-Complete

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 571 ◽  
Author(s):  
Eligijus Sakalauskas ◽  
Aleksejus Mihalkovich
Keyword(s):  
Power Function ◽  
Polynomial Time ◽  
Cryptographic Protocols ◽  
Binary Field ◽  
Dual Interpretation ◽  
Np Complete ◽  
Matrix Power ◽  
Necessary Constraints ◽  
One Way Function ◽  
Polynomial Time Reduction

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 multivariate quadratic (MQ) problem defined over the binary field as a system of MQ equations, and as a general satisfiability (GSAT) problem. Due to this interpretation the necessary constraints to MPF function for cryptographic protocols construction can be added to initial GSAT problem. Then it is proved that obtained GSAT problem is NP-Complete using Schaefer dichotomy theorem. Referencing to this result, GSAT problem by polynomial-time reduction is reduced to the sub-problem of enhanced MPF, hence the latter is NP-Complete as well.

scholarly journals Key agreement protocol in Braid group representation level

2021 ◽  
Vol 47 ◽  
Author(s):  
Povilas Tvarijonas ◽  
Eligijus Sakalauskas ◽  
Gediminas Simonas Dosinas
Keyword(s):  
Braid Group ◽  
Key Agreement ◽  
Group Representation ◽  
Braid Groups ◽  
Key Agreement Protocol ◽  
The One ◽  
Representation Level

In this paper the key agreement protocol is given and the applicationof it in Braid groups is suggested. The one way of protocol is being justified.

scholarly journals Microprocessor Realization of Key Agreement Protocol based on Matrix Power Function

2012 ◽  
Vol 117 (1) ◽  
Author(s):  
P. Vitkus ◽  
E. Sakalauskas ◽  
N. Listopadskis ◽  
R. Vitkiene
Keyword(s):  
Power Function ◽  
Key Agreement ◽  
Key Agreement Protocol ◽  
Matrix Power

scholarly journals Sigma Identification Protocol Construction Based on MPF

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1683
Author(s):  
Eligijus Sakalauskas ◽  
Inga Timofejeva ◽  
Ausrys Kilciauskas
Keyword(s):  
Power Function ◽  
Security Proof ◽  
Np Complete ◽  
Matrix Power ◽  
One Way Function ◽  
Near Semiring

A new sigma identification protocol (SIP) based on matrix power function (MPF) defined over the modified medial platform semigroup and power near-semiring is proposed. It is proved that MPF SIP is resistant against direct and eavesdropping attacks. Our security proof relies on the assumption that MPF defined in the paper is a candidate for one-way function (OWF). Therefore, the corresponding MPF problem is reckoned to be a difficult one. This conjecture is based on the results demonstrated in our previous studies, where a certain kind of MPF problem was proven to be NP-complete.

Two-party quantum key agreement protocol with four-particle entangled states

2016 ◽  
Vol 30 (26) ◽  
pp. 1650332 ◽  
Author(s):  
Yefeng He ◽  
Wenping Ma
Keyword(s):  
Key Agreement ◽  
Security Analysis ◽  
Information Leakage ◽  
Quantum States ◽  
Entangled States ◽  
Correlation Property ◽  
Quantum Key Agreement ◽  
Key Agreement Protocol ◽  
Delayed Measurement ◽  
Quantum Key Agreement Protocol

Based on four-particle entangled states and the delayed measurement technique, a two-party quantum key agreement protocol is proposed in this paper. In the protocol, two participants can deduce the measurement results of each other’s initial quantum states in terms of the measurement correlation property of four-particle entangled states. According to the corresponding initial quantum states deduced by themselves, two parties can extract the secret keys of each other by using the publicly announced value or by performing the delayed measurement, respectively. This guarantees the fair establishment of a shared key. Since each particle in quantum channel is transmitted only once, the protocol is congenitally free from the Trojan horse attacks. The security analysis shows that the protocol not only can resist against both participant and outsider attacks but also has no information leakage problem. Moreover, it has high qubit efficiency.

scholarly journals Security Analysis of a Lightweight Identity-Based Two-Party Authenticated Key Agreement Protocol for IIoT Environments

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Yuting Li ◽  
Qingfeng Cheng ◽  
Wenbo Shi
Keyword(s):  
Internet Of Things ◽  
Social Life ◽  
Key Agreement ◽  
Security Analysis ◽  
Impersonation Attack ◽  
Industrial Internet Of Things ◽  
Authenticated Key Agreement ◽  
Key Agreement Protocol ◽  
Industrial Internet ◽  
Identity Based

Internet of Things brings convenience to the social life, at the same time, putting forward higher requirements for the security of data transmission and storage. Security incidents based on industrial Internet of Things have occurred frequently recently, which should be given full consideration. The identity-based authenticated key agreement protocol can solve these security threats to a certain extent. Recently, a lightweight identity-based authenticated key agreement protocol for Industrial Internet of Things, called ID-2PAKA protocol, was claimed to achieve secure authentication and meet security properties. In this paper, we show that the ID-2PAKA protocol is insecure in identity authentication and cannot resisting ephemeral key compromise impersonation attack.

Sign in / Sign up

Export Citation Format

Share Document