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 parallelization to vectorization, we thus prove the quantum equivalence of both problems.
|Number of pages||4|
|Journal||IACR Cryptology ePrint Archive|
|Publication status||Published - 2018|