You are looking at a specific version 20030521:102817 of this paper.
See the latest version.
Paper 2003/099
Algorithms in Braid Groups
Matthew J. Campagna
Abstract
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.
Note: none
Metadata
- Available format(s)
- PDF PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- braid groups
- Contact author(s)
- matthew campagna @ pb com
- History
- 2003-05-21: received
- Short URL
- https://ia.cr/2003/099
- License
-
CC BY