Microprocessor Realization of Key Agreement Protocol based on Matrix Power Function

  • P. Vitkus Kaunas University of Technology
  • E. Sakalauskas Kaunas University of Technology
  • N. Listopadskis Kaunas University of Technology
  • R. Vitkiene Kaunas University of Technology


Key agreement protocol (KAP) using Burau braid groups representation and matrix power function (MPF) is presented. MPF is based on matrix semigroup action on some matrix set. All matrices are defined over finite field or ring. These functions pretend to be one-way functions since they are linked with multivariate quadratic (MQ) problems over some field. It is known that MQ problems are NP-complete over any field. We show that cryptanalysis of equations of our KAP is not less complex than those of MQ problem and moreover they seem far more complex. The one of advantages of proposed KAP is its effective realization in restricted computational environments by avoiding arithmetic operations with big integers. Bibl. 23, tabl. 2 (in English; abstracts in English and Lithuanian).

DOI: http://dx.doi.org/10.5755/j01.eee.117.1.1049