Algorithms in Braid Groups

Matthew J.  Campagna

Paper 2003/099 Original: eprint.iacr.org/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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2003-05-21: last updated; 2003-05-21: published
Short URL: https://ia.cr/2003/099
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2003/099,
      author = {Matthew J.  Campagna},
      title = {Algorithms in Braid Groups},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/099},
      year = {2003},
      url = {https://eprint.iacr.org/2003/099}
}