A Subexponential Quantum Algorithm for the Semidirect Discrete Logarithm Problem
From MaRDI portal
Publication:6409905
arXiv2209.02814MaRDI QIDQ6409905FDOQ6409905
Authors: Christopher Battarbee, Delaram Kahrobaei, Ludovic Perret, Siamak F. Shahandashti 
Publication date: 6 September 2022
Abstract: Group-based cryptography is a relatively unexplored family in post-quantum cryptography, and the so-called Semidirect Discrete Logarithm Problem (SDLP) is one of its most central problems. However, the complexity of SDLP and its relationship to more well-known hardness problems, particularly with respect to its security against quantum adversaries, has not been well understood and was a significant open problem for researchers in this area. In this paper we give the first dedicated security analysis of SDLP. In particular, we provide a connection between SDLP and group actions, a context in which quantum subexponential algorithms are known to apply. We are therefore able to construct a subexponential quantum algorithm for solving SDLP, thereby classifying the complexity of SDLP and its relation to known computational problems.
Cryptography (94A60) Representation of semigroups; actions of semigroups on sets (20M30) Quantum cryptography (quantum-theoretic aspects) (81P94)
This page was built for publication: A Subexponential Quantum Algorithm for the Semidirect Discrete Logarithm Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409905)
