Skip to main content
SpringerLink
Log in

Cryptosystems using Linear Groups

  • Original article
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, the Reidemeister-Schreier rewriting process is used as a one way function. These suggestions raise further questions concerning both implementation and security that are being explored in the thesis of Xu [16].

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Anderson, R., Needham, R.: Robustness principle for public key protocols. Crypto 95

  2. Anshel I., Anshel M., Goldfeld D. (1999). An algebraic method for public key cryptography. Math Res Lett 6:287–291

    MATH  MathSciNet  Google Scholar 

  3. Baumslag, G.: Topics in combinatorial group theory. Birkhauser (1993)

  4. Baumslag, G., Fine, B., Xu, X.: Free group and linear group public key cryptosystems (in press)

  5. Fine B (1990). The algebraic theory of the bianchi groups. Dekker, USA

    Google Scholar 

  6. Grigoriev, D., Ponomarenko I.: Homomorphic public-key cryptosystems over groups and rings. Quaderni di Matematica (in press)

  7. Hoffman, P.: Archimedes revenge. Fawcett-Crest (1988)

  8. Hall, C., Goldberg, I., Schneier, B.: Reaction attaacks against several public key cryptosystems. In: Proceedings of information and communications security ICICS 99, Berlin Heidelberg New York: Springer, pp 2–12 (1999)

  9. Ko, K.H., Lee, J., Cheon, J.H., Han, J.W., Kang, J., Park, C.: New public-key cryptosystem using braid groups. Advances in Cryptology - CRYPTO 2000 Santa Barbara CA, Lecture Notes in Computer Science, vol. 1880. Berlin Heidelberg New York: Springer, pp 166–183 (2000)

  10. Koblitz N. (1998). Algebraic methods of cryptography. Springer, Berlin Heidelberg New York

    Google Scholar 

  11. Lyndon R.C., Schupp P.E. (1977). Combinatorial group theory. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  12. Magnus, W.: Rational representations of fuchsian groups and non-parabolic subgroups of the modular group. Nachrichten der Akad Gottingen, 179–189 (1973)

  13. Magnus W., Karass A., Solitar D. (1968). Combinatorial group theory. Wiley, New York

    Google Scholar 

  14. Steinwandt, R.: Loopholes in two public key cryptosystems using the modular groups. preprint University of Karlsruhle (2000)

  15. Tits J. (1972). Free subgroups in linear groups. J Algebra 20:250–270

    Article  MATH  MathSciNet  Google Scholar 

  16. Xiaowei Xu. Cryptography and Infinite Group Theory Ph.D. Thesis

  17. Yamamura A. (1998). Public key cryptosystems using the modular groups. Lect Notes Comput Sci 1431:203–216

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, City College of New York, New York, NY, 10031, USA

    Gilbert Baumslag & Xiaowei Xu

  2. Department of Mathematics, Fairfield University, Fairfield, 06430, USA

    Benjamin Fine

Authors
  1. Gilbert Baumslag
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin Fine
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaowei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Benjamin Fine.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baumslag, G., Fine, B. & Xu, X. Cryptosystems using Linear Groups. AAECC 17, 205–217 (2006). https://doi.org/10.1007/s00200-006-0003-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-006-0003-z

Keywords

Search

Navigation