Complexity of the generalized conjugacy problem

Authors:
Sang Geun Hahn;Eonkyung Lee;Je Hong Park
Affiliations:
Department of Mathematics, Korea Advanced Institute of Science and Technology, Taejon 305-701, South Korea;Department of Mathematics, Korea Advanced Institute of Science and Technology, Taejon 305-701, South Korea;Department of Mathematics, Korea Advanced Institute of Science and Technology, Taejon 305-701, South Korea
Venue:
Discrete Applied Mathematics - Special issue on the 2000 com2MaC workshop on cryptography
Year:
2003

Citing 0
Cited 1

Cryptanalysis of the public-key encryption based on braid groups

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.