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

Thumbnail Image
Identifiers
URI: https://hdl.handle.net/10016/37411
ISSN: 0893-9659
DOI: https://doi.org/10.1016/j.aml.2005.11.014
UXXI: AR/0000032353
Files
Pitfalls_AML_2006_ps.pdf (456.53 KB)
Publication date
2006-10
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
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.
Description
Keywords
Finitely presented group, Public key cryptography, Word problem
Bibliographic citation
González Vasco, M. I., & Steinwandt, R. (2006). Pitfalls in public key cryptosystems based on free partially commutative monoids and groups. Applied Mathematics Letters, 19(10), 1037-1041.
Collections
DM - Artículos de Revistas