DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hahn, Sang-Geun | ko |
dc.contributor.author | Lee, E | ko |
dc.contributor.author | Park, JH | ko |
dc.date.accessioned | 2013-03-03T16:59:56Z | - |
dc.date.available | 2013-03-03T16:59:56Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2003-08 | - |
dc.identifier.citation | DISCRETE APPLIED MATHEMATICS, v.130, no.1, pp.33 - 36 | - |
dc.identifier.issn | 0166-218X | - |
dc.identifier.uri | http://hdl.handle.net/10203/79584 | - |
dc.description.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. (C) 2003 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Complexity of the generalized conjugacy problem | - |
dc.type | Article | - |
dc.identifier.wosid | 000185119700004 | - |
dc.identifier.scopusid | 2-s2.0-0042969274 | - |
dc.type.rims | ART | - |
dc.citation.volume | 130 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 33 | - |
dc.citation.endingpage | 36 | - |
dc.citation.publicationname | DISCRETE APPLIED MATHEMATICS | - |
dc.contributor.localauthor | Hahn, Sang-Geun | - |
dc.contributor.nonIdAuthor | Lee, E | - |
dc.contributor.nonIdAuthor | Park, JH | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
dc.subject.keywordAuthor | generalized conjugacy problem | - |
dc.subject.keywordAuthor | Burau representation | - |
dc.subject.keywordAuthor | braid group | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.