Quantum Equivalence of the DLP and CDHP for Group Actions
Cryptography and Security
2021-07-27 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1812.09116,
title = {Quantum Equivalence of the DLP and CDHP for Group Actions},
author = {Steven Galbraith and Lorenz Panny and Benjamin Smith and Frederik Vercauteren},
journal= {arXiv preprint arXiv:1812.09116},
year = {2021}
}