Cryptosystems for Picture Languages

  • R. Siromoney
  • K. G. Subramanian
  • Abisha Jeyanthi
Conference paper
Part of the NATO ASI Series book series (volume 45)


There has been tremendous interest in the study and construction of hard to break public key cryptosystems, introduced by Diffie and Hellman [3]. 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.


Plain Text Hilbert Curve Picture Language Great Cardinality Array Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V and Corasick, M.J. (1975), Efficient string matching: An aid to bibliographic search, Comm. ACM, 18, 333–340.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Dassow, J. (1984), A note on DTOL systems, Bull. EATCS., No.22, 11–14.Google Scholar
  3. 3.
    Diffie, W. and Hellman, M.E. (1976), New directions in cryptography, IEEE Trans. Inf. Theory IT-22, 644–654.MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Fu, K.S. (1974). “Syntactic Methods in Pattern Recognition”, Academic Press, New York.MATHGoogle Scholar
  5. 5.
    Maurer, H.A., Rozenberg, G., and Welzl, E. (1982), Using string languages to describe picture languages, Inform, and Control, 54, 155–185.MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Rosenfeld, A. (1979), “Picture Languages – Formal Models of Picture Recognition”, Academic Press, London.Google Scholar
  7. 7.
    Rozenberg, G. and Salomaa, A. (1980), “The Mathematical Theory of L-systerns”, Academic Press, New York.Google Scholar
  8. 8.
    Salomaa, A. (1985), “Computation and Automata”, Encyclopaedia of Mathematics and its applications, Vol. 25, Cambridge University Press.Google Scholar
  9. 9.
    Salomaa, A. (1985), Cryptography from Caesar to DES and RSA, Bull. EATCS, No.26, 101–120.Google Scholar
  10. 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
  11. 11.
    Siromoney, R. and Siromoney, G. (1977), Extended controlled table L-arrays, Inform. Control, 35, 119–138.MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Siromoney, R. and Siromoney, G. (1986) A public key cryptosystem that defies cryptanalysis, Bull. EATCS, No.28, 37–43.MATHGoogle Scholar
  13. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • R. Siromoney
    • 1
  • K. G. Subramanian
    • 1
  • Abisha Jeyanthi
    • 1
  1. 1.Dept. of MathematicsMadras Chistian CollegeTambaram MadrasIndia

Personalised recommendations