New key agreement protocols in braid group cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2020, Issue , 2001, Pages 13-27

  Anshel, Iris ^a   Anshel, Michael ^b   Fisher, Benji ^c   Goldfeld, Dorian ^d  

^a Arithmetica Inc   (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

^c BOSTON COLLEGE   (United States)

^d Howard Hughes Medical Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BRAID GROUPS; HARD PROBLEMS; KEY AGREEMENT PROTOCOL; ONE-WAY FUNCTIONS;

CRYPTOGRAPHY;

EID: 84937563572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_2     Document Type: Conference Paper

References (16)

1. Anshel, I., Anshel, M.: From the Post-Markov Theorem through Decision Pro-blems to Public-Key Cryptography, American Mathematical Monthly Vol. 100, No. 9 (November 1993) 835-845
2. Anshel, I., Anshel, M., and Goldfeld D.: An Algebraic Method for Public-Key Cryptography, Mathematical Research Letters 6 (1999) 1-5
3. Birman, J.: Braids, Links and Mapping Class Groups, Annals of Mathematical Studies, Study 82 Princeton University Press (1974)
4. 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
5. Boneh, D.: Twenty Years of Attacks on the RSA Cryptosystem, Notices of the American Mathematical Society, Vol 46, No. 2 (1999) 203-213.
6. Dehornoy, P.: A fast method for comparing braids, Advances in Mathematics 123 (1997), 205-235
7. Garzon, M., Zalcstein, Y.: The complexity of Grigorchuk groups with applicati-ons 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))
8. Hansen, V. L.: Braids and Coverings: Selected topics, LMS, Student Texts 18 Cambridge University Press (1989)
9. Johnson, D. L.: Presentations of Groups: Second Edition, Cambridge University Press (1997)
10. Kawauchi, A.: A Survey of Knot Theory, Birhauser Verlag (1996)
11. 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
12. Koblitz, N.: Algebraic Aspects of Cryptography, Springer-Verlag (1998)
13. Morton, H. R.: The Multivariable Alexander Polynomial for a Closed Braid, Con-temporary Mathematics 233 AMS (1999), 167-172
14. Sidel'nikov, V. M., Cherepenev, M. A., Yashichenko, V. V.: Systems of open dis-tribution of keys on the basis of noncommutative semigroups, Russian. Acad. Sci. Dokl. Math. Vol. 48 No. 2 (1994) 384-386
15. 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
16. Welsch, D. J. A.: Complexity: Knots, Colourings and Counting, LMS, Lecture Notes Series 186 Cambridge University Press (1993)