A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/iacr/CheonJ03
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/iacr/CheonJ03
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Byungheup_Jun
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jung_Hee_Cheon
>
foaf:
homepage
<
http://eprint.iacr.org/2003/019
>
dc:
identifier
DBLP journals/iacr/CheonJ03
(xsd:string)
dcterms:
issued
2003
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/iacr
>
rdfs:
label
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Byungheup_Jun
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jung_Hee_Cheon
>
swrc:
pages
19
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/iacr/CheonJ03/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/iacr/CheonJ03
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/iacr/iacr2003.html#CheonJ03
>
rdfs:
seeAlso
<
http://eprint.iacr.org/2003/019
>
dc:
title
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
2003
(xsd:string)