Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups

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.

• Type: Conference
• Year: 2003
• Where: INDOCRYPT
• Authors: P. J. Abisha, D. G. Thomas, K. G. Subramanian
• Keywords: Commutative Monoids, INDOCRYPT 2003, Indocrypt 2003 Abisha, Public Key Schemes