High-Speed Software Multiplication in F2m View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2002-04-26

AUTHORS

Julio López , Ricardo Dahab

ABSTRACT

In this paper we describe an efficient algorithm for multiplication in F2m, where the field elements of F2m are represented in standard polynomial basis. The proposed algorithm can be used in practical software implementations of elliptic curve cryptography. Our timing results, on several platforms, show that the new method is significantly faster than the “shift-and-add” method More... »

PAGES

203-212

References to SciGraph publications

  • 2005-06-26. A fast software implementation for arithmetic operations in GF(2n) in ADVANCES IN CRYPTOLOGY — ASIACRYPT '96
  • 1998-04. Montgomery Multiplication in GF(2k) in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2002-02-08. Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation in CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS
  • Book

    TITLE

    Progress in Cryptology —INDOCRYPT 2000

    ISBN

    978-3-540-41452-0
    978-3-540-44495-4

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/3-540-44495-5_18

    DOI

    http://dx.doi.org/10.1007/3-540-44495-5_18

    DIMENSIONS

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


    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/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "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"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Valle", 
              "id": "https://www.grid.ac/institutes/grid.8271.c", 
              "name": [
                "Dept. of Computer Science, University of Valle, Colombia"
              ], 
              "type": "Organization"
            }, 
            "familyName": "L\u00f3pez", 
            "givenName": "Julio", 
            "id": "sg:person.07351111507.90", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07351111507.90"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "State University of Campinas", 
              "id": "https://www.grid.ac/institutes/grid.411087.b", 
              "name": [
                "Institute of Computing, State University of Campinas, Brazil"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Dahab", 
            "givenName": "Ricardo", 
            "id": "sg:person.011541433107.93", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011541433107.93"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1023/a:1008208521515", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002824065", 
              "https://doi.org/10.1023/a:1008208521515"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0166-218x(88)90090-x", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025417667"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0034836", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026882213", 
              "https://doi.org/10.1007/bfb0034836"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0034836", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026882213", 
              "https://doi.org/10.1007/bfb0034836"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48059-5_27", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1035213013", 
              "https://doi.org/10.1007/3-540-48059-5_27"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48059-5_27", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1035213013", 
              "https://doi.org/10.1007/3-540-48059-5_27"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/49.223883", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061176862"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2002-04-26", 
        "datePublishedReg": "2002-04-26", 
        "description": "In this paper we describe an efficient algorithm for multiplication in F2m, where the field elements of F2m are represented in standard polynomial basis. The proposed algorithm can be used in practical software implementations of elliptic curve cryptography. Our timing results, on several platforms, show that the new method is significantly faster than the \u201cshift-and-add\u201d method", 
        "editor": [
          {
            "familyName": "Roy", 
            "givenName": "Bimal", 
            "type": "Person"
          }, 
          {
            "familyName": "Okamoto", 
            "givenName": "Eiji", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/3-540-44495-5_18", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-540-41452-0", 
            "978-3-540-44495-4"
          ], 
          "name": "Progress in Cryptology \u2014INDOCRYPT 2000", 
          "type": "Book"
        }, 
        "name": "High-Speed Software Multiplication in F2m", 
        "pagination": "203-212", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/3-540-44495-5_18"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "7acbdd41f6d152f7fd7da786a21118f2b24c2bc712764fc82aa1a55e0a085a7f"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1025775208"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/3-540-44495-5_18", 
          "https://app.dimensions.ai/details/publication/pub.1025775208"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T05:33", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000346_0000000346/records_99818_00000001.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F3-540-44495-5_18"
      }
    ]
     

    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-44495-5_18'

    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-44495-5_18'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-44495-5_18'

    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-44495-5_18'


     

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

    98 TRIPLES      23 PREDICATES      31 URIs      19 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/3-540-44495-5_18 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author Nfe929250efa44144b4eedb9811d3de73
    4 schema:citation sg:pub.10.1007/3-540-48059-5_27
    5 sg:pub.10.1007/bfb0034836
    6 sg:pub.10.1023/a:1008208521515
    7 https://doi.org/10.1016/0166-218x(88)90090-x
    8 https://doi.org/10.1109/49.223883
    9 schema:datePublished 2002-04-26
    10 schema:datePublishedReg 2002-04-26
    11 schema:description In this paper we describe an efficient algorithm for multiplication in F2m, where the field elements of F2m are represented in standard polynomial basis. The proposed algorithm can be used in practical software implementations of elliptic curve cryptography. Our timing results, on several platforms, show that the new method is significantly faster than the “shift-and-add” method
    12 schema:editor Naf308b39f5d64772a0b293510e0429a5
    13 schema:genre chapter
    14 schema:inLanguage en
    15 schema:isAccessibleForFree true
    16 schema:isPartOf Nd8c8aec69b36443e82f5ab85b83772bc
    17 schema:name High-Speed Software Multiplication in F2m
    18 schema:pagination 203-212
    19 schema:productId N9b8360a31b3940778fc43480c44483cc
    20 N9f674c3537fd4a47a7863e66554d39a3
    21 Ncaabb0d42b924fdcac03f07212890dd5
    22 schema:publisher Ncd57ec1a6af14fa59aed9dfe4f2b4377
    23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025775208
    24 https://doi.org/10.1007/3-540-44495-5_18
    25 schema:sdDatePublished 2019-04-16T05:33
    26 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    27 schema:sdPublisher Ne681f8c7cdce44f1936c50f233a266ba
    28 schema:url https://link.springer.com/10.1007%2F3-540-44495-5_18
    29 sgo:license sg:explorer/license/
    30 sgo:sdDataset chapters
    31 rdf:type schema:Chapter
    32 N33f23b59208543b9b3ae326d3bca7ebf rdf:first Nb7968fac421f46f4b04bfb1bfbe986e1
    33 rdf:rest rdf:nil
    34 N3d304d19e696460dae17b9294bae4993 rdf:first sg:person.011541433107.93
    35 rdf:rest rdf:nil
    36 N9b8360a31b3940778fc43480c44483cc schema:name doi
    37 schema:value 10.1007/3-540-44495-5_18
    38 rdf:type schema:PropertyValue
    39 N9f674c3537fd4a47a7863e66554d39a3 schema:name readcube_id
    40 schema:value 7acbdd41f6d152f7fd7da786a21118f2b24c2bc712764fc82aa1a55e0a085a7f
    41 rdf:type schema:PropertyValue
    42 Naf308b39f5d64772a0b293510e0429a5 rdf:first Nf7b7704d19b3478d81cbf6f20b67ce0d
    43 rdf:rest N33f23b59208543b9b3ae326d3bca7ebf
    44 Nb7968fac421f46f4b04bfb1bfbe986e1 schema:familyName Okamoto
    45 schema:givenName Eiji
    46 rdf:type schema:Person
    47 Ncaabb0d42b924fdcac03f07212890dd5 schema:name dimensions_id
    48 schema:value pub.1025775208
    49 rdf:type schema:PropertyValue
    50 Ncd57ec1a6af14fa59aed9dfe4f2b4377 schema:location Berlin, Heidelberg
    51 schema:name Springer Berlin Heidelberg
    52 rdf:type schema:Organisation
    53 Nd8c8aec69b36443e82f5ab85b83772bc schema:isbn 978-3-540-41452-0
    54 978-3-540-44495-4
    55 schema:name Progress in Cryptology —INDOCRYPT 2000
    56 rdf:type schema:Book
    57 Ne681f8c7cdce44f1936c50f233a266ba schema:name Springer Nature - SN SciGraph project
    58 rdf:type schema:Organization
    59 Nf7b7704d19b3478d81cbf6f20b67ce0d schema:familyName Roy
    60 schema:givenName Bimal
    61 rdf:type schema:Person
    62 Nfe929250efa44144b4eedb9811d3de73 rdf:first sg:person.07351111507.90
    63 rdf:rest N3d304d19e696460dae17b9294bae4993
    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.011541433107.93 schema:affiliation https://www.grid.ac/institutes/grid.411087.b
    71 schema:familyName Dahab
    72 schema:givenName Ricardo
    73 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011541433107.93
    74 rdf:type schema:Person
    75 sg:person.07351111507.90 schema:affiliation https://www.grid.ac/institutes/grid.8271.c
    76 schema:familyName López
    77 schema:givenName Julio
    78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07351111507.90
    79 rdf:type schema:Person
    80 sg:pub.10.1007/3-540-48059-5_27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035213013
    81 https://doi.org/10.1007/3-540-48059-5_27
    82 rdf:type schema:CreativeWork
    83 sg:pub.10.1007/bfb0034836 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026882213
    84 https://doi.org/10.1007/bfb0034836
    85 rdf:type schema:CreativeWork
    86 sg:pub.10.1023/a:1008208521515 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002824065
    87 https://doi.org/10.1023/a:1008208521515
    88 rdf:type schema:CreativeWork
    89 https://doi.org/10.1016/0166-218x(88)90090-x schema:sameAs https://app.dimensions.ai/details/publication/pub.1025417667
    90 rdf:type schema:CreativeWork
    91 https://doi.org/10.1109/49.223883 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061176862
    92 rdf:type schema:CreativeWork
    93 https://www.grid.ac/institutes/grid.411087.b schema:alternateName State University of Campinas
    94 schema:name Institute of Computing, State University of Campinas, Brazil
    95 rdf:type schema:Organization
    96 https://www.grid.ac/institutes/grid.8271.c schema:alternateName University of Valle
    97 schema:name Dept. of Computer Science, University of Valle, Colombia
    98 rdf:type schema:Organization
     




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


    ...