Complexity of the generalized conjugacy problem

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 300
  • Download : 0
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
URI
http://hdl.handle.net/10203/79584
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 webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0