A general encryption scheme using two-sided multiplications with its cryptanalysis

TL;DR

This paper introduces a general encryption scheme based on two-sided multiplications and demonstrates that many existing schemes are special cases, revealing their vulnerability to a linear decomposition cryptanalysis method.

Contribution

The paper presents a universal cryptanalysis method that can break a broad class of two-sided multiplication-based encryption schemes, exposing their inherent vulnerabilities.

Findings

Many known schemes are special cases of the general scheme.

The linear decomposition method can break these schemes without private data.

The method is applicable to the general scheme, showing its universality.

Abstract

We show that many known schemes of the public key exchange protocols in the algebraic cryptography, that use two-sided multiplications, are the specific cases of the general scheme of such type. In most cases, such schemes are built on platforms that are subsets of the linear spaces. They have been repeatedly compromised by the linear decomposition method introduced by the first author. The method allows to compute the exchanged keys without computing the private data and therefore without solving the algorithmic problems on which the assumptions are based. We demonstrate that this method can be successfully applied to the general scheme, thus it is in some sense universal.