Attacking a public key cryptosystem based on tree replacement

DOI10.1016/J.DAM.2006.05.009zbMath1106.94022OpenAlexW2045841743MaRDI QIDQ858300

María Isabel González Vasco, David Pérez-García

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.05.009

zbMATH Keywords

cryptanalysispublic key cryptosystemstree replacement systems

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• A public key cryptosystem based on Lyndon words
• Reductions in tree replacement systems
• A D0L-T0L public key cryptosystem
• The complexity of Grigorchuk groups with application to cryptography
• Clouds over a public key cryptosystem based on Lyndon words
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• A reaction attack on a public key cryptosystem based on the word problem
• Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
• Weak keys in MST\(_{1}\)
• Progress in Cryptology - INDOCRYPT 2003
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Attacking a public key cryptosystem based on tree replacement