Using the Subgroup Membership Search Problem in Public Key Cryptography

Abstract

There are several public key protocols around that use the computational hardness of either the conjugacy search problem or the word (search) problem for nonabelian groups. In this paper, we describe a cryptosystem whose security is based on the computational hardness of the subgroup membership (search) problem: given a group G, a subgroup H generated by h1… (More)

Topics

Statistics

0204060201520162017
Citations per Year

Citation Velocity: 13

Averaging 13 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Shpilrain2005UsingTS, title={Using the Subgroup Membership Search Problem in Public Key Cryptography}, author={Vladimir Shpilrain and Gabriel Zapata}, year={2005} }