Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1710677 | Applied Mathematics Letters | 2006 | 5 Pages |
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
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
María Isabel González Vasco, Rainer Steinwandt,