Key agreement protocol in infinite semigroup representation level

Artūras Katvickis; Eligijus  Sakalauskas; Kastytis Ratkevičius

doi:10.15388/LMR.2007.19915

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.

Download Citation

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

Downloads

Download data is not yet available.

Most read articles by the same author(s)

Paulius Vitkus, Eligijus Sakalauskas, Security analysis of key agreement protocol based on matrix power function , Lietuvos matematikos rinkinys: Vol. 53 (2012): Ser. A
Aleksėjus Mihalkovič, Eligijus Sakalauskas, Asymmetric cipher based on MPF and its security parameters evaluation , Lietuvos matematikos rinkinys: Vol. 53 (2012): Ser. A
Aleksejus Mihalkovich, Eligijus Sakalauskas, On the security of RSA textbook signature scheme on Paillier ciphertext , Lietuvos matematikos rinkinys: Vol. 57 (2016): Ser. A
Povilas Tvarijonas, Eligijus Sakalauskas, Gediminas Simonas Dosinas, Key agreement protocol in Braid group representation level , Lietuvos matematikos rinkinys: Vol. 47 (2007)
Povilas Tvarijonas, Gediminas Simonas Dosinas, Eligijus Sakalauskas, Discrete logarithm problem in matrix , Lietuvos matematikos rinkinys: Vol. 46 (2006)