Computing Logarithms in GF (2n) View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1985

AUTHORS

I. F. Blake , R. C. Mullin , S. A. Vanstone

ABSTRACT

Consider the finite field having q elements and denote it by GF(q). Let α be a generator for the nonzero elements of GF(q). Hence, for any element b≠0 there exists an integer x, 0≤x≤q−2, such that b=αx. We call x the discrete logarithm of b to the base α and we denote it by x=logαb and more simply by log b when the base is fixed for the discussion. The discrete logarithm problem is stated as follows:Find a computationally feasible algorithm to compute logαb for any b∈GF(q), b≠0. More... »

PAGES

73-82

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-39568-7_8

DOI

http://dx.doi.org/10.1007/3-540-39568-7_8

DIMENSIONS

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


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": "Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
          "id": "http://www.grid.ac/institutes/grid.46078.3d", 
          "name": [
            "Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Blake", 
        "givenName": "I. F.", 
        "id": "sg:person.07544420130.11", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07544420130.11"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
          "id": "http://www.grid.ac/institutes/grid.46078.3d", 
          "name": [
            "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mullin", 
        "givenName": "R. C.", 
        "id": "sg:person.014125263130.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014125263130.39"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
          "id": "http://www.grid.ac/institutes/grid.46078.3d", 
          "name": [
            "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vanstone", 
        "givenName": "S. A.", 
        "id": "sg:person.010344544767.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1985", 
    "datePublishedReg": "1985-01-01", 
    "description": "Consider the finite field having q elements and denote it by GF(q). Let \u03b1 be a generator for the nonzero elements of GF(q). Hence, for any element b\u22600 there exists an integer x, 0\u2264x\u2264q\u22122, such that b=\u03b1x. We call x the discrete logarithm of b to the base \u03b1 and we denote it by x=log\u03b1b and more simply by log b when the base is fixed for the discussion. The discrete logarithm problem is stated as follows:Find a computationally feasible algorithm to compute log\u03b1b for any b\u2208GF(q), b\u22600.", 
    "editor": [
      {
        "familyName": "Blakley", 
        "givenName": "George Robert", 
        "type": "Person"
      }, 
      {
        "familyName": "Chaum", 
        "givenName": "David", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-39568-7_8", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-15658-1", 
        "978-3-540-39568-3"
      ], 
      "name": "Advances in Cryptology", 
      "type": "Book"
    }, 
    "keywords": [
      "discrete logarithm problem", 
      "logarithm problem", 
      "discrete logarithm", 
      "feasible algorithm", 
      "finite field", 
      "base \u03b1", 
      "nonzero elements", 
      "algorithm", 
      "integers x", 
      "elements", 
      "generator", 
      "base", 
      "field", 
      "discussion", 
      "logarithm", 
      "GF", 
      "q elements", 
      "problem", 
      "log B"
    ], 
    "name": "Computing Logarithms in GF (2n)", 
    "pagination": "73-82", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1044654632"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-39568-7_8"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-39568-7_8", 
      "https://app.dimensions.ai/details/publication/pub.1044654632"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:17", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/chapter/chapter_53.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-39568-7_8"
  }
]
 

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-39568-7_8'

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-39568-7_8'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-39568-7_8'

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-39568-7_8'


 

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

99 TRIPLES      22 PREDICATES      44 URIs      37 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-39568-7_8 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Ne52410847a544487855ca1ab6fa291b1
4 schema:datePublished 1985
5 schema:datePublishedReg 1985-01-01
6 schema:description Consider the finite field having q elements and denote it by GF(q). Let α be a generator for the nonzero elements of GF(q). Hence, for any element b≠0 there exists an integer x, 0≤x≤q−2, such that b=αx. We call x the discrete logarithm of b to the base α and we denote it by x=logαb and more simply by log b when the base is fixed for the discussion. The discrete logarithm problem is stated as follows:Find a computationally feasible algorithm to compute logαb for any b∈GF(q), b≠0.
7 schema:editor Nfb5c61717c3c4110a90914b64b282556
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Nd4af4993290247a1a0574003114542b6
11 schema:keywords GF
12 algorithm
13 base
14 base α
15 discrete logarithm
16 discrete logarithm problem
17 discussion
18 elements
19 feasible algorithm
20 field
21 finite field
22 generator
23 integers x
24 log B
25 logarithm
26 logarithm problem
27 nonzero elements
28 problem
29 q elements
30 schema:name Computing Logarithms in GF (2n)
31 schema:pagination 73-82
32 schema:productId N29ac0979a9464bc7aedae650ac3d1e2a
33 N429e213483e14fb890ebb1a6034365ef
34 schema:publisher Nf0324edb0a634aefa92c520a96dfd6a2
35 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044654632
36 https://doi.org/10.1007/3-540-39568-7_8
37 schema:sdDatePublished 2022-09-02T16:17
38 schema:sdLicense https://scigraph.springernature.com/explorer/license/
39 schema:sdPublisher Nf5a06ada5ce84f2993746891c2a33623
40 schema:url https://doi.org/10.1007/3-540-39568-7_8
41 sgo:license sg:explorer/license/
42 sgo:sdDataset chapters
43 rdf:type schema:Chapter
44 N0d898930833640779f4980c77ed09d82 rdf:first sg:person.010344544767.07
45 rdf:rest rdf:nil
46 N289268512ac94a4ebf00b0e6f2d46e2d schema:familyName Blakley
47 schema:givenName George Robert
48 rdf:type schema:Person
49 N29ac0979a9464bc7aedae650ac3d1e2a schema:name doi
50 schema:value 10.1007/3-540-39568-7_8
51 rdf:type schema:PropertyValue
52 N429e213483e14fb890ebb1a6034365ef schema:name dimensions_id
53 schema:value pub.1044654632
54 rdf:type schema:PropertyValue
55 N51698437003b452ea7764fa37f992ff2 rdf:first N5663a7c2066a45a1aba62375db3c96df
56 rdf:rest rdf:nil
57 N5663a7c2066a45a1aba62375db3c96df schema:familyName Chaum
58 schema:givenName David
59 rdf:type schema:Person
60 Nbf7b1d8b939c4406903c6f5b6e109192 rdf:first sg:person.014125263130.39
61 rdf:rest N0d898930833640779f4980c77ed09d82
62 Nd4af4993290247a1a0574003114542b6 schema:isbn 978-3-540-15658-1
63 978-3-540-39568-3
64 schema:name Advances in Cryptology
65 rdf:type schema:Book
66 Ne52410847a544487855ca1ab6fa291b1 rdf:first sg:person.07544420130.11
67 rdf:rest Nbf7b1d8b939c4406903c6f5b6e109192
68 Nf0324edb0a634aefa92c520a96dfd6a2 schema:name Springer Nature
69 rdf:type schema:Organisation
70 Nf5a06ada5ce84f2993746891c2a33623 schema:name Springer Nature - SN SciGraph project
71 rdf:type schema:Organization
72 Nfb5c61717c3c4110a90914b64b282556 rdf:first N289268512ac94a4ebf00b0e6f2d46e2d
73 rdf:rest N51698437003b452ea7764fa37f992ff2
74 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
75 schema:name Information and Computing Sciences
76 rdf:type schema:DefinedTerm
77 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
78 schema:name Computation Theory and Mathematics
79 rdf:type schema:DefinedTerm
80 sg:person.010344544767.07 schema:affiliation grid-institutes:grid.46078.3d
81 schema:familyName Vanstone
82 schema:givenName S. A.
83 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07
84 rdf:type schema:Person
85 sg:person.014125263130.39 schema:affiliation grid-institutes:grid.46078.3d
86 schema:familyName Mullin
87 schema:givenName R. C.
88 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014125263130.39
89 rdf:type schema:Person
90 sg:person.07544420130.11 schema:affiliation grid-institutes:grid.46078.3d
91 schema:familyName Blake
92 schema:givenName I. F.
93 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07544420130.11
94 rdf:type schema:Person
95 grid-institutes:grid.46078.3d schema:alternateName Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
96 Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
97 schema:name Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
98 Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
99 rdf:type schema:Organization
 




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


...