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
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
