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].
Similar content being viewed by others
References
Anderson, R., Needham, R.: Robustness principle for public key protocols. Crypto 95
Anshel I., Anshel M., Goldfeld D. (1999). An algebraic method for public key cryptography. Math Res Lett 6:287–291
Baumslag, G.: Topics in combinatorial group theory. Birkhauser (1993)
Baumslag, G., Fine, B., Xu, X.: Free group and linear group public key cryptosystems (in press)
Fine B (1990). The algebraic theory of the bianchi groups. Dekker, USA
Grigoriev, D., Ponomarenko I.: Homomorphic public-key cryptosystems over groups and rings. Quaderni di Matematica (in press)
Hoffman, P.: Archimedes revenge. Fawcett-Crest (1988)
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)
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)
Koblitz N. (1998). Algebraic methods of cryptography. Springer, Berlin Heidelberg New York
Lyndon R.C., Schupp P.E. (1977). Combinatorial group theory. Springer, Berlin Heidelberg New York
Magnus, W.: Rational representations of fuchsian groups and non-parabolic subgroups of the modular group. Nachrichten der Akad Gottingen, 179–189 (1973)
Magnus W., Karass A., Solitar D. (1968). Combinatorial group theory. Wiley, New York
Steinwandt, R.: Loopholes in two public key cryptosystems using the modular groups. preprint University of Karlsruhle (2000)
Tits J. (1972). Free subgroups in linear groups. J Algebra 20:250–270
Xiaowei Xu. Cryptography and Infinite Group Theory Ph.D. Thesis
Yamamura A. (1998). Public key cryptosystems using the modular groups. Lect Notes Comput Sci 1431:203–216
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-006-0003-z