CryptoDB
Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
Authors: | |
---|---|
Download: | |
Abstract: | At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both proposals are vulnerable to chosen ciphertext attacks, and thus in the present form must be considered as insecure. |
BibTeX
@misc{eprint-2004-11988, title={Pitfalls in public key cryptosystems based on free partially commutative monoids and groups}, booktitle={IACR Eprint archive}, keywords={public key cryptography, word problem, finitely presented group}, url={http://eprint.iacr.org/2004/012}, note={ migonzalez@escet.urjc.es 12440 received 19 Jan 2004, last revised 22 Jan 2004}, author={Maria Isabel Gonzalez Vasco and Rainer Steinwandt}, year=2004 }