Cryptanalysis of Andrecut's public key cryptosystem

2015/07/06 by В. А. Романьков, Vitaliǐ Roman'kov, Roman'kov, Vitaliǐ +2
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Mathematics #Group Theory (math.GR) #graph theory and CDMA systems #math.GR

paper · pdf · doi:10.48550/arxiv.1507.01496

arxiv created 2015/07/06 · openalex publication_date 2015/07/06 · arxiv updated 2015/07/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Linear decomposition attack on public key exchange protocols using semidirect products of (semi)groups
• A Matrix Public Key Cryptosystem

Related

• Linear decomposition attack on public key exchange protocols using semidirect products of (semi)groups
• Cryptanalysis of two schemes of Baba et al. by linear algebra methods
• A general encryption scheme using two-sided multiplications with its cryptanalysis
• A linear decomposition attack
• Code based Cryptography: Classic McEliece