On public-key cryptosystem based on Church-Rosser string-rewriting systems

DOI10.1007/bfb0030841zbMath1527.94058MaRDI QIDQ6064030

Volodymyr Oleshchuk

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite complete rewriting systems and the complexity of word problem
• An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems
• Almost all one-rule Thue systems have decidable word problems
• Complexity of certain decision problems about congruential languages
• On a public-key cryptosystem based on iterated morphisms and substitutions
• Thue systems as rewriting systems
• Observations concerning a public-key cryptosystem based on iterated morphisms
• Conducting secret ballot elections in computer networks: Problems and solutions
• Undecidable questions related to Church-Rosser Thue systems
• Confluent and Other Types of Thue Systems

This page was built for publication: On public-key cryptosystem based on Church-Rosser string-rewriting systems