Key Agreement Protocol (KAP) Based on Matrix Power Function

Abstract

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 one- way function since they are linked with certain generalized satisfiability problems which are potentially NP- Complete. A working example of KAP with guaranteed brute force attack prevention is presented for certain algebraic structures. The main advantage of proposed KAP is considerable fast computations and avoidance of arithmetic operations with long integers.