Complexity of the generalized conjugacy problem

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 711
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorHahn, Sang-Geunko
dc.contributor.authorLee, Eko
dc.contributor.authorPark, JHko
dc.date.accessioned2013-03-03T16:59:56Z-
dc.date.available2013-03-03T16:59:56Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2003-08-
dc.identifier.citationDISCRETE APPLIED MATHEMATICS, v.130, no.1, pp.33 - 36-
dc.identifier.issn0166-218X-
dc.identifier.urihttp://hdl.handle.net/10203/79584-
dc.description.abstractRecently, 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.languageEnglish-
dc.publisherELSEVIER SCIENCE BV-
dc.titleComplexity of the generalized conjugacy problem-
dc.typeArticle-
dc.identifier.wosid000185119700004-
dc.identifier.scopusid2-s2.0-0042969274-
dc.type.rimsART-
dc.citation.volume130-
dc.citation.issue1-
dc.citation.beginningpage33-
dc.citation.endingpage36-
dc.citation.publicationnameDISCRETE APPLIED MATHEMATICS-
dc.contributor.localauthorHahn, Sang-Geun-
dc.contributor.nonIdAuthorLee, E-
dc.contributor.nonIdAuthorPark, JH-
dc.type.journalArticleArticle; Proceedings Paper-
dc.subject.keywordAuthorgeneralized conjugacy problem-
dc.subject.keywordAuthorBurau representation-
dc.subject.keywordAuthorbraid group-
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