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-12-01T06:53", 
    "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_421.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 Nec4a6798a46a4ce2b7436dea5832cf03
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 Ne353fe703e3c4035a4bdc6b261084d5d
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf N38fd0f78cfdf436b951e28afa8dc3790
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 N25e3d464f4af487aa82286c286aee8ad
33 Nf1702b6e33744a699b6d71006fc5a561
34 schema:publisher N47c84cb904224bc5b2d64f06a27e45ab
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-12-01T06:53
38 schema:sdLicense https://scigraph.springernature.com/explorer/license/
39 schema:sdPublisher N3e0828991e3b4a659daac905cb41ae0f
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 N10053334e9b64e35aa852928462f9814 rdf:first sg:person.014125263130.39
45 rdf:rest N1849542162d741d682e842897beeb7fe
46 N1131e45f04ed4241894cd43d080dbb07 schema:familyName Chaum
47 schema:givenName David
48 rdf:type schema:Person
49 N1849542162d741d682e842897beeb7fe rdf:first sg:person.010344544767.07
50 rdf:rest rdf:nil
51 N25e3d464f4af487aa82286c286aee8ad schema:name dimensions_id
52 schema:value pub.1044654632
53 rdf:type schema:PropertyValue
54 N38fd0f78cfdf436b951e28afa8dc3790 schema:isbn 978-3-540-15658-1
55 978-3-540-39568-3
56 schema:name Advances in Cryptology
57 rdf:type schema:Book
58 N3e0828991e3b4a659daac905cb41ae0f schema:name Springer Nature - SN SciGraph project
59 rdf:type schema:Organization
60 N47c84cb904224bc5b2d64f06a27e45ab schema:name Springer Nature
61 rdf:type schema:Organisation
62 N6bdedd8194d54b06b9bf64e093c9241c rdf:first N1131e45f04ed4241894cd43d080dbb07
63 rdf:rest rdf:nil
64 N9641cff94c77488c8509ccaf6bdfcb16 schema:familyName Blakley
65 schema:givenName George Robert
66 rdf:type schema:Person
67 Ne353fe703e3c4035a4bdc6b261084d5d rdf:first N9641cff94c77488c8509ccaf6bdfcb16
68 rdf:rest N6bdedd8194d54b06b9bf64e093c9241c
69 Nec4a6798a46a4ce2b7436dea5832cf03 rdf:first sg:person.07544420130.11
70 rdf:rest N10053334e9b64e35aa852928462f9814
71 Nf1702b6e33744a699b6d71006fc5a561 schema:name doi
72 schema:value 10.1007/3-540-39568-7_8
73 rdf:type schema:PropertyValue
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)


...