Improved Asymmetric Cipher Based on Matrix Power Function Resistant to Linear Algebra Attack

Abstract

In this paper we consider an improved version of earlier published asymmetric encryption protocol based on matrix power function (MPF). Recently, a linear algebra attack on earlier version of this protocol was found. This attack allows an attacker to break suggested protocol in polynomial time.

Here we show that the improved version of our encryption protocol is not vulnerable to the declared linear attack, while retaining its effective realization in embedded systems.