Attacking a public key cryptosystem based on tree replacement

DOI10.1016/J.DAM.2006.05.009MaRDI QIDQ858300zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1618049
• scientific article; zbMATH DE number 3733818
• Publication:4945380
• On a public-key cryptosystem based on iterated morphisms and substitutions
• Pitfalls in public key cryptosystems based on free partially commutative monoids and groups

Cites work

• scientific article; zbMATH DE number 3910294 (Why is no real title available?)
• scientific article; zbMATH DE number 1955783 (Why is no real title available?)
• A D0L-T0L public key cryptosystem
• A public key cryptosystem based on Lyndon words
• A reaction attack on a public key cryptosystem based on the word problem
• 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
• Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
• Progress in Cryptology - INDOCRYPT 2003
• Reductions in tree replacement systems
• The complexity of Grigorchuk groups with application to cryptography
• Tree-Manipulating Systems and Church-Rosser Theorems
• Weak keys in MST\(_{1}\)

Cited in

(1)

• Random Forest profiling attack on advanced encryption standard

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858300)