Copyright © 2005 Elsevier Ltd All rights reserved.
Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
Received 9 April 2004;
revised 29 November 2005;
accepted 29 November 2005.
Available online 18 January 2006.
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.
Keywords: Word problem; Finitely presented group; Public key cryptography






E-mail Article
Add to my Quick Links

Cited By in Scopus (1)







