Microprocessor Realization of Key Agreement Protocol based on Matrix Power Function

Authors

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

DOI:

https://doi.org/10.5755/j01.eee.117.1.1049

Abstract

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

Downloads

Published

2012-01-11

How to Cite

Vitkus, P., Sakalauskas, E., Listopadskis, N., & Vitkiene, R. (2012). Microprocessor Realization of Key Agreement Protocol based on Matrix Power Function. Elektronika Ir Elektrotechnika, 117(1), 33-36. https://doi.org/10.5755/j01.eee.117.1.1049

Issue

Vol. 117 No. 1 (2012)

Section

SYSTEM ENGINEERING, COMPUTER TECHNOLOGY

License

The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.

By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.