Povilas Tvarijonas

Learn More
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are used: the conjugator search problem (CSP) and modified discrete logarithm problem (DLP). The modified DLP in our approach is a matrix DLP and is different from that’s used in other(More)
The key agreement protocol (KAP) is constructed using matrix power functions. These functions are based on matrix ring action on some matrix set. Matrix power functions have some indications as being a oneway function since they are linked with certain generalized satisfiability problems which are potentially NPComplete. A working example of KAP with(More)
  • 1