DeepAI AI Chat
Log In Sign Up

Cryptanalysis of a System based on Twisted Dihedral Group Algebras

by   Simran Tinani, et al.

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 within their specific proposed platforms. A rigorous examination of the complexity of these algorithmic problems is therefore an important topic of research. In this paper, we present a cryptanalysis of a public key exchange system based on a decomposition-type problem in the so-called twisted group algebras of the dihedral group D_2n over a finite field . Our method of analysis relies on an algebraic reduction of the original problem to a set of equations over involving circulant matrices, and a subsequent solution to these equations. Our attack runs in polynomial time and succeeds with probability at least 90 percent for the parameter values provided by the authors. We also show that the underlying algorithmic problem, while based on a non-commutative structure, may be formulated as a commutative semigroup action problem.


page 1

page 2

page 3

page 4


A New Cryptosystem Based on Positive Braids

The braid group is an important non commutative group, at the same time,...

Cryptanalysis of Semidirect Product Key Exchange Using Matrices Over Non-Commutative Rings

It was recently demonstrated that the Matrix Action Key Exchange (MAKE) ...

Certifying Numerical Decompositions of Compact Group Representations

We present a performant and rigorous algorithm for certifying that a mat...

Quantum Equivalence of the DLP and CDHP for Group Actions

In this short note we give a polynomial-time quantum reduction from the ...

Complexity of Conjugacy Search in some Polycyclic and Matrix Groups

The most prominent algorithmic problem employed in the recently emerging...