Security Evaluation for Elliptic Curve Pairing-based Cryptography with Conjugate Rational Points by Distributed and Parallelized Experiments View Homepage


Ontology type: schema:MonetaryGrant     


Grant Info

YEARS

2013-2016

FUNDING AMOUNT

14170000 JPY

ABSTRACT

In order to evaluate the security of elliptic curve pairing-based cryptography, this research has considered several attacking method, particularly rho method with some improvements and experiments. In detail, this research discussed a random number generator for efficiently carrying out random walks of rational points and then discussed an efficient distributed parallel attacks. Then, this paper also developed some efficient arithmetic operations on elliptic curve and evaluated some other approaches that kept all of generated random rational points for the attack in contrast to rho method. As a result, this research could show that 88 bit pairing-based cryptography could be broken with about three hours computation by 4 PCs. This research still keeps on attacking 114 bit pairing-based cryptography. More... »

URL

https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-25280047

Related SciGraph Publications

  • 2015. Discrete Logarithms for Torsion Points on Elliptic Curve of Embedding Degree $$1$$ in INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2014
  • 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/2208", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "type": "DefinedTerm"
          }
        ], 
        "amount": {
          "currency": "JPY", 
          "type": "MonetaryAmount", 
          "value": "14170000"
        }, 
        "description": "In order to evaluate the security of elliptic curve pairing-based cryptography, this research has considered several attacking method, particularly rho method with some improvements and experiments. In detail, this research discussed a random number generator for efficiently carrying out random walks of rational points and then discussed an efficient distributed parallel attacks. Then, this paper also developed some efficient arithmetic operations on elliptic curve and evaluated some other approaches that kept all of generated random rational points for the attack in contrast to rho method. As a result, this research could show that 88 bit pairing-based cryptography could be broken with about three hours computation by 4 PCs. This research still keeps on attacking 114 bit pairing-based cryptography.", 
        "endDate": "2016-03-31T00:00:00Z", 
        "funder": {
          "id": "https://www.grid.ac/institutes/grid.54432.34", 
          "type": "Organization"
        }, 
        "id": "sg:grant.6107922", 
        "identifier": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "6107922"
            ]
          }, 
          {
            "name": "kaken_id", 
            "type": "PropertyValue", 
            "value": [
              "25280047"
            ]
          }
        ], 
        "inLanguage": [
          "en"
        ], 
        "keywords": [
          "cryptography", 
          "METHODS", 
          "elliptic curve pairings", 
          "other approaches", 
          "bit", 
          "attack", 
          "security evaluation", 
          "pairing-based cryptography", 
          "contrast", 
          "Conjugate Rational Points", 
          "paper", 
          "rational points", 
          "random rational points", 
          "Parallelized Experiments", 
          "random number generator", 
          "improvement", 
          "research", 
          "detail", 
          "efficient arithmetic operations", 
          "order", 
          "hours computation", 
          "elliptic curves", 
          "random walk", 
          "Rho method", 
          "PC", 
          "experiments", 
          "parallel attacks", 
          "Distributed", 
          "security", 
          "results"
        ], 
        "name": "Security Evaluation for Elliptic Curve Pairing-based Cryptography with Conjugate Rational Points by Distributed and Parallelized Experiments", 
        "recipient": [
          {
            "id": "https://www.grid.ac/institutes/grid.261356.5", 
            "type": "Organization"
          }
        ], 
        "sameAs": [
          "https://app.dimensions.ai/details/grant/grant.6107922"
        ], 
        "sdDataset": "grants", 
        "sdDatePublished": "2021-01-18T09:03", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com.uberresearch.data.processor/core_data/20181219_192338/projects/base/kaken_projects_30.xml.gz", 
        "startDate": "2013-04-01T00:00:00Z", 
        "type": "MonetaryGrant", 
        "url": "https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-25280047"
      }
    ]
     

    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/grant.6107922'

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

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/grant.6107922'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/grant.6107922'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/grant.6107922'


     

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

    64 TRIPLES      19 PREDICATES      50 URIs      43 LITERALS      4 BLANK NODES

    Subject Predicate Object
    1 sg:grant.6107922 schema:about anzsrc-for:2208
    2 schema:amount N21339ace7ab142bdb4025a991c1f9f2f
    3 schema:description In order to evaluate the security of elliptic curve pairing-based cryptography, this research has considered several attacking method, particularly rho method with some improvements and experiments. In detail, this research discussed a random number generator for efficiently carrying out random walks of rational points and then discussed an efficient distributed parallel attacks. Then, this paper also developed some efficient arithmetic operations on elliptic curve and evaluated some other approaches that kept all of generated random rational points for the attack in contrast to rho method. As a result, this research could show that 88 bit pairing-based cryptography could be broken with about three hours computation by 4 PCs. This research still keeps on attacking 114 bit pairing-based cryptography.
    4 schema:endDate 2016-03-31T00:00:00Z
    5 schema:funder https://www.grid.ac/institutes/grid.54432.34
    6 schema:identifier N9739703396c24c899f24c0dfd1360141
    7 N99bbd40593dc4b1bbb4d084537ab64ac
    8 schema:inLanguage en
    9 schema:keywords Conjugate Rational Points
    10 Distributed
    11 METHODS
    12 PC
    13 Parallelized Experiments
    14 Rho method
    15 attack
    16 bit
    17 contrast
    18 cryptography
    19 detail
    20 efficient arithmetic operations
    21 elliptic curve pairings
    22 elliptic curves
    23 experiments
    24 hours computation
    25 improvement
    26 order
    27 other approaches
    28 pairing-based cryptography
    29 paper
    30 parallel attacks
    31 random number generator
    32 random rational points
    33 random walk
    34 rational points
    35 research
    36 results
    37 security
    38 security evaluation
    39 schema:name Security Evaluation for Elliptic Curve Pairing-based Cryptography with Conjugate Rational Points by Distributed and Parallelized Experiments
    40 schema:recipient https://www.grid.ac/institutes/grid.261356.5
    41 schema:sameAs https://app.dimensions.ai/details/grant/grant.6107922
    42 schema:sdDatePublished 2021-01-18T09:03
    43 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    44 schema:sdPublisher Nb5f90d1c3bea411f9db741447751d066
    45 schema:startDate 2013-04-01T00:00:00Z
    46 schema:url https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-25280047
    47 sgo:license sg:explorer/license/
    48 sgo:sdDataset grants
    49 rdf:type schema:MonetaryGrant
    50 N21339ace7ab142bdb4025a991c1f9f2f schema:currency JPY
    51 schema:value 14170000
    52 rdf:type schema:MonetaryAmount
    53 N9739703396c24c899f24c0dfd1360141 schema:name kaken_id
    54 schema:value 25280047
    55 rdf:type schema:PropertyValue
    56 N99bbd40593dc4b1bbb4d084537ab64ac schema:name dimensions_id
    57 schema:value 6107922
    58 rdf:type schema:PropertyValue
    59 Nb5f90d1c3bea411f9db741447751d066 schema:name Springer Nature - SN SciGraph project
    60 rdf:type schema:Organization
    61 anzsrc-for:2208 schema:inDefinedTermSet anzsrc-for:
    62 rdf:type schema:DefinedTerm
    63 https://www.grid.ac/institutes/grid.261356.5 schema:Organization
    64 https://www.grid.ac/institutes/grid.54432.34 schema:Organization
     




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


    ...