Braid Group Cryptography
Abstract
In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts on braid groups and on the Garside normal form of its elements, some known algorithms for solving the word problem in the braid group, the major public-key cryptosystems based on the braid group, and some of the known attacks on these cryptosystems. We conclude with a discussion of future directions (which includes also a description of cryptosystems which are based on other non-commutative groups).
Keywords
Cite
@article{arxiv.0711.3941,
title = {Braid Group Cryptography},
author = {David Garber},
journal= {arXiv preprint arXiv:0711.3941},
year = {2009}
}
Comments
75 pages, 19 figures; An almost final version of lectures notes for lectures given in Braid PRIMA school in Singapore, June 2007. This version is a totally revised version