Language-theoretic problems arising from Richelieu cryptosystems

DOI10.1016/0304-3975(93)90327-PzbMATH Open0797.68094OpenAlexW2082641615MaRDI QIDQ685369FDOQ685369

Authors: Mircea Andraşiu, Gheorghe Păun, Arto Salomaa, Jürgen Dassow 

Publication date: 19 October 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90327-p

Recommendations

• scientific article; zbMATH DE number 1107671
• scientific article; zbMATH DE number 611082
• scientific article; zbMATH DE number 4090825
• Many aspects of formal languages
• A cryptanalytic observation concerning systems based on language theory

zbMATH Keywords

decidabilityformal languagesgarbage-in-between cryptosystemsRichelieu cryptosystems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (23)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Min of Mat is not necessarily Mat
• Closure properties of slender languages
• On a conjecture about slender context-free languages
• Length considerations in context-free languages
• RESULTS CONCERNING THINNESS OF D0L LANGUAGES
• Slender 0L languages
• On lengths of words in context-free languages
• Thin and slender languages
• Language-theoretic complexity of disjunctive sequences
• Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
• Title not available (Why is that?)
• A characterization of poly-slender context-free languages
• State complexity of insertion
• Intertwined infinite binary words
• A decision method for Parikh slenderness of context-free languages
• On Parikh slender context-free languages
• On the multiplicity equivalence problem for context-free grammars
• Insertion and deletion of words: determinism and reversibility
• Another variation on Conway's recursive sequence
• Slender Siromoney matrix languages
• Numeration systems, linear recurrences, and regular sets

This page was built for publication: Language-theoretic problems arising from Richelieu cryptosystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685369)