A public key cryptosystem based on Lyndon words

DOI10.1016/0020-0190(90)90170-3zbMath0706.68065OpenAlexW2047742876MaRDI QIDQ918715

Lisa Mathew, Rani Siromoney

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90170-3

zbMATH Keywords

public key cryptosystemsmorphismsLyndon wordsThue systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Related Items (7)

Circle formation of weak robots and Lyndon words ⋮ Attacking a public key cryptosystem based on tree replacement ⋮ Deterministic geoleader election in disoriented anonymous systems ⋮ Fast parallel Lyndon factorization with applications ⋮ PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS ⋮ Lyndon trees ⋮ Clouds over a public key cryptosystem based on Lyndon words

Cites Work

• Unnamed Item
• On a public-key cryptosystem based on iterated morphisms and substitutions
• A D0L-T0L public key cryptosystem
• Thue systems as rewriting systems
• A cryptanalytic observation concerning systems based on language theory
• Observations concerning a public-key cryptosystem based on iterated morphisms
• Factorizing words over an ordered alphabet
• Lyndon Words, Free Algebras and Shuffles

This page was built for publication: A public key cryptosystem based on Lyndon words