Skip to main content
SpringerLink
Log in

Cryptology: Language-Theoretic Aspects

  • Chapter
  • First Online:
Handbook of Formal Languages

Abstract

Cryptology is the science and art of secret writing. The basic idea is to convert a meaningful text to another text in which the meaning is concealed. This starting point seems to imply that cryptology is essentially connected to semantics. The reason why this conclusion is not true is the following.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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).

    Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  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.

    MATH  Google Scholar 

  6. Bao, F. and Igarashi, Y.: Break finite automata public key cryptosystem. Proceedings of ICALP’95, Lecture Notes in Computer Science 944, Springer-Verlag, Berlin, 1995, 147–158.

    Google Scholar 

  7. Bell, D. E. and LaPadula, L. J.: Secure computer system: unified exposition and Multics interpretation. Technical report MTR-2997, Mitre Corp., Bedford, Mass., 1976.

    Book  Google Scholar 

  8. Benois, M.: Descendants of regular language in a class of rewriting systems: algorithm and complexity of an automata construction. Proceedings of Rewriting Techniques and Applications, Lecture Notes in Computer Science 256, Springer-Verlag, Berlin, 1987, 121–132.

    Google Scholar 

  9. Daemen, J., Govaerts, R. and Vandewalle, J.: A framework for the design of one-way hash functions including cryptanalysis of Damgârd’s one-way function based on a cellular automaton. Advances in cryptology-ASIACRYPT’91, Lecture Notes in Computer Science 739, Springer-Verlag, Berlin, 1993, 82–96.

    MATH  Google Scholar 

  10. Damgârd, I.: A design principle for hash functions. Advances in cryptologyCRYPTO’89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, 1990, 416–427.

    Google Scholar 

  11. Denning, D. E.: Cryptography and data security. Addison-Wesley, Reading, Mass., 1982.

    MATH  Google Scholar 

  12. Diffie, W. and Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory IT-22 (1976), 644–654.

    Article  MathSciNet  Google Scholar 

  13. Dolev, D. and Yao, A. C.: On the security of public key protocols. IEEE Transactions on information theory IT-29 (1983) 198–208.

    Article  MathSciNet  Google Scholar 

  14. Dwork, C. and Stockmeyer, L.: Zero-knowledge with finite state verifiers. Advances in cryptology-CRYPTO’88, Lecture Notes in Computer Science 403, Springer-Verlag, Berlin, 1990, 71–75.

    Google Scholar 

  15. Garzon, M. and Zalcstein, Y.: The complexity of Grigorchuk groups with application to cryptography. Theoretical Computer Science 88, (1991), 8398.

    Article  MathSciNet  Google Scholar 

  16. Guan, P.: Cellular Automaton public-key cryptosystem. Complex Systems 1, (1987) 51–56.

    MathSciNet  MATH  Google Scholar 

  17. Gutowitz, H.: Cryptography with dynamical systems. Proceedings of Cellular Automata and Cooperative Systems, NATO Advanced Institute, Kluwer, Dordrecht, 1993, 237–274.

    Book  Google Scholar 

  18. Kari, J.: A cryptanalytic observation concerning systems based on language theory. Discrete Applied Mathematics 21, (1988) 265–268.

    Article  MathSciNet  Google Scholar 

  19. Kari, J.: Observations concerning a public-key cryptosystem based on iterated morphisms. Theoretical Computer Science 66, (1989) 45–53.

    Article  MathSciNet  Google Scholar 

  20. Kari, L.: On insertion and deletion in formal languages. Ph. D. thesis, Univ. of Turku, Turku, 1991.

    Google Scholar 

  21. Kearns, M. and Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM 41, (1994) 67–95.

    Article  MathSciNet  Google Scholar 

  22. Li, J. and Gao, X.: Realization of finite automata public key cryptosystem and digital signature. Proceedings of CRYPTOCHINA’92, 110–115. (in Chinese)

    Google Scholar 

  23. Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading, MA, 1982.

    MATH  Google Scholar 

  24. Matei, C. and Tiplea, F. L.: (0,1)-total pure context-free grammars. Proceedings of Developments in Language Theory ‘85, World Scientific, Singapore, 1996, 148–153.

    MATH  Google Scholar 

  25. Meier, W. and Staffelbach, O.: Analysis of pseudo random sequences generated by cellular automata. Advances in cryptology-EUROCRYPT ‘81, Lecture Notes in Computer Science 547, Springer-Verlag, Berlin, 1991, 186–199.

    MATH  Google Scholar 

  26. Nandi, S., Kar, B. K. and Pal Chaudhuri, P.: Theory and applications of cellular automata in cryptography. IEEE Transactions on Computers 43, (1994) 1346–1357.

    Article  MathSciNet  Google Scholar 

  27. Niemi, V.: Hiding regular languages: a public-key cryptosystem. Manuscript, 1989.

    Google Scholar 

  28. Oleshchuk, V. A.: On public-key cryptosystem based on Church-Rosser string-rewriting systems. Proceedings of Computing and Combinatorics ‘85, Lecture Notes in Computer Science 959, Springer-Verlag, Berlin, 1995, 264–269.

    Google Scholar 

  29. Oommen, B. J. and Zgierski, R.: Breaking substitution cyphers using stochastic automata. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, (1993) 185–192.

    Article  Google Scholar 

  30. Pichler, F.: Finite state machine modelling of cryptographic systems in LOOPS. Advances in cryptology-EUROCRYPT ‘87, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1988, 65–73.

    Google Scholar 

  31. Pichler, F.: Application of automata theory in cryptology. Elektrotechnik und Informationstechnik 105, (1988) 18–25. (in German)

    Google Scholar 

  32. Pitt, L. and Warmuth, M. K.: Prediction-preserving reducibility. Journal of Computer and System Sciences 41, (1990) 430–467.

    Article  MathSciNet  Google Scholar 

  33. Qin, Z. and Zhang, H.: The attack algorithm A tau M to finite automaton public key cryptosystems. Chinese Journal of Computers, 18, (1995) 199–204.

    Google Scholar 

  34. Rayward-Smith, V. J.: Mealy machines as coding devices. In: Beker, H. J. and Piper, F. C. (eds.): Cryptography and codings, Clarendon Press, Oxford, 1989.

    Google Scholar 

  35. Rivest, R. L., Shamir, A. and Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of ACM, 21, (1978), 120–126.

    Article  MathSciNet  Google Scholar 

  36. Rueppel, R.: A formal approach to security architecture. Advances in cryptology — EUROCRYPT’91, Lecture Notes in Computer Science 547, Springer-Verlag, Berlin, 1991, 387–398.

    Google Scholar 

  37. Salomaa, A.: A public-key cryptosystem based on language theory. Computers and Security 7, (1988) 83–87.

    Article  Google Scholar 

  38. Salomaa, A: Public-key cryptography. EATCS Monographs in Theoretical Computer Science, vol. 23, Springer-Verlag, Berlin, 1990.

    Google Scholar 

  39. Salomaa, A. and Yu, S.: On a public-key cryptosystem based on iterated morphisms and substitutions. Theoretical Computer Science 48, (1986) 283296.

    Article  MathSciNet  Google Scholar 

  40. Schneier, B.: Applied cryptology: protocols, algorithms and source code in C. John Wiley & Sons, New York, 1994.

    MATH  Google Scholar 

  41. Seberry, J. and Pieprzyk, J.: Cryptography: an introduction to computer security. Prentice Hall, New York, 1989.

    MATH  Google Scholar 

  42. Simmons, G. J. (ed.): Contemporary cryptology: the science of information integrity. IEEE Press, 1992.

    MATH  Google Scholar 

  43. Siromoney, R. and Mathew, L.: A public key cryptosystem based on Lyndon words. Information Processing Letters 35, (1990) 33–36.

    Article  MathSciNet  Google Scholar 

  44. Stinson, D. R.: Cryptography: theory and practice. CRC Press, 1995.

    Google Scholar 

  45. Subramanian, K. G., Siromoney, R. and Abisha, P. J.: A DOL-TOL public key cryptosystem. Information Processing Letters 26, (1987), 95–97.

    Article  MathSciNet  Google Scholar 

  46. Tao, R.: Some results on the structure of feedforward inverses. Scientia Sinica (Series A) 27, (1984) 157–162.

    MathSciNet  MATH  Google Scholar 

  47. Tao, R.: Invertibility of linear finite automata over a ring. Proceedings of ICALP’88, Lecture Notes in Computer Science 317, Springer-Verlag, Berlin, 1988, 489–501.

    Google Scholar 

  48. Tao, R.: On finite automaton one-key cryptosystems. Proceedings of Cambridge Security Workshop, Fast Software Encryption, Lecture Notes in Computer Science 809, Springer-Verlag, Berlin, 1994, 135–148.

    Google Scholar 

  49. Tao, R.: On Latin arrays, Proceedings of International Workshop on Discrete Mathematics and Algorithms, Jinan University Press, 1994, 1–14.

    Google Scholar 

  50. Tao, R.: On invertibility of some compound finite automata. Technical report No. ISCAS-LCS-95–06, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 1995.

    Google Scholar 

  51. Tao, R. and Chen, S.: Finite automata public key cryptosystem and digital signature. Computer Acta 8, (1985) 401–409 (in Chinese).

    Google Scholar 

  52. Tao, R. and Chen, S.: Two varieties of finite automata public key cryptosystem and digital signature. Journal of Computer Science and Technology 1, (1986) 9–18.

    Article  MathSciNet  Google Scholar 

  53. Tao, R. and Chen, S.: An implementation of identity-based cryptosystems and signature schemes by finite automaton public key cryptosystems. Proceedings of CRYPTOCHINA’92, 87–104. (in Chinese)

    Google Scholar 

  54. Tao, R. and Chen, S.: Generating a kind of nonlinear finite automata with invertibility by transformation method. Technical report No. ISCAS-LCS-9505, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 1995.

    Google Scholar 

  55. Tao, R., Chen, S. and Chen, X.: FAPKC3: a new finite automaton public key cryptosystem. Technical report No. ISCAS-LCS-95–07, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 1995.

    Google Scholar 

  56. Wagner, N. R. and Magyarik, M. R.: A public-key cryptosystem based on the word problem. Advances in cryptology-CRYPTO’84, Lecture Notes in Computer Science 196, Springer-Verlag, Berlin, 1985, 19–37.

    Google Scholar 

  57. Wichmann, P.: Cryptanalysis of a modified rotor machine. Advances in cryptology-EUROCRYPT’89, Lecture Notes in Computer Science 434, Springer-Verlag, Berlin, 1990, 395–402.

    Google Scholar 

  58. Wolfram, S.: Cryptography with cellular automata. Advances in cryptologyCRYPTO ‘85, Lecture Notes in Computer Science 218, Springer-Verlag, Berlin, 1986, 429–432.

    Google Scholar 

  59. Zhang, H., Qin, Z. et al.: The software implementation of FA public key cryptosystem. Proceedings of CRYPTOCHINA’92, 105–109. (in Chinese)

    Google Scholar 

Download references

Authors
  1. Valtteri Niemi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Leiden University, P.O. Box 9512, NL-2300 RA, Leiden, The Netherlands

    Grzegorz Rozenberg

  2. Department of Computer Science, University of Colorado at Boulder, Campus 430, 80309, Boulder, CO, USA

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science Data City, FIN-20520, Turku, Finland

    Arto Salomaa

  4. Academy of Finland and Turku Centre for Computer Science (TUCS), Lemninkäisenkatu 14 A, FIN-20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Niemi, V. (1997). Cryptology: Language-Theoretic Aspects. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07675-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-07675-0_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08230-6

  • Online ISBN: 978-3-662-07675-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation