International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Algorithms in Braid Groups

Authors:
Matthew J. Campagna
Download:
URL: http://eprint.iacr.org/2003/099
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2003-11814,
  title={Algorithms in Braid Groups},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / braid groups},
  url={http://eprint.iacr.org/2003/099},
  note={ matthew.campagna@pb.com 12192 received 20 May 2003},
  author={Matthew J. Campagna},
  year=2003
}