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.

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 130; no. 1; pp. 33 - 36
Main Authors Geun Hahn, Sang, Lee, Eonkyung, Hong Park, Je
Format Journal Article Conference Proceeding
LanguageEnglish
Published Lausanne Elsevier B.V 2003
Amsterdam Elsevier
New York, NY
Subjects
Algebra
Applied sciences
Braid group
Burau representation
Cryptography
Exact sciences and technology
Generalized conjugacy problem
Group theory
Group theory and generalizations
Information, signal and communications theory
Mathematics
Number theory
Sciences and techniques of general use
Signal and communications theory
Telecommunications and information theory
Braid group
Generalized conjugacy problem
Burau representation
Group theory
Linear group
Functions
Problem
Representation
Cryptography
Complexity
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(02)00587-5