Related papers: Cryptanalysis of two schemes of Baba et al. by lin…

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.

We show that a linear decomposition attack based on the decomposition method introduced by the author works by finding the exchanged secret keys in all main protocols using semidirect products of (semi)grops proposed by Kahrobaei,…

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…

We propose new provable practical deterministic polynomial time algorithm for the braid Wang, Xu, Li, Lin and Wang Double shielded public key cryptosystems. We show that a linear decomposition attack based on the decomposition method…

We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm that recovers the secret shared key from the public data in…

We examine two public key exchange protocols proposed recently by Grigoriev and Shpilrain (arXiv:1811.06386), which use tropical algebra. We introduce a fast attack on the first protocol, and we show that the second protocol cannot be…

In this paper, we will present a new key exchange cryptosystem based on linear algebra, which take less operations but weaker in security than Diffie-Hellman's one.

Several cryptographic protocols constructed based on less-known algorithmic problems, such as those in non-commutative groups, group rings, semigroups, etc., which claim quantum security, have been broken through classical reduction methods…

Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks using Shor polynomial time algorithm for numerical field problems or Grover search algorithm. A mostly overlooked but valuable line of solutions…

The Algebraic Eraser (AE) is a public key protocol for sharing information over an insecure channel using commutative and noncommutative groups; a concrete realization is given by Colored Burau Key Agreement Protocol (CBKAP). In this paper,…

Recently, an image encryption algorithm based on scrambling and Vegin`ere cipher has been proposed. However, it was soon cryptanalyzed by Zhang et al. using a combination of chosen-plaintext attack and differential attack. This paper…

This paper presents a key recovery attack on the cryptosystem proposed by Lau and Tan in a talk at ACISP 2018. The Lau-Tan cryptosystem uses Gabidulin codes as the underlying decodable code. To hide the algebraic structure of Gabidulin…

Process algebras have been widely used to verify security protocols in a formal manner. However they mostly focus on synchronous communication based on the exchange of messages. We present an alternative approach relying on asynchronous…

We show that an attack based on the linear decomposition method introduced by the author can be efficiently applied to the new version of the MOR scheme proposed in \cite{BMSS}. We draw attention to some inaccuracies in the description of…

The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Although several signcryption schemes are proposed over the years,…

In 2010, Grigoriev and Shpilrain, introduced some graph-based authentication schemes. We present a cryptanalysis of some of these protocols, and introduce some new schemes to fix the problems.

Recently, an image encryption algorithm using block-based scrambling and image filtering has been proposed by Hua et al. In this paper, we analyze the security problems of the encryption algorithm in detail and break the encryption by a…

We cryptanalyse a matrix-based key transport protocol due to Baumslag, Camps, Fine, Rosenberger and Xu from 2006. We also cryptanalyse two recently proposed matrix-based key agreement protocols, due to Habeeb, Kahrobaei and Shpilrain, and…

A novel original procedure of encryption/decryption based on the polyadic algebraic structures and on signal processing methods is proposed. First, we use signals with integer amplitudes to send information. Then we use polyadic techniques…

We analyze the security of a quantum secure direct communication protocol equipped with authentication. We first propose a specifc attack on the protocol by which, an adversary can break the secret already shared between Alice and Bob, when…