Lyndon trees

DOI10.1016/0304-3975(92)90259-IzbMath0787.68027OpenAlexW2913062573MaRDI QIDQ1202932

Rani Siromoney, K. G. Subramanian, Lisa Mathew

Publication date: 22 April 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90259-i

zbMATH Keywords

public key cryptosystemfactorization theoremLyndon wordsLyndon trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Data structures (68P05)

Related Items (2)

Lyndon partial words and arrays with applications ⋮ Periodicities on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A public key cryptosystem based on Lyndon words
• On a public-key cryptosystem based on iterated morphisms and substitutions
• A D0L-T0L public key cryptosystem
• Factorizing words over an ordered alphabet
• Lyndon Words, Free Algebras and Shuffles

This page was built for publication: Lyndon trees