Skip to main content
SpringerLink
Log in

Computational learning theoreitc cryptanalysis of language theoretic cryptosystems

  • Session 1: Theoretical Foundations of Security
  • Conference paper
  • First Online:
Information and Communications Security (ICICS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1334))

Included in the following conference series:

  • 236 Accesses

Abstract

From the point of view of computational learning theory, we analyze the security of Richelieu cry ptosystems, which are based on language theory. Richelieu cryptosystems use generating systems of slender languages as key generators. We consider the problem of learning slender languages using queries and additional information. We show that families of slender languages are not polynomial-time learnable by only using membership queries, but certain subfamilies of slender languages are polynomial-time learnable from representative samples and membership queries. Based on these results, we discuss the security of Richelieu cryptosystems.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319–342, 1988.

    Google Scholar 

  3. J. Berstel and M. Mignotte. Deux propriétés décidables des suites récurrentes linéaires. Bulletin de la Société Mathématique de France, 104(2):173–184, 1976.

    Google Scholar 

  4. E. M. Gold. Language identification in the limit. Information and Control, 10(5):447–474, 1967.

    Article  Google Scholar 

  5. M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading: Massachusetts, 1978.

    Google Scholar 

  6. J. I. Hmelevskii. Equations in free semigroups. Proceedings of the Steklov Institute of Mathematics, 107:1–270, 1976.

    Google Scholar 

  7. L. Ilie. On a conjecture about slender context-free languages. Theoretical Computer Science, 132(1–2):427–434, 1994.

    Article  Google Scholar 

  8. T. Koshiba. On a hierarchy of slender languages based on control sets. To appear in Fundamenta Informaticae.

    Google Scholar 

  9. M. Lothaire. Combinatorics on Words. Addison-Wesley, Reading:Massachusetts, 1983.

    Google Scholar 

  10. G. Paun and A. Salomaa. Thin and slender languages. Discrete Applied Mathematics, 61(3):257–270, 1995.

    Article  Google Scholar 

  11. D. Raz. On slender context-free languages. In Lecture Notes in Computer Science (STACS'95), Vol. 900, pp. 445–454. Springer-Verlag, 1995.

    Google Scholar 

  12. A. Salomaa. Public-Key Cryptography. Springer-Verlag, Berlin, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. High Performance Computing Research Center, Fujitsu Laboratories Ltd., 4-1-1 Kamikodanaka, Nakahara-ku, Kawasaki-shi, 211-88, Kanagawa, Japan

    Takeshi Koshiba

Authors
  1. Takeshi Koshiba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yongfei Han Tatsuaki Okamoto Sihan Qing

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag

About this paper

Cite this paper

Koshiba, T. (1997). Computational learning theoreitc cryptanalysis of language theoretic cryptosystems. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028459

Download citation

  • DOI: https://doi.org/10.1007/BFb0028459

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63696-0

  • Online ISBN: 978-3-540-69628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation