Vulnerability of Cryptographic Primitives Based on the Power Conjugacy Search Problem in Quantum Computing View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2014-09

AUTHORS

A. V. Fesenko

ABSTRACT

This paper shows the existence of an efficient algorithm to solve the generalized discrete logarithm problem in quantum computing by reducing it to the Abelian hidden subgroup problem. The proposed method can also efficiently solve a partial power conjugacy search problem whose complexity in some groups underlies the resistance of several cryptographic systems and protocols in quantum computing. More... »

PAGES

815-816

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s10559-014-9672-y

DOI

http://dx.doi.org/10.1007/s10559-014-9672-y

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1005918440


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "National Technical University of Ukraine Kiev Polytechnic Institute", 
          "id": "https://www.grid.ac/institutes/grid.440544.5", 
          "name": [
            "Physicotechnical Institute of the National Technical University of Ukraine \u201cKyiv Polytechnic Institute\u201d, Kyiv, Ukraine"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fesenko", 
        "givenName": "A. V.", 
        "id": "sg:person.015377530167.13", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015377530167.13"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-3-642-14706-7_14", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1017853541", 
          "https://doi.org/10.1007/978-3-642-14706-7_14"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1070/rm1997v052n06abeh002155", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1058196987"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2014-09", 
    "datePublishedReg": "2014-09-01", 
    "description": "This paper shows the existence of an efficient algorithm to solve the generalized discrete logarithm problem in quantum computing by reducing it to the Abelian hidden subgroup problem. The proposed method can also efficiently solve a partial power conjugacy search problem whose complexity in some groups underlies the resistance of several cryptographic systems and protocols in quantum computing.", 
    "genre": "non_research_article", 
    "id": "sg:pub.10.1007/s10559-014-9672-y", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1130475", 
        "issn": [
          "1060-0396", 
          "1573-8337"
        ], 
        "name": "Cybernetics and Systems Analysis", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "5", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "50"
      }
    ], 
    "name": "Vulnerability of Cryptographic Primitives Based on the Power Conjugacy Search Problem in Quantum Computing", 
    "pagination": "815-816", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "1c3219b27562daa73389973c75be9bf8081089d58ac75249fd5081e48225296d"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s10559-014-9672-y"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1005918440"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s10559-014-9672-y", 
      "https://app.dimensions.ai/details/publication/pub.1005918440"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T15:51", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8664_00000510.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2Fs10559-014-9672-y"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10559-014-9672-y'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10559-014-9672-y'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10559-014-9672-y'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10559-014-9672-y'


 

This table displays all metadata directly associated to this object as RDF triples.

68 TRIPLES      21 PREDICATES      29 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s10559-014-9672-y schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Na751d5ad499c4e039cc93ab2d2cb7855
4 schema:citation sg:pub.10.1007/978-3-642-14706-7_14
5 https://doi.org/10.1070/rm1997v052n06abeh002155
6 schema:datePublished 2014-09
7 schema:datePublishedReg 2014-09-01
8 schema:description This paper shows the existence of an efficient algorithm to solve the generalized discrete logarithm problem in quantum computing by reducing it to the Abelian hidden subgroup problem. The proposed method can also efficiently solve a partial power conjugacy search problem whose complexity in some groups underlies the resistance of several cryptographic systems and protocols in quantum computing.
9 schema:genre non_research_article
10 schema:inLanguage en
11 schema:isAccessibleForFree false
12 schema:isPartOf N9cc39497b1f14ffabe80a0bf9c4b2f3c
13 Nbd91dfd732b946a29876522df4daf27e
14 sg:journal.1130475
15 schema:name Vulnerability of Cryptographic Primitives Based on the Power Conjugacy Search Problem in Quantum Computing
16 schema:pagination 815-816
17 schema:productId N5534024031884e41bfa6779cefb4baec
18 N58f62cf297d94e43a31a59d50c4fe606
19 N790dec22528c4fbfabcc4dba9345e0bf
20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005918440
21 https://doi.org/10.1007/s10559-014-9672-y
22 schema:sdDatePublished 2019-04-10T15:51
23 schema:sdLicense https://scigraph.springernature.com/explorer/license/
24 schema:sdPublisher Nd3ded895ecef43bcbb045a142983676d
25 schema:url http://link.springer.com/10.1007%2Fs10559-014-9672-y
26 sgo:license sg:explorer/license/
27 sgo:sdDataset articles
28 rdf:type schema:ScholarlyArticle
29 N5534024031884e41bfa6779cefb4baec schema:name readcube_id
30 schema:value 1c3219b27562daa73389973c75be9bf8081089d58ac75249fd5081e48225296d
31 rdf:type schema:PropertyValue
32 N58f62cf297d94e43a31a59d50c4fe606 schema:name dimensions_id
33 schema:value pub.1005918440
34 rdf:type schema:PropertyValue
35 N790dec22528c4fbfabcc4dba9345e0bf schema:name doi
36 schema:value 10.1007/s10559-014-9672-y
37 rdf:type schema:PropertyValue
38 N9cc39497b1f14ffabe80a0bf9c4b2f3c schema:issueNumber 5
39 rdf:type schema:PublicationIssue
40 Na751d5ad499c4e039cc93ab2d2cb7855 rdf:first sg:person.015377530167.13
41 rdf:rest rdf:nil
42 Nbd91dfd732b946a29876522df4daf27e schema:volumeNumber 50
43 rdf:type schema:PublicationVolume
44 Nd3ded895ecef43bcbb045a142983676d schema:name Springer Nature - SN SciGraph project
45 rdf:type schema:Organization
46 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
47 schema:name Information and Computing Sciences
48 rdf:type schema:DefinedTerm
49 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
50 schema:name Computation Theory and Mathematics
51 rdf:type schema:DefinedTerm
52 sg:journal.1130475 schema:issn 1060-0396
53 1573-8337
54 schema:name Cybernetics and Systems Analysis
55 rdf:type schema:Periodical
56 sg:person.015377530167.13 schema:affiliation https://www.grid.ac/institutes/grid.440544.5
57 schema:familyName Fesenko
58 schema:givenName A. V.
59 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015377530167.13
60 rdf:type schema:Person
61 sg:pub.10.1007/978-3-642-14706-7_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017853541
62 https://doi.org/10.1007/978-3-642-14706-7_14
63 rdf:type schema:CreativeWork
64 https://doi.org/10.1070/rm1997v052n06abeh002155 schema:sameAs https://app.dimensions.ai/details/publication/pub.1058196987
65 rdf:type schema:CreativeWork
66 https://www.grid.ac/institutes/grid.440544.5 schema:alternateName National Technical University of Ukraine Kiev Polytechnic Institute
67 schema:name Physicotechnical Institute of the National Technical University of Ukraine “Kyiv Polytechnic Institute”, Kyiv, Ukraine
68 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...