The Security and Performance of the Galois/Counter Mode (GCM) of Operation View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2004

AUTHORS

David A. McGrew , John Viega

ABSTRACT

The recently introduced Galois/Counter Mode (GCM) of operation for block ciphers provides both encryption and message authentication, using universal hashing based on multiplication in a binary finite field. We analyze its security and performance, and show that it is the most efficient mode of operation for high speed packet networks, by using a realistic model of a network crypto module and empirical data from studies of Internet traffic in conjunction with software experiments and hardware designs. GCM has several useful features: it can accept IVs of arbitrary length, can act as a stand-alone message authentication code (MAC), and can be used as an incremental MAC. We show that GCM is secure in the standard model of concrete security, even when these features are used. We also consider several of its important system-security aspects. More... »

PAGES

343-355

References to SciGraph publications

  • 2001-04-15. Encryption Modes with Almost Free Message Integrity in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2001
  • 2000-10-27. Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm in ADVANCES IN CRYPTOLOGY — ASIACRYPT 2000
  • 2001-07-13. LFSR-based Hashing and Authentication in ADVANCES IN CRYPTOLOGY — CRYPTO ’94
  • 2002-04-29. A Block-Cipher Mode of Operation for Parallelizable Message Authentication in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2002
  • 2003. OMAC: One-Key CBC MAC in FAST SOFTWARE ENCRYPTION
  • 2002. Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes in FAST SOFTWARE ENCRYPTION
  • 2001-07-13. Incremental Cryptography: The Case of Hashing and Signing in ADVANCES IN CRYPTOLOGY — CRYPTO ’94
  • 2001-07-13. On Fast and Provably Secure Message Authentication Based on Universal Hashing in ADVANCES IN CRYPTOLOGY — CRYPTO ’96
  • Book

    TITLE

    Progress in Cryptology - INDOCRYPT 2004

    ISBN

    978-3-540-24130-0
    978-3-540-30556-9

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-540-30556-9_27

    DOI

    http://dx.doi.org/10.1007/978-3-540-30556-9_27

    DIMENSIONS

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


    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/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "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": {
              "name": [
                "Cisco Systems, Inc."
              ], 
              "type": "Organization"
            }, 
            "familyName": "McGrew", 
            "givenName": "David A.", 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "name": [
                "Secure Software"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Viega", 
            "givenName": "John", 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1016/0022-0000(81)90033-7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001629983"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45473-x_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007553455", 
              "https://doi.org/10.1007/3-540-45473-x_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/501983.502011", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020514401"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1006/jcss.1999.1694", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030084096"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44987-6_32", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033008788", 
              "https://doi.org/10.1007/3-540-44987-6_32"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44987-6_32", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033008788", 
              "https://doi.org/10.1007/3-540-44987-6_32"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46035-7_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033306119", 
              "https://doi.org/10.1007/3-540-46035-7_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46035-7_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033306119", 
              "https://doi.org/10.1007/3-540-46035-7_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44448-3_41", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1037503497", 
              "https://doi.org/10.1007/3-540-44448-3_41"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44448-3_41", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1037503497", 
              "https://doi.org/10.1007/3-540-44448-3_41"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-68697-5_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038146356", 
              "https://doi.org/10.1007/3-540-68697-5_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-68697-5_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038146356", 
              "https://doi.org/10.1007/3-540-68697-5_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48658-5_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1039080576", 
              "https://doi.org/10.1007/3-540-48658-5_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48658-5_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1039080576", 
              "https://doi.org/10.1007/3-540-48658-5_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48658-5_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041220210", 
              "https://doi.org/10.1007/3-540-48658-5_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48658-5_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041220210", 
              "https://doi.org/10.1007/3-540-48658-5_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-39887-5_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042067492", 
              "https://doi.org/10.1007/978-3-540-39887-5_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-39887-5_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042067492", 
              "https://doi.org/10.1007/978-3-540-39887-5_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/586110.586125", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052218944"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1997.646128", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1093858542"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2004", 
        "datePublishedReg": "2004-01-01", 
        "description": "The recently introduced Galois/Counter Mode (GCM) of operation for block ciphers provides both encryption and message authentication, using universal hashing based on multiplication in a binary finite field. We analyze its security and performance, and show that it is the most efficient mode of operation for high speed packet networks, by using a realistic model of a network crypto module and empirical data from studies of Internet traffic in conjunction with software experiments and hardware designs. GCM has several useful features: it can accept IVs of arbitrary length, can act as a stand-alone message authentication code (MAC), and can be used as an incremental MAC. We show that GCM is secure in the standard model of concrete security, even when these features are used. We also consider several of its important system-security aspects.", 
        "editor": [
          {
            "familyName": "Canteaut", 
            "givenName": "Anne", 
            "type": "Person"
          }, 
          {
            "familyName": "Viswanathan", 
            "givenName": "Kapaleeswaran", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-540-30556-9_27", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-540-24130-0", 
            "978-3-540-30556-9"
          ], 
          "name": "Progress in Cryptology - INDOCRYPT 2004", 
          "type": "Book"
        }, 
        "name": "The Security and Performance of the Galois/Counter Mode (GCM) of Operation", 
        "pagination": "343-355", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1024482299"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-540-30556-9_27"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "74a2a18a56a0d3a5f3a8b4318da15e8d921910ef320dc0b22d4d6c9b929fede4"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-540-30556-9_27", 
          "https://app.dimensions.ai/details/publication/pub.1024482299"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T07:29", 
        "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/0000000356_0000000356/records_57871_00000000.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F978-3-540-30556-9_27"
      }
    ]
     

    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/978-3-540-30556-9_27'

    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/978-3-540-30556-9_27'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-30556-9_27'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-30556-9_27'


     

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

    123 TRIPLES      23 PREDICATES      40 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-540-30556-9_27 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author N5e1fb20e761641f29a159df565fce0a2
    4 schema:citation sg:pub.10.1007/3-540-44448-3_41
    5 sg:pub.10.1007/3-540-44987-6_32
    6 sg:pub.10.1007/3-540-45473-x_8
    7 sg:pub.10.1007/3-540-46035-7_25
    8 sg:pub.10.1007/3-540-48658-5_15
    9 sg:pub.10.1007/3-540-48658-5_22
    10 sg:pub.10.1007/3-540-68697-5_24
    11 sg:pub.10.1007/978-3-540-39887-5_11
    12 https://doi.org/10.1006/jcss.1999.1694
    13 https://doi.org/10.1016/0022-0000(81)90033-7
    14 https://doi.org/10.1109/sfcs.1997.646128
    15 https://doi.org/10.1145/501983.502011
    16 https://doi.org/10.1145/586110.586125
    17 schema:datePublished 2004
    18 schema:datePublishedReg 2004-01-01
    19 schema:description The recently introduced Galois/Counter Mode (GCM) of operation for block ciphers provides both encryption and message authentication, using universal hashing based on multiplication in a binary finite field. We analyze its security and performance, and show that it is the most efficient mode of operation for high speed packet networks, by using a realistic model of a network crypto module and empirical data from studies of Internet traffic in conjunction with software experiments and hardware designs. GCM has several useful features: it can accept IVs of arbitrary length, can act as a stand-alone message authentication code (MAC), and can be used as an incremental MAC. We show that GCM is secure in the standard model of concrete security, even when these features are used. We also consider several of its important system-security aspects.
    20 schema:editor N668fd0c45a204932ac9fae1eddef095e
    21 schema:genre chapter
    22 schema:inLanguage en
    23 schema:isAccessibleForFree true
    24 schema:isPartOf Ne1a3aa8ebbdb46a59e9975492ec8fbb8
    25 schema:name The Security and Performance of the Galois/Counter Mode (GCM) of Operation
    26 schema:pagination 343-355
    27 schema:productId N24ff5b465cac487db973e1f9cc42a954
    28 N3fae6bcef532446285ed006375033422
    29 N8d69a7131d0347f18c3394a6214c9759
    30 schema:publisher N03156edcfb614cf0a1ad96062202cd66
    31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024482299
    32 https://doi.org/10.1007/978-3-540-30556-9_27
    33 schema:sdDatePublished 2019-04-16T07:29
    34 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    35 schema:sdPublisher N508e5f3c2a0d4930addf54527bbeae45
    36 schema:url https://link.springer.com/10.1007%2F978-3-540-30556-9_27
    37 sgo:license sg:explorer/license/
    38 sgo:sdDataset chapters
    39 rdf:type schema:Chapter
    40 N03156edcfb614cf0a1ad96062202cd66 schema:location Berlin, Heidelberg
    41 schema:name Springer Berlin Heidelberg
    42 rdf:type schema:Organisation
    43 N08f96ce026ed4616b47c92ed61df3763 schema:name Secure Software
    44 rdf:type schema:Organization
    45 N1765ef709b4b44868c020dc02cd3cca1 rdf:first N494473852e454a8bb043caf4fd9745de
    46 rdf:rest rdf:nil
    47 N1dc277f2952e4d9794b631350c6529db schema:familyName Viswanathan
    48 schema:givenName Kapaleeswaran
    49 rdf:type schema:Person
    50 N24ff5b465cac487db973e1f9cc42a954 schema:name dimensions_id
    51 schema:value pub.1024482299
    52 rdf:type schema:PropertyValue
    53 N3fae6bcef532446285ed006375033422 schema:name readcube_id
    54 schema:value 74a2a18a56a0d3a5f3a8b4318da15e8d921910ef320dc0b22d4d6c9b929fede4
    55 rdf:type schema:PropertyValue
    56 N494473852e454a8bb043caf4fd9745de schema:affiliation N08f96ce026ed4616b47c92ed61df3763
    57 schema:familyName Viega
    58 schema:givenName John
    59 rdf:type schema:Person
    60 N508e5f3c2a0d4930addf54527bbeae45 schema:name Springer Nature - SN SciGraph project
    61 rdf:type schema:Organization
    62 N5e1fb20e761641f29a159df565fce0a2 rdf:first N76260a7f8e114b468032b986da31a726
    63 rdf:rest N1765ef709b4b44868c020dc02cd3cca1
    64 N668fd0c45a204932ac9fae1eddef095e rdf:first Ne9de07cbf5974f12bea0a97cc93a6294
    65 rdf:rest Nedb08a05cdc84cd2ba63f5442fc2ef34
    66 N76260a7f8e114b468032b986da31a726 schema:affiliation Nebfccafdb8ba40fb8feea0a4f6dc25a0
    67 schema:familyName McGrew
    68 schema:givenName David A.
    69 rdf:type schema:Person
    70 N8d69a7131d0347f18c3394a6214c9759 schema:name doi
    71 schema:value 10.1007/978-3-540-30556-9_27
    72 rdf:type schema:PropertyValue
    73 Ne1a3aa8ebbdb46a59e9975492ec8fbb8 schema:isbn 978-3-540-24130-0
    74 978-3-540-30556-9
    75 schema:name Progress in Cryptology - INDOCRYPT 2004
    76 rdf:type schema:Book
    77 Ne9de07cbf5974f12bea0a97cc93a6294 schema:familyName Canteaut
    78 schema:givenName Anne
    79 rdf:type schema:Person
    80 Nebfccafdb8ba40fb8feea0a4f6dc25a0 schema:name Cisco Systems, Inc.
    81 rdf:type schema:Organization
    82 Nedb08a05cdc84cd2ba63f5442fc2ef34 rdf:first N1dc277f2952e4d9794b631350c6529db
    83 rdf:rest rdf:nil
    84 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    85 schema:name Information and Computing Sciences
    86 rdf:type schema:DefinedTerm
    87 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    88 schema:name Data Format
    89 rdf:type schema:DefinedTerm
    90 sg:pub.10.1007/3-540-44448-3_41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037503497
    91 https://doi.org/10.1007/3-540-44448-3_41
    92 rdf:type schema:CreativeWork
    93 sg:pub.10.1007/3-540-44987-6_32 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033008788
    94 https://doi.org/10.1007/3-540-44987-6_32
    95 rdf:type schema:CreativeWork
    96 sg:pub.10.1007/3-540-45473-x_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007553455
    97 https://doi.org/10.1007/3-540-45473-x_8
    98 rdf:type schema:CreativeWork
    99 sg:pub.10.1007/3-540-46035-7_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033306119
    100 https://doi.org/10.1007/3-540-46035-7_25
    101 rdf:type schema:CreativeWork
    102 sg:pub.10.1007/3-540-48658-5_15 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041220210
    103 https://doi.org/10.1007/3-540-48658-5_15
    104 rdf:type schema:CreativeWork
    105 sg:pub.10.1007/3-540-48658-5_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039080576
    106 https://doi.org/10.1007/3-540-48658-5_22
    107 rdf:type schema:CreativeWork
    108 sg:pub.10.1007/3-540-68697-5_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038146356
    109 https://doi.org/10.1007/3-540-68697-5_24
    110 rdf:type schema:CreativeWork
    111 sg:pub.10.1007/978-3-540-39887-5_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042067492
    112 https://doi.org/10.1007/978-3-540-39887-5_11
    113 rdf:type schema:CreativeWork
    114 https://doi.org/10.1006/jcss.1999.1694 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030084096
    115 rdf:type schema:CreativeWork
    116 https://doi.org/10.1016/0022-0000(81)90033-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001629983
    117 rdf:type schema:CreativeWork
    118 https://doi.org/10.1109/sfcs.1997.646128 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093858542
    119 rdf:type schema:CreativeWork
    120 https://doi.org/10.1145/501983.502011 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020514401
    121 rdf:type schema:CreativeWork
    122 https://doi.org/10.1145/586110.586125 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052218944
    123 rdf:type schema:CreativeWork
     




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


    ...