Constant time modular inversion View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2014-11

AUTHORS

Joppe W. Bos

ABSTRACT

Simple power analysis is a common technique to attack software implementations, especially in the realm of public-key cryptography. An effective countermeasure to protect an implementation is to ensure constant (worst-case) runtime. In this paper we show how to modify an algorithm by Kaliski to compute the Montgomery inverse such that it can compute both the classical and Montgomery modular inverse in constant time. We demonstrate the effectiveness by comparing it to the approach based on Fermat’s little theorem as used in the current simple power analysis resistant implementations in cryptography. Our implementation on the popular 32-bit ARM platform highlights the practical benefits of this algorithm. More... »

PAGES

275-281

References to SciGraph publications

  • 2001-07-13. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems in ADVANCES IN CRYPTOLOGY — CRYPTO ’96
  • 2004. Projective Coordinates Leak in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004
  • 2014. Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves in TOPICS IN CRYPTOLOGY – CT-RSA 2014
  • 2010-01. Efficient Cache Attacks on AES, and Countermeasures in JOURNAL OF CRYPTOLOGY
  • 2001-09. Selecting Cryptographic Key Sizes in JOURNAL OF CRYPTOLOGY
  • 2013. Fast Cryptography in Genus 2 in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2013
  • 2010. New Software Speed Records for Cryptographic Pairings in PROGRESS IN CRYPTOLOGY – LATINCRYPT 2010
  • 2004-09. A One Round Protocol for Tripartite Diffie–Hellman in JOURNAL OF CRYPTOLOGY
  • 2013. High-Performance Scalar Multiplication Using 8-Dimensional GLV/GLS Decomposition in CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2013
  • 1986. Use of Elliptic Curves in Cryptography in ADVANCES IN CRYPTOLOGY — CRYPTO ’85 PROCEEDINGS
  • 2006. Curve25519: New Diffie-Hellman Speed Records in PUBLIC KEY CRYPTOGRAPHY - PKC 2006
  • 2001-08-02. Identity-Based Encryption from the Weil Pairing in ADVANCES IN CRYPTOLOGY — CRYPTO 2001
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s13389-014-0084-8

    DOI

    http://dx.doi.org/10.1007/s13389-014-0084-8

    DIMENSIONS

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


    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": "NXP (Belgium)", 
              "id": "https://www.grid.ac/institutes/grid.426026.4", 
              "name": [
                "NXP Semiconductors, Leuven, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Bos", 
            "givenName": "Joppe W.", 
            "id": "sg:person.011356726653.68", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011356726653.68"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-540-24676-3_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1003365947", 
              "https://doi.org/10.1007/978-3-540-24676-3_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24676-3_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1003365947", 
              "https://doi.org/10.1007/978-3-540-24676-3_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/359340.359342", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013337011"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44647-8_13", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014375289", 
              "https://doi.org/10.1007/3-540-44647-8_13"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44647-8_13", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014375289", 
              "https://doi.org/10.1007/3-540-44647-8_13"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00145-009-9049-y", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017461552", 
              "https://doi.org/10.1007/s00145-009-9049-y"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00145-009-9049-y", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017461552", 
              "https://doi.org/10.1007/s00145-009-9049-y"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00145-009-9049-y", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017461552", 
              "https://doi.org/10.1007/s00145-009-9049-y"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-04852-9_1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017542132", 
              "https://doi.org/10.1007/978-3-319-04852-9_1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00145-001-0009-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021562387", 
              "https://doi.org/10.1007/s00145-001-0009-4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-39799-x_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022380878", 
              "https://doi.org/10.1007/3-540-39799-x_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1090/s0025-5718-1987-0866109-5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022745146"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0021-9991(67)90047-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025057781"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11745853_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030714294", 
              "https://doi.org/10.1007/11745853_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11745853_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030714294", 
              "https://doi.org/10.1007/11745853_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-38348-9_12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031094507", 
              "https://doi.org/10.1007/978-3-642-38348-9_12"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-40349-1_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033411073", 
              "https://doi.org/10.1007/978-3-642-40349-1_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-14712-8_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1040973872", 
              "https://doi.org/10.1007/978-3-642-14712-8_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-14712-8_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1040973872", 
              "https://doi.org/10.1007/978-3-642-14712-8_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1090/s0025-5718-1985-0777282-x", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041482767"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00145-004-0312-y", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047140823", 
              "https://doi.org/10.1007/s00145-004-0312-y"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-68697-5_9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047972271", 
              "https://doi.org/10.1007/3-540-68697-5_9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-68697-5_9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047972271", 
              "https://doi.org/10.1007/3-540-68697-5_9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1049/el:19991230", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1056788977"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/12.403725", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061088153"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/12.863048", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061089170"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1504/ijact.2012.045590", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1067430043"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/arith.1991.145564", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086363517"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2014-11", 
        "datePublishedReg": "2014-11-01", 
        "description": "Simple power analysis is a common technique to attack software implementations, especially in the realm of public-key cryptography. An effective countermeasure to protect an implementation is to ensure constant (worst-case) runtime. In this paper we show how to modify an algorithm by Kaliski to compute the Montgomery inverse such that it can compute both the classical and Montgomery modular inverse in constant time. We demonstrate the effectiveness by comparing it to the approach based on Fermat\u2019s little theorem as used in the current simple power analysis resistant implementations in cryptography. Our implementation on the popular 32-bit ARM platform highlights the practical benefits of this algorithm.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s13389-014-0084-8", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136625", 
            "issn": [
              "2190-8508", 
              "2190-8516"
            ], 
            "name": "Journal of Cryptographic Engineering", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "4", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "4"
          }
        ], 
        "name": "Constant time modular inversion", 
        "pagination": "275-281", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "7ccc199ef8ff542daff114ed0b07e7fd5e4fd395c400a70183f93159031ff7b0"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s13389-014-0084-8"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1026196390"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s13389-014-0084-8", 
          "https://app.dimensions.ai/details/publication/pub.1026196390"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-10T16:44", 
        "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/0000000001_0000000264/records_8669_00000522.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007%2Fs13389-014-0084-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/s13389-014-0084-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/s13389-014-0084-8'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s13389-014-0084-8'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s13389-014-0084-8'


     

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

    136 TRIPLES      21 PREDICATES      48 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s13389-014-0084-8 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author Nf0ac51fffbed4a10b2ff2df579865d99
    4 schema:citation sg:pub.10.1007/11745853_14
    5 sg:pub.10.1007/3-540-39799-x_31
    6 sg:pub.10.1007/3-540-44647-8_13
    7 sg:pub.10.1007/3-540-68697-5_9
    8 sg:pub.10.1007/978-3-319-04852-9_1
    9 sg:pub.10.1007/978-3-540-24676-3_16
    10 sg:pub.10.1007/978-3-642-14712-8_7
    11 sg:pub.10.1007/978-3-642-38348-9_12
    12 sg:pub.10.1007/978-3-642-40349-1_19
    13 sg:pub.10.1007/s00145-001-0009-4
    14 sg:pub.10.1007/s00145-004-0312-y
    15 sg:pub.10.1007/s00145-009-9049-y
    16 https://doi.org/10.1016/0021-9991(67)90047-2
    17 https://doi.org/10.1049/el:19991230
    18 https://doi.org/10.1090/s0025-5718-1985-0777282-x
    19 https://doi.org/10.1090/s0025-5718-1987-0866109-5
    20 https://doi.org/10.1109/12.403725
    21 https://doi.org/10.1109/12.863048
    22 https://doi.org/10.1109/arith.1991.145564
    23 https://doi.org/10.1145/359340.359342
    24 https://doi.org/10.1504/ijact.2012.045590
    25 schema:datePublished 2014-11
    26 schema:datePublishedReg 2014-11-01
    27 schema:description Simple power analysis is a common technique to attack software implementations, especially in the realm of public-key cryptography. An effective countermeasure to protect an implementation is to ensure constant (worst-case) runtime. In this paper we show how to modify an algorithm by Kaliski to compute the Montgomery inverse such that it can compute both the classical and Montgomery modular inverse in constant time. We demonstrate the effectiveness by comparing it to the approach based on Fermat’s little theorem as used in the current simple power analysis resistant implementations in cryptography. Our implementation on the popular 32-bit ARM platform highlights the practical benefits of this algorithm.
    28 schema:genre research_article
    29 schema:inLanguage en
    30 schema:isAccessibleForFree false
    31 schema:isPartOf N4b971d3f42384f279730bcf8a0d999fc
    32 N89718abeb90f468cb80619ffd19e32e1
    33 sg:journal.1136625
    34 schema:name Constant time modular inversion
    35 schema:pagination 275-281
    36 schema:productId N33c55b71ab914ad5b1bff6a4fb10feb9
    37 N74b6d5116b544d42a4269fc21b459463
    38 N7d343b2143164777b364d686689ccc57
    39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026196390
    40 https://doi.org/10.1007/s13389-014-0084-8
    41 schema:sdDatePublished 2019-04-10T16:44
    42 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    43 schema:sdPublisher Ne39f962aac5946d8bee238da062c039b
    44 schema:url http://link.springer.com/10.1007%2Fs13389-014-0084-8
    45 sgo:license sg:explorer/license/
    46 sgo:sdDataset articles
    47 rdf:type schema:ScholarlyArticle
    48 N33c55b71ab914ad5b1bff6a4fb10feb9 schema:name dimensions_id
    49 schema:value pub.1026196390
    50 rdf:type schema:PropertyValue
    51 N4b971d3f42384f279730bcf8a0d999fc schema:volumeNumber 4
    52 rdf:type schema:PublicationVolume
    53 N74b6d5116b544d42a4269fc21b459463 schema:name doi
    54 schema:value 10.1007/s13389-014-0084-8
    55 rdf:type schema:PropertyValue
    56 N7d343b2143164777b364d686689ccc57 schema:name readcube_id
    57 schema:value 7ccc199ef8ff542daff114ed0b07e7fd5e4fd395c400a70183f93159031ff7b0
    58 rdf:type schema:PropertyValue
    59 N89718abeb90f468cb80619ffd19e32e1 schema:issueNumber 4
    60 rdf:type schema:PublicationIssue
    61 Ne39f962aac5946d8bee238da062c039b schema:name Springer Nature - SN SciGraph project
    62 rdf:type schema:Organization
    63 Nf0ac51fffbed4a10b2ff2df579865d99 rdf:first sg:person.011356726653.68
    64 rdf:rest rdf:nil
    65 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    66 schema:name Information and Computing Sciences
    67 rdf:type schema:DefinedTerm
    68 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    69 schema:name Computation Theory and Mathematics
    70 rdf:type schema:DefinedTerm
    71 sg:journal.1136625 schema:issn 2190-8508
    72 2190-8516
    73 schema:name Journal of Cryptographic Engineering
    74 rdf:type schema:Periodical
    75 sg:person.011356726653.68 schema:affiliation https://www.grid.ac/institutes/grid.426026.4
    76 schema:familyName Bos
    77 schema:givenName Joppe W.
    78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011356726653.68
    79 rdf:type schema:Person
    80 sg:pub.10.1007/11745853_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030714294
    81 https://doi.org/10.1007/11745853_14
    82 rdf:type schema:CreativeWork
    83 sg:pub.10.1007/3-540-39799-x_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022380878
    84 https://doi.org/10.1007/3-540-39799-x_31
    85 rdf:type schema:CreativeWork
    86 sg:pub.10.1007/3-540-44647-8_13 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014375289
    87 https://doi.org/10.1007/3-540-44647-8_13
    88 rdf:type schema:CreativeWork
    89 sg:pub.10.1007/3-540-68697-5_9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047972271
    90 https://doi.org/10.1007/3-540-68697-5_9
    91 rdf:type schema:CreativeWork
    92 sg:pub.10.1007/978-3-319-04852-9_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017542132
    93 https://doi.org/10.1007/978-3-319-04852-9_1
    94 rdf:type schema:CreativeWork
    95 sg:pub.10.1007/978-3-540-24676-3_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003365947
    96 https://doi.org/10.1007/978-3-540-24676-3_16
    97 rdf:type schema:CreativeWork
    98 sg:pub.10.1007/978-3-642-14712-8_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040973872
    99 https://doi.org/10.1007/978-3-642-14712-8_7
    100 rdf:type schema:CreativeWork
    101 sg:pub.10.1007/978-3-642-38348-9_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031094507
    102 https://doi.org/10.1007/978-3-642-38348-9_12
    103 rdf:type schema:CreativeWork
    104 sg:pub.10.1007/978-3-642-40349-1_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033411073
    105 https://doi.org/10.1007/978-3-642-40349-1_19
    106 rdf:type schema:CreativeWork
    107 sg:pub.10.1007/s00145-001-0009-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021562387
    108 https://doi.org/10.1007/s00145-001-0009-4
    109 rdf:type schema:CreativeWork
    110 sg:pub.10.1007/s00145-004-0312-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1047140823
    111 https://doi.org/10.1007/s00145-004-0312-y
    112 rdf:type schema:CreativeWork
    113 sg:pub.10.1007/s00145-009-9049-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1017461552
    114 https://doi.org/10.1007/s00145-009-9049-y
    115 rdf:type schema:CreativeWork
    116 https://doi.org/10.1016/0021-9991(67)90047-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025057781
    117 rdf:type schema:CreativeWork
    118 https://doi.org/10.1049/el:19991230 schema:sameAs https://app.dimensions.ai/details/publication/pub.1056788977
    119 rdf:type schema:CreativeWork
    120 https://doi.org/10.1090/s0025-5718-1985-0777282-x schema:sameAs https://app.dimensions.ai/details/publication/pub.1041482767
    121 rdf:type schema:CreativeWork
    122 https://doi.org/10.1090/s0025-5718-1987-0866109-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022745146
    123 rdf:type schema:CreativeWork
    124 https://doi.org/10.1109/12.403725 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061088153
    125 rdf:type schema:CreativeWork
    126 https://doi.org/10.1109/12.863048 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061089170
    127 rdf:type schema:CreativeWork
    128 https://doi.org/10.1109/arith.1991.145564 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086363517
    129 rdf:type schema:CreativeWork
    130 https://doi.org/10.1145/359340.359342 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013337011
    131 rdf:type schema:CreativeWork
    132 https://doi.org/10.1504/ijact.2012.045590 schema:sameAs https://app.dimensions.ai/details/publication/pub.1067430043
    133 rdf:type schema:CreativeWork
    134 https://www.grid.ac/institutes/grid.426026.4 schema:alternateName NXP (Belgium)
    135 schema:name NXP Semiconductors, Leuven, Belgium
    136 rdf:type schema:Organization
     




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


    ...