The Elliptic Curve Digital Signature Algorithm (ECDSA) View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2001-08

AUTHORS

Don Johnson, Alfred Menezes, Scott Vanstone

ABSTRACT

The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It was accepted in 1999 as an ANSI standard and in 2000 as IEEE and NIST standards. It was also accepted in 1998 as an ISO standard and is under consideration for inclusion in some other ISO standards. Unlike the ordinary discrete logarithm problem and the integer factorization problem, no subexponential-time algorithm is known for the elliptic curve discrete logarithm problem. For this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves. This paper describes the ANSI X9.62 ECDSA, and discusses related security, implementation, and interoperability issues. More... »

PAGES

36-63

Journal

Author Affiliations

Related Patents

  • Accelerated Verification Of Digital Signatures And Public Keys
  • Threshold Digital Signature Method And System
  • Systems And Methods For Distributed Identity Verification
  • Controlled Secure Code Authentication
  • Accelerated Verification Of Digital Signatures And Public Keys
  • Verifying Implicit Certificates And Digital Signatures
  • Controlled Secure Code Authentication
  • Generating Signatures Using A Secure Device
  • Accelerated Verification Of Digital Signatures And Public Keys
  • Data Processing Method, Program Thereof, Device Thereof, And Recording Medium
  • Compressed Ecdsa Signatures
  • Data Processing Method, Program Thereof, Device Thereof, And Recording Medium
  • Systems And Methods For Distributed Data Sharing With Asynchronous Third-Party Attestation
  • Compressed Ecdsa Signatures
  • Unique Code In Message For Signature Generation In Asymmetric Cryptographic Device
  • Method For Secure And Resilient Distributed Generation Of Elliptic Curve Digital Signature Algorithm (Ecdsa) Based Digital Signatures With Proactive Security
  • Generating Keys Using Secure Hardware
  • Method For Securing Messages
  • Accelerated Verification Of Digital Signatures And Public Keys
  • System And Method For Protecting Cryptographic Assets From A White-Box Attack
  • Accelerated Verification Of Digital Signatures And Public Keys
  • Systems And Methods For Distributed Identity Verification
  • Elliptic Curve Cryptography With Fragmented Key Processing And Methods For Use Therewith
  • Method For Securing Messages
  • Message Authentication With Secure Code Verification
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s102070100002

    DOI

    http://dx.doi.org/10.1007/s102070100002

    DIMENSIONS

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


    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/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "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"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Certicom Research, Canada, Canada", 
              "id": "http://www.grid.ac/institutes/grid.439950.2", 
              "name": [
                "Certicom Research, Canada, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Johnson", 
            "givenName": "Don", 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Certicom Research, Canada, Canada", 
              "id": "http://www.grid.ac/institutes/grid.439950.2", 
              "name": [
                "Certicom Research, Canada, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Menezes", 
            "givenName": "Alfred", 
            "id": "sg:person.012711653371.43", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012711653371.43"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Certicom Research, Canada, Canada", 
              "id": "http://www.grid.ac/institutes/grid.439950.2", 
              "name": [
                "Certicom Research, Canada, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Vanstone", 
            "givenName": "Scott", 
            "type": "Person"
          }
        ], 
        "datePublished": "2001-08", 
        "datePublishedReg": "2001-08-01", 
        "description": "The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It was accepted in 1999 as an ANSI standard and in 2000 as IEEE and NIST standards. It was also accepted in 1998 as an ISO standard and is under consideration for inclusion in some other ISO standards. Unlike the ordinary discrete logarithm problem and the integer factorization problem, no subexponential-time algorithm is known for the elliptic curve discrete logarithm problem. For this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves. This paper describes the ANSI X9.62 ECDSA, and discusses related security, implementation, and interoperability issues.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s102070100002", 
        "inLanguage": "en", 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136826", 
            "issn": [
              "1615-5262", 
              "1615-5270"
            ], 
            "name": "International Journal of Information Security", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "1", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "1"
          }
        ], 
        "keywords": [
          "Elliptic Curve Digital Signature Algorithm", 
          "Digital Signature Algorithm", 
          "discrete logarithm problem", 
          "signature algorithm", 
          "logarithm problem", 
          "elliptic curve discrete logarithm problem", 
          "integer factorization problem", 
          "subexponential-time algorithm", 
          "elliptic curve analogue", 
          "interoperability issues", 
          "ISO standards", 
          "elliptic curves", 
          "algorithm", 
          "factorization problem", 
          "NIST standards", 
          "ANSI standard", 
          "security", 
          "IEEE", 
          "implementation", 
          "standards", 
          "issues", 
          "discusses", 
          "consideration", 
          "reasons", 
          "curves", 
          "inclusion", 
          "strength", 
          "analogues", 
          "problem", 
          "paper", 
          "Curve Digital Signature Algorithm", 
          "curve analogue", 
          "ordinary discrete logarithm problem", 
          "curve discrete logarithm problem"
        ], 
        "name": "The Elliptic Curve Digital Signature Algorithm (ECDSA)", 
        "pagination": "36-63", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1043653709"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s102070100002"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s102070100002", 
          "https://app.dimensions.ai/details/publication/pub.1043653709"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2021-12-01T19:11", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/article/article_316.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s102070100002"
      }
    ]
     

    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/s102070100002'

    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/s102070100002'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s102070100002'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s102070100002'


     

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

    104 TRIPLES      21 PREDICATES      60 URIs      52 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s102070100002 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N7c71b98bbf9f44568f5314667dabb199
    4 schema:datePublished 2001-08
    5 schema:datePublishedReg 2001-08-01
    6 schema:description The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It was accepted in 1999 as an ANSI standard and in 2000 as IEEE and NIST standards. It was also accepted in 1998 as an ISO standard and is under consideration for inclusion in some other ISO standards. Unlike the ordinary discrete logarithm problem and the integer factorization problem, no subexponential-time algorithm is known for the elliptic curve discrete logarithm problem. For this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves. This paper describes the ANSI X9.62 ECDSA, and discusses related security, implementation, and interoperability issues.
    7 schema:genre article
    8 schema:inLanguage en
    9 schema:isAccessibleForFree false
    10 schema:isPartOf N65137447534343088049fe59bbce1b5b
    11 Nfd261e16c6904197a6a76191ea06965d
    12 sg:journal.1136826
    13 schema:keywords ANSI standard
    14 Curve Digital Signature Algorithm
    15 Digital Signature Algorithm
    16 Elliptic Curve Digital Signature Algorithm
    17 IEEE
    18 ISO standards
    19 NIST standards
    20 algorithm
    21 analogues
    22 consideration
    23 curve analogue
    24 curve discrete logarithm problem
    25 curves
    26 discrete logarithm problem
    27 discusses
    28 elliptic curve analogue
    29 elliptic curve discrete logarithm problem
    30 elliptic curves
    31 factorization problem
    32 implementation
    33 inclusion
    34 integer factorization problem
    35 interoperability issues
    36 issues
    37 logarithm problem
    38 ordinary discrete logarithm problem
    39 paper
    40 problem
    41 reasons
    42 security
    43 signature algorithm
    44 standards
    45 strength
    46 subexponential-time algorithm
    47 schema:name The Elliptic Curve Digital Signature Algorithm (ECDSA)
    48 schema:pagination 36-63
    49 schema:productId N3d51cbdfc0f44ac3b69542195c56f80d
    50 N5abe512eda104545b51cb4359166d921
    51 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043653709
    52 https://doi.org/10.1007/s102070100002
    53 schema:sdDatePublished 2021-12-01T19:11
    54 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    55 schema:sdPublisher N72c03938c28241bca3f7fe1a8cb5d2ba
    56 schema:url https://doi.org/10.1007/s102070100002
    57 sgo:license sg:explorer/license/
    58 sgo:sdDataset articles
    59 rdf:type schema:ScholarlyArticle
    60 N3d51cbdfc0f44ac3b69542195c56f80d schema:name doi
    61 schema:value 10.1007/s102070100002
    62 rdf:type schema:PropertyValue
    63 N5abe512eda104545b51cb4359166d921 schema:name dimensions_id
    64 schema:value pub.1043653709
    65 rdf:type schema:PropertyValue
    66 N65137447534343088049fe59bbce1b5b schema:volumeNumber 1
    67 rdf:type schema:PublicationVolume
    68 N72c03938c28241bca3f7fe1a8cb5d2ba schema:name Springer Nature - SN SciGraph project
    69 rdf:type schema:Organization
    70 N7c71b98bbf9f44568f5314667dabb199 rdf:first Ndb1669dd705146df9c126a89b7299426
    71 rdf:rest Nd099ffb7ac68496aadc18ee69769fd32
    72 N807c00ccc1714a51afdde87cb3b187f8 rdf:first Ndf6b6ed1b072408f9b5ac5bc7d10df64
    73 rdf:rest rdf:nil
    74 Nd099ffb7ac68496aadc18ee69769fd32 rdf:first sg:person.012711653371.43
    75 rdf:rest N807c00ccc1714a51afdde87cb3b187f8
    76 Ndb1669dd705146df9c126a89b7299426 schema:affiliation grid-institutes:grid.439950.2
    77 schema:familyName Johnson
    78 schema:givenName Don
    79 rdf:type schema:Person
    80 Ndf6b6ed1b072408f9b5ac5bc7d10df64 schema:affiliation grid-institutes:grid.439950.2
    81 schema:familyName Vanstone
    82 schema:givenName Scott
    83 rdf:type schema:Person
    84 Nfd261e16c6904197a6a76191ea06965d schema:issueNumber 1
    85 rdf:type schema:PublicationIssue
    86 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    87 schema:name Information and Computing Sciences
    88 rdf:type schema:DefinedTerm
    89 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    90 schema:name Computation Theory and Mathematics
    91 rdf:type schema:DefinedTerm
    92 sg:journal.1136826 schema:issn 1615-5262
    93 1615-5270
    94 schema:name International Journal of Information Security
    95 schema:publisher Springer Nature
    96 rdf:type schema:Periodical
    97 sg:person.012711653371.43 schema:affiliation grid-institutes:grid.439950.2
    98 schema:familyName Menezes
    99 schema:givenName Alfred
    100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012711653371.43
    101 rdf:type schema:Person
    102 grid-institutes:grid.439950.2 schema:alternateName Certicom Research, Canada, Canada
    103 schema:name Certicom Research, Canada, Canada
    104 rdf:type schema:Organization
     




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


    ...