Complexity of the generalized conjugacy problem
Recently, the generalized conjugacy problem(GCP) in braid groups was introduced as a candidate for cryptographic one-way function. A GCP in a braid group can be transformed into a GCP in a general linear group by the Burau representation. We study the latter problem induced in this way. (C) 2003 Elsevier B.V. All rights reserved.
- Publisher
- ELSEVIER SCIENCE BV
- Issue Date
- 2003-08
- Language
- English
- Article Type
- Article; Proceedings Paper
- Citation
DISCRETE APPLIED MATHEMATICS, v.130, no.1, pp.33 - 36
- ISSN
- 0166-218X
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 2 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.