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

Kelsey Horan; Delaram Kahrobaei

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

Computer Science

Research output: Contribution to journal › Article › peer-review

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.

Original language	Undefined/Unknown
Journal	Lecture Notes in Computer Science
Publication status	Published - 10 May 2018

Keywords

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

Cite this

@article{88a33352a17e455b9ac3c00acb5ebcd1,

title = "The Hidden Subgroup Problem and Post-quantum Group-based Cryptography",

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. ",

keywords = "cs.CR, cs.CC, math.GR, quant-ph",

author = "Kelsey Horan and Delaram Kahrobaei",

year = "2018",

month = may,

day = "10",

language = "Undefined/Unknown",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer",

}

TY - JOUR

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

AU - Horan, Kelsey

AU - Kahrobaei, Delaram

PY - 2018/5/10

Y1 - 2018/5/10

N2 - 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.

AB - 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.

KW - cs.CR

KW - cs.CC

KW - math.GR

KW - quant-ph

M3 - Article

SN - 0302-9743

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -