Cryptology: Language-Theoretic Aspects-Reference-Cited by-同舟云学术

Cryptology: Language-Theoretic Aspects

Published:1997 Issue: Volume: Page:507-524
ISSN:
Container-title:Handbook of Formal Languages
language:
Short-container-title:

Author:

Niemi Valtteri

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-07675-0_11

Reference59 articles.

1. Andrasiu, M., Atanasiu, A., Pàun, G. and Salomaa, A.: A new cryptosys- tern based on formal language theory. Bull. Math. de la Soc. Sci. Math. de Roumanie, Tome 36, (1992).

2. Andrasiu, M., Pàun, G., Dassow, J. and Salomaa, A.: Language-theoretic problems arising from Richelieu cryptosystems. Theoretical Computer Science, 116, (1993) 339–357.

3. Anshel, I. M. and Anshel, M.: From the Post-Markov theorem through decision problems to public-key cryptography. American Mathematical Monthly 100, (1993) 835–844.

4. Atanasiu, A.: A class of coders based on gsm. Acta Informatica, 29, (1992) 779–791.

5. Bao, F. and Igarashi, Y.: A randomized algorithm to finite automata public key cryptosystem. Proceedings of ISAAC’94, Lecture Notes in Computer Science 834, Springer-Verlag, Berlin, 1994, 678–686.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups;Progress in Cryptology - INDOCRYPT 2003;2003

2. Tree Replacement and Public Key Cryptosystem;Progress in Cryptology — INDOCRYPT 2002;2002

3. Caesar and DNA — views on cryptology;Fundamentals of Computation Theory;1999

4. Modified Finite Automata Public Key Cryptosystem;Lecture Notes in Computer Science;1998