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

05/10/2018
by   Kelsey Horan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2022

A Subexponential Quantum Algorithm for the Semidirect Discrete Logarithm Problem

Group-based cryptography is a relatively young family in post-quantum cr...
research
08/31/2023

Efficient Additions and Montgomery Reductions of Large Integers for SIMD

This paper presents efficient algorithms, designed to leverage SIMD for ...
research
10/23/2017

Learning With Errors and Extrapolated Dihedral Cosets

The hardness of the learning with errors (LWE) problem is one of the mos...
research
03/07/2023

The special case of cyclotomic fields in quantum algorithms for unit groups

Unit group computations are a cryptographic primitive for which one has ...
research
08/28/2023

Applications of Finite non-Abelian Simple Groups to Cryptography in the Quantum Era

The theory of finite simple groups is a (rather unexplored) area likely ...
research
02/11/2022

Group-based Cryptography in the Quantum Era

In this expository article we present an overview of the current state-o...
research
04/25/2023

SPDH-Sign: towards Efficient, Post-quantum Group-based Signatures

In this paper, we present a new diverse class of post-quantum group-base...

Please sign up or login with your details

Forgot password? Click here to reset