Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Public Key Cryptography

PKC 1998: Public Key Cryptography pp 203–216Cite as

Public-key cryptosystems using the modular group

  • Conference paper
  • First Online:

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

Abstract

We propose a public-key cryptosystem using the amalgamated free product structure of the modular group and the action on the upper half plane. The main purpose of this paper is to examine possibilities of building public-key cryptosystems using technology from combinatorial group theory. As a possible example of such a system, we offer a new public-key cryptosystem not depending on specific number theoretical problems but on difficulties of solving several problems in algebra.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.Charpes and J Pieprzyk, Attacking the SL2 hashing scheme, Proc. Asiacrypt'94 LNCS 917 (1995) 322–330

    Google Scholar 

  2. D.E.Cohen, Combinatorial Group Theory: A Topological Approach, (Cambridge University Press, Cambridge) (1989)

    MATH  Google Scholar 

  3. H.Cohen, A Course in Computational Algebraic Number Theory, Springer, New York, (1996)

    Google Scholar 

  4. J.Kari, A cryptoanalytic observation concerning systems based on language theory, Discr. Appl. Math. 21 (1988) 265–268

    Article  MATH  MathSciNet  Google Scholar 

  5. J.Kari, Observations concerning a public-key cryptosysytem based on iterated morphisms, Theor. Compt. Sci. 66 (1989) 45–53

    Article  MATH  MathSciNet  Google Scholar 

  6. N.Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer, New York (1991)

    Google Scholar 

  7. R.C.Lyndon and P.E.Schupp, Combinatorial Group Theory, Springer, New York, (1976)

    Google Scholar 

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

    Article  Google Scholar 

  9. A. Salomaa, Public-Key Cryptography, Springer, Berlin, (1990)

    MATH  Google Scholar 

  10. A.Salomaa and S.Yu, On a public-key cryptosystem based on iterated morphisms and substitutions, Theor. Compt. Sci. 48 (1986) 283–296

    Article  MathSciNet  MATH  Google Scholar 

  11. J-P.Serre, A Course in Arithmetic, Springer, New York (1973)

    MATH  Google Scholar 

  12. J-P.Serre, Trees, Springer, New York (1980)

    MATH  Google Scholar 

  13. J-P.Tillich and G.Zémor, Hashing with SL2, Proc. Crypto'94, LNCS 839 (1994) 40–49

    Google Scholar 

  14. N.R. Wagner and M.R. Magyarik, A public-key cryptosystems based on the word problem, In Lecture Notes in Computer Science, 196 (1985) 19–37

    Article  MathSciNet  Google Scholar 

  15. G.Zémor, Hash functions and Cayley graphs, Designs, Codes and Cryptography 4 (1994) 381–394

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Telecommunications Advancement Organization of Japan, 1-1-32 Shin'urashima, Kanagawa-ku, 221-0031, Yokohama, Japan

    Akihiro Yamamura

Authors
  1. Akihiro Yamamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Yuliang Zheng

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamamura, A. (1998). Public-key cryptosystems using the modular group. In: Imai, H., Zheng, Y. (eds) Public Key Cryptography. PKC 1998. Lecture Notes in Computer Science, vol 1431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054026

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64693-8

  • Online ISBN: 978-3-540-69105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation