An efficient implementation of braid groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2248, Issue , 2001, Pages 144-156

  Cha, Jae Choon ^a   Ko, Ki Hyoung ^a   Lee, Sang Jin ^a   Han, Jae Woo ^b   Cheon, Jung Hee ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b National Security Research Institute (NSRI)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BRAID GROUPS; EFFICIENT IMPLEMENTATION; OPTIMIZED ALGORITHMS; PSEUDO CODES;

CRYPTOGRAPHY;

EID: 84946826517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_9     Document Type: Conference Paper

References (8)

1. J. S. Birman, K. H. Ko and S. J. Lee, A new approach to the word and conjugacy problem in the braid groups, Advances in Mathematics 139 (1998), 322-353.
2. E. A. Elrifai and H. R. Morton, Algorithms for positive braids, Quart. J. Math. Oxford 45 (1994), 479–497.
3. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson and W. Thurston, Word processing in groups, Jones & Bartlett, 1992.
4. F. A. Garside, The braid group and other groups, Quart. J. Math. Oxford 20 (1969), no. 78, 235–254.
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.
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.
7. K. H. Ko, et al., Mathematical security analysis of braid cryptosystems, preprint.
8. R. P. Stanley, Enumerative combinatorics, Wadsworth and Brooks/Cole, 1986.