Cryptosystems for Picture Languages
There has been tremendous interest in the study and construction of hard to break public key cryptosystems, introduced by Diffie and Hellman . These depend on one-way functions and provide secrecy in data transmission or storage. Different keys are used for the encryption and decryption processes, the encryption key being made public in the form of a directory but the decryption key is kept secret. Thus, for a public key cryptosystem to be safe and effective, encryption and decryption should be “easy” but cryptanalysis “hard” and this is accomplished by hiding information in the trapdoor. Legal recipient can decrypt easily with the help of the information in the trapdoor but the eavesdropper finds it difficult to decode without this information.
Unable to display preview. Download preview PDF.
- 2.Dassow, J. (1984), A note on DTOL systems, Bull. EATCS., No.22, 11–14.Google Scholar
- 6.Rosenfeld, A. (1979), “Picture Languages – Formal Models of Picture Recognition”, Academic Press, London.Google Scholar
- 7.Rozenberg, G. and Salomaa, A. (1980), “The Mathematical Theory of L-systerns”, Academic Press, New York.Google Scholar
- 8.Salomaa, A. (1985), “Computation and Automata”, Encyclopaedia of Mathematics and its applications, Vol. 25, Cambridge University Press.Google Scholar
- 9.Salomaa, A. (1985), Cryptography from Caesar to DES and RSA, Bull. EATCS, No.26, 101–120.Google Scholar
- 10.Siromoney, R. (1985), Array languages and Lindenmayer systemsa survey, in “The Book of L”, Eds. G. Rozenberg and A. Salomaa, Springer-Verlag, Berlin, 413–426.Google Scholar
- 13.Subramanian, K.G., Siromoney, R. and Abisha Jeyanthi (1986), A DOL/TOL public key cryptosystem, TR MATH 16/86, Madras Chriatian College, Tambaram.Google Scholar