Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / braid groups

Date: received 20 May 2003

Contact author: matthew campagna at pb com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: none

Version: 20030521:102817 (All versions of this report)

Short URL: ia.cr/2003/099

Discussion forum: Show discussion | Start new discussion