Security analysis of key agreement protocol based on matrix power function
Paulius Vitkus
Kaunas University of Technology
Eligijus Sakalauskas
Kaunas University of Technology
Published 2012-12-15


key agreement protocol
multivariate quadratic problem
one-way function

How to Cite

Vitkus P. and Sakalauskas E. (2012) “Security analysis of key agreement protocol based on matrix power function”, Lietuvos matematikos rinkinys, 53(A), pp. 135–140. doi: 10.15388/LMR.A.2012.24.


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.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy