)]}'
{
  "commit": "a32596b0545d2f6192a6a1be2f8e2c7c4f0c8f44",
  "tree": "fcdfb43f90499a96c0c95ac4f141e514c9b607eb",
  "parents": [
    "e5d6b2fbb45b5638cc9a4c98508748436cb07a44"
  ],
  "author": {
    "name": "Adam Langley",
    "email": "agl@chromium.org",
    "time": "Tue Jan 09 05:44:46 2024 -0800"
  },
  "committer": {
    "name": "Adam Langley",
    "email": "agl@google.com",
    "time": "Fri Jan 19 18:25:38 2024 +0000"
  },
  "message": "Fix AES-GCM-SIV with huge inputs on 32-bit.\n\nThe asm code is 64-bit only, so multipling a `size_t` by eight to get a\nnumber of bits is valid and the bounds on the inputs are checked\naccordingly. But on 32-bit, that calculation will overflow for huge\ninputs.\n\nChange-Id: I6d2171becd6b6259593b2aa80105d8cae1ec7ed4\nReviewed-on: https://boringssl-review.googlesource.com/c/boringssl/+/65188\nReviewed-by: David Benjamin \u003cdavidben@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "63deb0516c7c11744e2e65676255b1f7d67dc64b",
      "old_mode": 33188,
      "old_path": "crypto/cipher_extra/e_aesgcmsiv.c",
      "new_id": "c2bf993d4a530c1633dda1895a735a14c5b4c9b8",
      "new_mode": 33188,
      "new_path": "crypto/cipher_extra/e_aesgcmsiv.c"
    }
  ]
}