Cryptology ePrint Archive: Report 2004/012

Pitfalls in public key cryptosystems based on free partially commutative monoids and groups

Maria Isabel Gonzalez Vasco and Rainer Steinwandt

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.

Category / Keywords: public key cryptography, word problem, finitely presented group

Date: received 19 Jan 2004, last revised 22 Jan 2004

Contact author: migonzalez at escet urjc es

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: Former version not BibteXed. Title was truncated.

Version: 20040123:075640 (All versions of this report)

Short URL: ia.cr/2004/012

Discussion forum: Show discussion | Start new discussion