Complexity of the generalized conjugacy problem

✍ Scribed by Sang Geun Hahn; Eonkyung Lee; Je Hong Park

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 100 KB
• Volume: 130
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/s0166-218x(02)00587-5

✦ Synopsis

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.