Observations Concerning a Public-Key Cryptosystem Based on Iterated Morphisms
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Jarkko Kari. A cryptanalytic observation concerning systems based on language theory , 1988, Discret. Appl. Math..
[3] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[4] Arto Salomaa,et al. On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions , 1986, Theor. Comput. Sci..
[5] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[6] Arto Salomaa,et al. Computation and Automata , 1984 .