Quantum equivalence of the DLP and CDHP for group actions

Steven Galbraith, Lorenz Panny, Benjamin Smith, Frederik Vercauteren

Research output: Contribution to journalArticleAcademic

22 Downloads (Pure)


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.
Original languageEnglish
Number of pages4
JournalIACR Cryptology ePrint Archive
Issue number2018/1199
Publication statusPublished - 2018


Dive into the research topics of 'Quantum equivalence of the DLP and CDHP for group actions'. Together they form a unique fingerprint.

Cite this