Use of Elliptic Curves in Cryptography View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1986

AUTHORS

Victor S. Miller

ABSTRACT

We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% faster than the Diffie-Hellmann scheme over GF(p). As computational power grows, this disparity should get rapidly bigger. More... »

PAGES

417-426

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-39799-x_31

DOI

http://dx.doi.org/10.1007/3-540-39799-x_31

DIMENSIONS

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


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": "Exploratory Computer Science, IBM Research, P.O. Box 218, 10598, Yorktown Heights, NY", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "Exploratory Computer Science, IBM Research, P.O. Box 218, 10598, Yorktown Heights, NY"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Miller", 
        "givenName": "Victor S.", 
        "id": "sg:person.015613324111.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015613324111.07"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1986", 
    "datePublishedReg": "1986-01-01", 
    "description": "We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% faster than the Diffie-Hellmann scheme over GF(p). As computational power grows, this disparity should get rapidly bigger.", 
    "editor": [
      {
        "familyName": "Williams", 
        "givenName": "Hugh C.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-39799-x_31", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-16463-0"
      ], 
      "name": "Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings", 
      "type": "Book"
    }, 
    "keywords": [
      "elliptic curves", 
      "key exchange protocol", 
      "computational power", 
      "exchange protocol", 
      "current bounds", 
      "cryptography", 
      "bounds", 
      "attacks", 
      "Adleman", 
      "scheme", 
      "curves", 
      "protocol", 
      "power", 
      "use", 
      "style", 
      "Miller", 
      "analogues", 
      "disparities", 
      "Western"
    ], 
    "name": "Use of Elliptic Curves in Cryptography", 
    "pagination": "417-426", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1022380878"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-39799-x_31"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-39799-x_31", 
      "https://app.dimensions.ai/details/publication/pub.1022380878"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-12-01T06:52", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20221201/entities/gbq_results/chapter/chapter_381.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-39799-x_31"
  }
]
 

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/3-540-39799-x_31'

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/3-540-39799-x_31'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-39799-x_31'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-39799-x_31'


 

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

77 TRIPLES      22 PREDICATES      44 URIs      37 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-39799-x_31 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N78a8cebd482b4040998c1f60b34476f8
4 schema:datePublished 1986
5 schema:datePublishedReg 1986-01-01
6 schema:description We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% faster than the Diffie-Hellmann scheme over GF(p). As computational power grows, this disparity should get rapidly bigger.
7 schema:editor N0645dd1bec5146be8a6588abb4ce202c
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf N52d008ef11ba4ce2b3064358c328b9ff
11 schema:keywords Adleman
12 Miller
13 Western
14 analogues
15 attacks
16 bounds
17 computational power
18 cryptography
19 current bounds
20 curves
21 disparities
22 elliptic curves
23 exchange protocol
24 key exchange protocol
25 power
26 protocol
27 scheme
28 style
29 use
30 schema:name Use of Elliptic Curves in Cryptography
31 schema:pagination 417-426
32 schema:productId Ne2cf9e20a1d2463b95a03b432602df20
33 Nf58f785abf1c42808b93f574048622fd
34 schema:publisher Ne7ba979a765746b8a2f186d0d743ed5a
35 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022380878
36 https://doi.org/10.1007/3-540-39799-x_31
37 schema:sdDatePublished 2022-12-01T06:52
38 schema:sdLicense https://scigraph.springernature.com/explorer/license/
39 schema:sdPublisher N382a5b88ccba4139bc0906cec5459ac9
40 schema:url https://doi.org/10.1007/3-540-39799-x_31
41 sgo:license sg:explorer/license/
42 sgo:sdDataset chapters
43 rdf:type schema:Chapter
44 N0645dd1bec5146be8a6588abb4ce202c rdf:first N31c97188267f4d8585cbebf8680a7f2f
45 rdf:rest rdf:nil
46 N31c97188267f4d8585cbebf8680a7f2f schema:familyName Williams
47 schema:givenName Hugh C.
48 rdf:type schema:Person
49 N382a5b88ccba4139bc0906cec5459ac9 schema:name Springer Nature - SN SciGraph project
50 rdf:type schema:Organization
51 N52d008ef11ba4ce2b3064358c328b9ff schema:isbn 978-3-540-16463-0
52 schema:name Advances in Cryptology — CRYPTO ’85 Proceedings
53 rdf:type schema:Book
54 N78a8cebd482b4040998c1f60b34476f8 rdf:first sg:person.015613324111.07
55 rdf:rest rdf:nil
56 Ne2cf9e20a1d2463b95a03b432602df20 schema:name dimensions_id
57 schema:value pub.1022380878
58 rdf:type schema:PropertyValue
59 Ne7ba979a765746b8a2f186d0d743ed5a schema:name Springer Nature
60 rdf:type schema:Organisation
61 Nf58f785abf1c42808b93f574048622fd schema:name doi
62 schema:value 10.1007/3-540-39799-x_31
63 rdf:type schema:PropertyValue
64 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
65 schema:name Information and Computing Sciences
66 rdf:type schema:DefinedTerm
67 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
68 schema:name Computation Theory and Mathematics
69 rdf:type schema:DefinedTerm
70 sg:person.015613324111.07 schema:affiliation grid-institutes:grid.481554.9
71 schema:familyName Miller
72 schema:givenName Victor S.
73 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015613324111.07
74 rdf:type schema:Person
75 grid-institutes:grid.481554.9 schema:alternateName Exploratory Computer Science, IBM Research, P.O. Box 218, 10598, Yorktown Heights, NY
76 schema:name Exploratory Computer Science, IBM Research, P.O. Box 218, 10598, Yorktown Heights, NY
77 rdf:type schema:Organization
 




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


...