|
Organizers |
Using the subgroup membership search problem in public key cryptography
by
Vladimir Shpilrain
The City College of New York
Coauthors: Gabriel Zapata (CUNY Graduate Center)
Most public key protocols based on nonabelian groups use the computational difficulty of either the conjugacy search problem or the word (search) problem. In this talk, we describe a cryptosystem whose security is based on the computational difficulty of the subgroup membership (search) problem: given a group G, a subgroup H generated by h1, ..., hk, and an element h Î H, find an expression of h in terms of h1, ..., hk.
Date received: March 17, 2005
Copyright © 2005 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caqi-53.