CRDec 21, 2018
Quantum Equivalence of the DLP and CDHP for Group Actions
arXiv:1812.09116v223 citations
Originality Incremental advance
AI Analysis
This work addresses a foundational problem in quantum cryptography for researchers in the field, though it appears incremental as it builds on known reductions.
The authors tackled the equivalence of two computational problems (DLP and CDHP) in group actions by providing a polynomial-time quantum reduction from vectorization to parallelization, proving their quantum equivalence.
In this short note we give a polynomial-time quantum reduction from the vectorization problem (DLP) to the parallelization problem (CDHP) for group actions. Combined with the trivial reduction from par-allelization to vectorization, we thus prove the quantum equivalence of both problems.