Quantum algorithm for discrete logarithm problem for matrices over finite group rings

DOI10.1515/gcc-2014-0003zbMath1336.94067OpenAlexW2036619496MaRDI QIDQ2249565

Alexander Ushakov, Alexey D. Myasnikov

Publication date: 2 July 2014

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc-2014-0003

zbMATH Keywords

quantum algorithmsgroup ringsdiscrete logarithm problemkey-exchangesemidirect productDiffie-Hellmangroup-based cryptographypost-quantum cryptographymatrix monoids

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (7)

A reduction of semigroup DLP to classic DLP ⋮ Enhanced matrix power function for cryptographic primitive construction ⋮ Application of group ring algebra to localized and delocalized quantum states in periodic potentials ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r)\)] ⋮ Improved cryptanalysis of a ElGamal cryptosystem based on matrices over group rings ⋮ Cryptanalysis of Some Protocols Using Matrices over Group Rings

This page was built for publication: Quantum algorithm for discrete logarithm problem for matrices over finite group rings