Attacking a public key cryptosystem based on tree replacement

Authors:
María Isabel González Vasco;David Pérez García
Affiliations:
Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain;Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 9
Cited 0

A public key cryptosystem based on the word problem

Proceedings of CRYPTO 84 on Advances in cryptology
A D0L-T0L public key cryptosystem

Information Processing Letters
A public key cryptosystem based on Lyndon words

Information Processing Letters
The complexity of Grigorchuk groups with application to cryptography

Theoretical Computer Science
Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Clouds over a public key cryptosystem based on Lydon words

Information Processing Letters
Tree Replacement and Public Key Cryptosystem

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
A Reaction Attack on a Public Key Cryptosystem Based on the Word Problem

Applicable Algebra in Engineering, Communication and Computing
Weak Keys in MST1

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.04

Visualization

Abstract

We point out several security flaws in the cryptosystem based on tree replacement systems proposed by Samuel, Thomas, Abisha and Subramanian at INDOCRYPT 2002. Due to the success of (among others) very simple ciphertext-only attacks, we evidence that this system does not, in its present form, offer acceptable security guarantees for cryptographic applications.