A public key cryptosystem based on Lyndon words

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

Rani Siromoney, Lisa Mathew

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 cryptosystems; morphisms; Lyndon words; Thue systems

Mathematics Subject Classification ID

68Q45: Formal languages and automata

94A60: Cryptography

68Q42: Grammars and rewriting systems

03D03: Thue and Post systems, etc.

Related Items

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

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