On a public-key cryptosystem based on iterated morphisms and substitutions

DOI10.1016/0304-3975(86)90099-XzbMath0636.94007MaRDI QIDQ1098821

Arto Salomaa, Sheng Yu

Publication date: 1986

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

zbMATH Keywords

public-key cryptosystemDTOL system

Mathematics Subject Classification ID

Cryptography (94A60) Grammars and rewriting systems (68Q42)

Related Items (7)

Mathematical problems in cryptology ⋮ A cryptanalytic observation concerning systems based on language theory ⋮ Observations concerning a public-key cryptosystem based on iterated morphisms ⋮ On public-key cryptosystem based on Church-Rosser string-rewriting systems ⋮ A public key cryptosystem based on Lyndon words ⋮ Lyndon trees ⋮ Many aspects of formal languages

Cites Work

• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a public-key cryptosystem based on iterated morphisms and substitutions