| Tài liệu tham khảo |
Loại |
Chi tiết |
| [1] I. Anshel, M. Anshel and D. Goldfeld, An algebraic method for public-key cryptog- raphy, Math. Res. Lett. 6 (1999), 287–291 |
Sách, tạp chí |
| Tiêu đề: |
An algebraic method for public-key cryptog-raphy |
| Tác giả: |
I. Anshel, M. Anshel and D. Goldfeld, An algebraic method for public-key cryptog- raphy, Math. Res. Lett. 6 |
| Năm: |
1999 |
|
| [2] M. Berger, Minimum crossing numbers for 3-braids, Journal of Physics A: Mathe- matical and General 27 (1994), 6205–6213 |
Sách, tạp chí |
| Tiêu đề: |
Minimum crossing numbers for" 3"-braids |
| Tác giả: |
M. Berger, Minimum crossing numbers for 3-braids, Journal of Physics A: Mathe- matical and General 27 |
| Năm: |
1994 |
|
| [3] J. Birman, K.H. Ko, J.S. Lee, A new approach to the word and conjugacy problems in the braid groups, Advances in Mathematics 139 (1998), 322–353 |
Sách, tạp chí |
| Tiêu đề: |
A new approach to the word and conjugacy problemsin the braid groups |
| Tác giả: |
J. Birman, K.H. Ko, J.S. Lee, A new approach to the word and conjugacy problems in the braid groups, Advances in Mathematics 139 |
| Năm: |
1998 |
|
| [4] R. Charney, Geodesic automation and growth functions for Artin groups of finite type, Mathematische Annalen 301 (1995), 307–324 |
Sách, tạp chí |
| Tiêu đề: |
Geodesic automation and growth functions for Artin groups of finitetype |
| Tác giả: |
R. Charney, Geodesic automation and growth functions for Artin groups of finite type, Mathematische Annalen 301 |
| Năm: |
1995 |
|
| [5] P. Dehornoy, Groupes de Garside, Annales Scientifiques de l’ ´ Ecole Normale Sup´ e- rieure 35 (2002), 267–306 |
Sách, tạp chí |
| Tiêu đề: |
Groupes de Garside |
| Tác giả: |
P. Dehornoy, Groupes de Garside, Annales Scientifiques de l’ ´ Ecole Normale Sup´ e- rieure 35 |
| Năm: |
2002 |
|
| [6] P. Dehornoy and L. Paris, Gaussian groups and Garside groups, two generalisations of Artin groups, Proceedings of the London Mathematical Society 79 (1999), 569–604 |
Sách, tạp chí |
| Tiêu đề: |
Gaussian groups and Garside groups, two generalisationsof Artin groups |
| Tác giả: |
P. Dehornoy and L. Paris, Gaussian groups and Garside groups, two generalisations of Artin groups, Proceedings of the London Mathematical Society 79 |
| Năm: |
1999 |
|
| [8] D. Garber, Braid group cryptography,www.ims.nus.edu.sg/Programs/braids/files/david.pdf |
Sách, tạp chí |
| Tiêu đề: |
Braid group cryptography |
|
| [9] D. Garber, S. Kaplan, M. Teicher, B. Tsaban, and U. Vishne, Length-based conjugacy search in the Braid group, Contemporary Mathematics 418 (2006), 75–87 |
Sách, tạp chí |
| Tiêu đề: |
Length-based conjugacysearch in the Braid group |
| Tác giả: |
D. Garber, S. Kaplan, M. Teicher, B. Tsaban, and U. Vishne, Length-based conjugacy search in the Braid group, Contemporary Mathematics 418 |
| Năm: |
2006 |
|
| [10] D. Garber, S. Kaplan, M. Teicher, B. Tsaban, and U. Vishne, Probabilistic solutions of equations in the braid group, Advances in Applied Mathematics 35 (2005), 323–334 |
Sách, tạp chí |
| Tiêu đề: |
Probabilistic solutionsof equations in the braid group |
| Tác giả: |
D. Garber, S. Kaplan, M. Teicher, B. Tsaban, and U. Vishne, Probabilistic solutions of equations in the braid group, Advances in Applied Mathematics 35 |
| Năm: |
2005 |
|
| [11] J. Hughes and A. Tannenbaum, Length-based attacks for certain group based en- cryption rewriting systems, Workshop SECI02 S´ ecurit´ e de la Communication sur Internet, September 2002 |
Sách, tạp chí |
| Tiêu đề: |
Length-based attacks for certain group based en-cryption rewriting systems |
|
| [12] K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, S.J. Kang and C.S. Park, New Public- key Cryptosystem using Braid Groups, CRYPTO 2000, Lecture Notes in Computer Science 1880 (2000), 166–183 |
Sách, tạp chí |
| Tiêu đề: |
New Public-key Cryptosystem using Braid Groups |
| Tác giả: |
K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, S.J. Kang and C.S. Park, New Public- key Cryptosystem using Braid Groups, CRYPTO 2000, Lecture Notes in Computer Science 1880 |
| Năm: |
2000 |
|
| [13] A. Myasnikov, V. Shpilrain, and A. Ushakov, A practical attack on some braid group based cryptographic protocols, in: CRYPTO 2005, Lecture Notes in Computer Science 3621 (2005), 86–96 |
Sách, tạp chí |
| Tiêu đề: |
A practical attack on some braid groupbased cryptographic protocols |
| Tác giả: |
A. Myasnikov, V. Shpilrain, and A. Ushakov, A practical attack on some braid group based cryptographic protocols, in: CRYPTO 2005, Lecture Notes in Computer Science 3621 |
| Năm: |
2005 |
|
| [15] M. Paterson and A. Razborov, The set of minimal braids is co-NP-complete, Journal of Algorithms 12 (1991), 393–408 |
Sách, tạp chí |
| Tiêu đề: |
The set of minimal braids is co-NP-complete |
| Tác giả: |
M. Paterson and A. Razborov, The set of minimal braids is co-NP-complete, Journal of Algorithms 12 |
| Năm: |
1991 |
|
| [16] D. Ruinskiy, A. Shamir, and B. Tsaban, Length-based cryptanalysis: The case of Thompson’s Group, Journal of Mathematical Cryptology 1 (2007), 359–372 |
Sách, tạp chí |
| Tiêu đề: |
Length-based cryptanalysis: The case ofThompson’s Group |
| Tác giả: |
D. Ruinskiy, A. Shamir, and B. Tsaban, Length-based cryptanalysis: The case of Thompson’s Group, Journal of Mathematical Cryptology 1 |
| Năm: |
2007 |
|
| [7] D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, and W. Thurston, Word Processing in Groups, Jones and Bartlett Publishers, Boston: 1992 |
Khác |
|
| [14] A. Myasnikov, V. Shpilrain, and A. Ushakov, Group-based cryptography, Advanced Courses in Mathematics – CRM Barcelona, Birkh¨ auser, 2008 |
Khác |
|