Cryptanalysis of Andrecut's public key cryptosystem

TL;DR

This paper demonstrates that a linear decomposition attack can successfully break Andrecut's public key cryptosystem by recovering the secret key using algebraic methods.

Contribution

It introduces a linear decomposition attack based on algebraic decomposition techniques to cryptanalyze Andrecut's protocol.

Findings

The attack effectively recovers the secret key.

The method applies algebraic decomposition to break the cryptosystem.

It highlights vulnerabilities in Andrecut's scheme.

Abstract

We show that a linear decomposition attack based on the decomposition method introduced by the first author in monography "Algebraic cryptography" and in a series of papers works by finding the exchanging key in the Abdrecut's protocol.