Paper 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.

Note: Former version not BibteXed. Title was truncated.

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. Unknown where it was published
Keywords
public key cryptographyword problemfinitely presented group
Contact author(s)
migonzalez @ escet urjc es
History
2004-01-23: revised
2004-01-21: received
See all versions
Short URL
https://ia.cr/2004/012
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/012,
      author = {Maria Isabel Gonzalez Vasco and Rainer Steinwandt},
      title = {Pitfalls in public key cryptosystems based on free partially commutative monoids and groups},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/012},
      year = {2004},
      url = {https://eprint.iacr.org/2004/012}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.