Part of the Lecture Notes in Computer Science book series (LNCS, volume 2248)
An Efficient Implementation of Braid Groups
We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose pseudo-codes are provided. The performance of an actual implementation under various choices of parameters is listed.
KeywordsHash Function Word Problem Braid Group Canonical Factor Maximal Head
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 3.D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson and W. Thurston, Word processing in groups, Jones & Bartlett, 1992.Google Scholar
- 5.K. H. Ko, S. J. Lee, J. H. Cheon, J. H. Han, J. S. Kang and C. Park, New public key cryptosystem using braid groups, Advances in Cryptology, Proceedings of Crypto 2000, Lecture Notes in Computer Science 1880, ed. M. Bellare, Springer-Verlag (2000), 166–183.Google Scholar
- 6.E. Lee, S. J. Lee and S. G. Hahn, Pseudorandomness from braid groups, Advances in Cryptology, Proceedings of Crypto 2001, Lecture notes in Computer Science 2139, ed. J. Kilian, Springer-Verlag (2001), 486–502.Google Scholar
- 7.K. H. Ko, et al., Mathematical security analysis of braid cryptosystems, preprint.Google Scholar
- 8.R. P. Stanley, Enumerative combinatorics, Wadsworth and Brooks/Cole, 1986.Google Scholar
© Springer-Verlag Berlin Heidelberg 2001