Quantum Equivalence of the DLP and CDHP for Group Actions.

IACR Cryptology ePrint Archive(2018)

引用 23|浏览83
暂无评分
摘要
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.
更多
查看译文
关键词
quantum equivalence,dlp,cdhp,actions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要