Key agreement protocol in infinite semigroup representation level
Articles
Artūras Katvickis
Kaunas University of Technology
Eligijus Sakalauskas
Kaunas University of Technology
Kastytis Ratkevičius
Kaunas University of Technology
Published 2007-12-20
https://doi.org/10.15388/LMR.2007.19915
PDF

Keywords

key agreement protocol
representation level
Braid group

How to Cite

Katvickis A., Sakalauskas E. and Ratkevičius K. (2007) “Key agreement protocol in infinite semigroup representation level”, Lietuvos matematikos rinkinys, 47(spec.), pp. 168–172. doi: 10.15388/LMR.2007.19915.

Abstract

Matrix decomposition problem over integer ring is presented. Solving methods are discussed and it is showed, that this problem is hard computational problem regard to computer memory resources. A key agreement protocol based on matrix decomposition problem is presented.

PDF
Creative Commons License

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

Please read the Copyright Notice in Journal Policy