Observations concerning a public-key cryptosystem based on iterated morphisms

DOI10.1016/0304-3975(89)90144-8zbMath0674.94009DBLPjournals/tcs/Kari89OpenAlexW2027704631WikidataQ62046000 ScholiaQ62046000MaRDI QIDQ1121851

Jarkko Kari

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90144-8

zbMATH Keywords

polynomial growthsubstitutionsNP-hard problempublic-key cryptosystemiterated morphisms

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Mathematical problems in cryptology ⋮ On public-key cryptosystem based on Church-Rosser string-rewriting systems ⋮ A public key cryptosystem based on Lyndon words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a public-key cryptosystem based on iterated morphisms and substitutions
• A cryptanalytic observation concerning systems based on language theory
• The complexity of satisfiability problems

This page was built for publication: Observations concerning a public-key cryptosystem based on iterated morphisms