Language-theoretic problems arising from Richelieu cryptosystems

Abstract Classical cryptosystems of the type “Richelieu” or “garbage-in-between” give rise to ideas and notions so far neglected in the theory of formal languages. This paper investigates such notions, mainly from the point of view of decidability.

[1]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[2]  Lila Kari,et al.  On Insertion and Deletion in Formal Languages , 1991 .

[3]  Arto Salomaa,et al.  Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.

[4]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[5]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .