Some computational aspects of root finding in GF(qm) View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1989

AUTHORS

A. J. Menezes , P. C. van Oorschot , S. A. Vanstone

ABSTRACT

This paper is an implementation report comparing several variations of a deterministic algorithm for finding roots of polynomials in finite extension fields. Running times for problem instances in fields GF(2m), including m>1000, are given. Comparisons are made between the variations, and improvements achieved in running times are discussed.

PAGES

259-270

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-51084-2_24

DOI

http://dx.doi.org/10.1007/3-540-51084-2_24

DIMENSIONS

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


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 Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
          "id": "http://www.grid.ac/institutes/grid.46078.3d", 
          "name": [
            "Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Menezes", 
        "givenName": "A. J.", 
        "id": "sg:person.012711653371.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012711653371.43"
        ], 
        "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": "van Oorschot", 
        "givenName": "P. C.", 
        "id": "sg:person.014304371661.89", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014304371661.89"
        ], 
        "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 Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
            "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": "1989", 
    "datePublishedReg": "1989-01-01", 
    "description": "This paper is an implementation report comparing several variations of a deterministic algorithm for finding roots of polynomials in finite extension fields. Running times for problem instances in fields GF(2m), including m>1000, are given. Comparisons are made between the variations, and improvements achieved in running times are discussed.", 
    "editor": [
      {
        "familyName": "Gianni", 
        "givenName": "P.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-51084-2_24", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-51084-0", 
        "978-3-540-46153-1"
      ], 
      "name": "Symbolic and Algebraic Computation", 
      "type": "Book"
    }, 
    "keywords": [
      "finite extension field", 
      "roots of polynomials", 
      "computational aspects", 
      "root finding", 
      "extension field", 
      "problem instances", 
      "deterministic algorithm", 
      "polynomials", 
      "field", 
      "algorithm", 
      "instances", 
      "variation", 
      "time", 
      "comparison", 
      "aspects", 
      "roots", 
      "improvement", 
      "Implementation Reports", 
      "findings", 
      "report", 
      "paper"
    ], 
    "name": "Some computational aspects of root finding in GF(qm)", 
    "pagination": "259-270", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1024521202"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-51084-2_24"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-51084-2_24", 
      "https://app.dimensions.ai/details/publication/pub.1024521202"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:14", 
    "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_343.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-51084-2_24"
  }
]
 

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-51084-2_24'

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-51084-2_24'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-51084-2_24'

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-51084-2_24'


 

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

96 TRIPLES      22 PREDICATES      46 URIs      39 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-51084-2_24 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Ne2c000e3beb44ae59d5e43248e366d4a
4 schema:datePublished 1989
5 schema:datePublishedReg 1989-01-01
6 schema:description This paper is an implementation report comparing several variations of a deterministic algorithm for finding roots of polynomials in finite extension fields. Running times for problem instances in fields GF(2m), including m>1000, are given. Comparisons are made between the variations, and improvements achieved in running times are discussed.
7 schema:editor N152d8bf3acf149eda9484944c162c011
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf N0daa181b2b6c44f69a624486c169c6c3
11 schema:keywords Implementation Reports
12 algorithm
13 aspects
14 comparison
15 computational aspects
16 deterministic algorithm
17 extension field
18 field
19 findings
20 finite extension field
21 improvement
22 instances
23 paper
24 polynomials
25 problem instances
26 report
27 root finding
28 roots
29 roots of polynomials
30 time
31 variation
32 schema:name Some computational aspects of root finding in GF(qm)
33 schema:pagination 259-270
34 schema:productId N293667fcc2224577a062e6ec1f6c6879
35 Nfb29e67cba284f0480e777f1cf20a4de
36 schema:publisher Nbb935c376491453d9bfbcdbfe219f05c
37 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024521202
38 https://doi.org/10.1007/3-540-51084-2_24
39 schema:sdDatePublished 2022-09-02T16:14
40 schema:sdLicense https://scigraph.springernature.com/explorer/license/
41 schema:sdPublisher Nbc826f2775d54bdba14c27529ad25794
42 schema:url https://doi.org/10.1007/3-540-51084-2_24
43 sgo:license sg:explorer/license/
44 sgo:sdDataset chapters
45 rdf:type schema:Chapter
46 N0daa181b2b6c44f69a624486c169c6c3 schema:isbn 978-3-540-46153-1
47 978-3-540-51084-0
48 schema:name Symbolic and Algebraic Computation
49 rdf:type schema:Book
50 N152d8bf3acf149eda9484944c162c011 rdf:first N45b0f526c05b44fe8330d55e481acd65
51 rdf:rest rdf:nil
52 N293667fcc2224577a062e6ec1f6c6879 schema:name doi
53 schema:value 10.1007/3-540-51084-2_24
54 rdf:type schema:PropertyValue
55 N45b0f526c05b44fe8330d55e481acd65 schema:familyName Gianni
56 schema:givenName P.
57 rdf:type schema:Person
58 N60cba8497a1545e69b58eab5dd058225 rdf:first sg:person.014304371661.89
59 rdf:rest Nfe63ef5ec0844a1a9687fd7e9a1b7546
60 Nbb935c376491453d9bfbcdbfe219f05c schema:name Springer Nature
61 rdf:type schema:Organisation
62 Nbc826f2775d54bdba14c27529ad25794 schema:name Springer Nature - SN SciGraph project
63 rdf:type schema:Organization
64 Ne2c000e3beb44ae59d5e43248e366d4a rdf:first sg:person.012711653371.43
65 rdf:rest N60cba8497a1545e69b58eab5dd058225
66 Nfb29e67cba284f0480e777f1cf20a4de schema:name dimensions_id
67 schema:value pub.1024521202
68 rdf:type schema:PropertyValue
69 Nfe63ef5ec0844a1a9687fd7e9a1b7546 rdf:first sg:person.010344544767.07
70 rdf:rest rdf:nil
71 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
72 schema:name Information and Computing Sciences
73 rdf:type schema:DefinedTerm
74 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
75 schema:name Computation Theory and Mathematics
76 rdf:type schema:DefinedTerm
77 sg:person.010344544767.07 schema:affiliation grid-institutes:grid.46078.3d
78 schema:familyName Vanstone
79 schema:givenName S. A.
80 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07
81 rdf:type schema:Person
82 sg:person.012711653371.43 schema:affiliation grid-institutes:grid.46078.3d
83 schema:familyName Menezes
84 schema:givenName A. J.
85 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012711653371.43
86 rdf:type schema:Person
87 sg:person.014304371661.89 schema:affiliation grid-institutes:grid.46078.3d
88 schema:familyName van Oorschot
89 schema:givenName P. C.
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014304371661.89
91 rdf:type schema:Person
92 grid-institutes:grid.46078.3d schema:alternateName Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
93 Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
94 schema:name Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
95 Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
96 rdf:type schema:Organization
 




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


...