Abstract
Key agreement protocols are presented whose security is based on the difficulty of inverting one-way functions derived from hard problems for braid groups. Efficient/low cost algorithms for key transfer /extraction are presented. Attacks/security parameters are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anshel, I., Anshel, M.: From the Post-Markov Theorem through Decision Problems to Public-Key Cryptography, American Mathematical Monthly Vol. 100, No. 9 (November 1993) 835–845
Anshel, I., Anshel, M., and Goldfeld D.: An Algebraic Method for Public-Key Cryptography, Mathematical Research Letters 6 (1999) 1–5
Birman, J.: Braids, Links and Mapping Class Groups, Annals of Mathematical Studies, Study 82 Princeton University Press (1974)
Birman, J., Ko, K. H., Lee, S. J.: A new solution to the word and conjugacy problems in the braid groups, Advances in Mathematics 139 (1998), 322–353
Boneh, D.: Twenty Years of Attacks on the RSA Cryptosystem, Notices of the American Mathematical Society, Vol 46, No. 2 (1999) 203–213.
Dehornoy, P.: A fast method for comparing braids, Advances in Mathematics 123 (1997), 205–235
Garzon, M., Zalcstein, Y.: The complexity of Grigorchuk groups with applications to cryptography, Theoretical Computer Science 88:1 (1991) 83–98 (additional discussion may be found in M. Garzon, “Models of Massive Parallelism” Springer-Verlag (1995))
Hansen, V. L.: Braids and Coverings: Selected topics, LMS, Student Texts 18 Cambridge University Press (1989)
Johnson, D. L.: Presentations of Groups: Second Edition, Cambridge University Press (1997)
Kawauchi, A.: A Survey of Knot Theory, Birhauser Verlag (1996)
Ko, K. H., Lee, S. J., Cheon, J. H., Han, J. W., Kang, J. S., Park, C.: New Public-Key Cryptosystem Using Braid Groups, to appear in Crypto 2000
Koblitz, N.: Algebraic Aspects of Cryptography, Springer-Verlag (1998)
Morton, H. R.: The Multivariable Alexander Polynomial for a Closed Braid, Contemporary Mathematics 233 AMS (1999), 167–172
Sidel’nikov, V. M., Cherepenev, M. A., Yashichenko, V. V.: Systems of open distribution of keys on the basis of noncommutative semigroups, Russian. Acad. Sci. Dokl. Math. Vol. 48 No.2 (1994) 384–386
Wagner, N. R., Magyarik, M. R.: A public key cryptosystem based on the word problem, Advances in Cryptology: Proceedings of Crypto 84, ed. G. R. Blakely and D. Chaum, LNCS 196, Springer Verlag (1985) 19–36
Welsch, D. J. A.: Complexity: Knots, Colourings and Counting, LMS, Lecture Notes Series 186 Cambridge University Press (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anshel, I., Anshel, M., Fisher, B., Goldfeld, D. (2001). New Key Agreement Protocols in Braid Group Cryptography. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-45353-9_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41898-6
Online ISBN: 978-3-540-45353-6
eBook Packages: Springer Book Archive