[Resource Topic] 2003/099: Algorithms in Braid Groups

Welcome to the resource topic for 2003/099

Algorithms in Braid Groups

Authors: Matthew J. Campagna


Braid Groups have recently been considered for use in Public-Key
Cryptographic Systems. The most notable of these system has been the
Birman-Ko-Lee system presented at Crypto 2000. This article gives a brief introduction into braid groups and the hard problems on which public key systems have been defined. It suggests a canonical form max run form using the Artin generators and supplies some supporting algorithms necessary for cryptographic operations.

ePrint: https://eprint.iacr.org/2003/099

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .