By the same authors

From the same journal

The Hidden Subgroup Problem and Post-quantum Group-based Cryptography

Research output: Contribution to journalArticle

Author(s)

Department/unit(s)

Publication details

JournalLecture Notes in Computer Science
DatePublished - 10 May 2018
Original languageUndefined/Unknown

Abstract

In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum group-based cryptography. We review the relationship between HSP and other computational problems discuss an optimal solution method, and review the known results about the quantum complexity of HSP. We also overview some platforms for group-based cryptosystems. Notably, efficient algorithms for solving HSP in such infinite group platforms are not yet known.

    Research areas

  • cs.CR, cs.CC, math.GR, quant-ph

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations