)]}'
{
  "commit": "e747f4d41885efa200b8fafa67cd81c52223cd31",
  "tree": "57a3325cfe3f5e4a44093a95124d4382ec067461",
  "parents": [
    "19a45b8d47cecbb352e69098717f373c190bc4e7"
  ],
  "author": {
    "name": "Andy Polyakov",
    "email": "appro@openssl.org",
    "time": "Wed May 26 21:36:36 2010 +0000"
  },
  "committer": {
    "name": "Andy Polyakov",
    "email": "appro@openssl.org",
    "time": "Wed May 26 21:36:36 2010 +0000"
  },
  "message": "gcm128.c: P.-M. Hager has tipped about possibility to fold reductions\nin gcm_ghash_4bit. Taking the idea a step further I\u0027ve added extra\n256+16 bytes of per-key storage, so that one can speak about 3rd variant\nin addition to \"256B\" and \"4KB\": \"528B\" one. Commonly it should be\n~50% faster than \"256B\" implementation or ~25% slower than \"4KB\" one.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "132c7892bc2c99b0435c89321ed6c4fedfd3831b",
      "old_mode": 33188,
      "old_path": "crypto/modes/gcm128.c",
      "new_id": "8b1880cf5dce6f42a6021f74d959535fe4be8dc9",
      "new_mode": 33188,
      "new_path": "crypto/modes/gcm128.c"
    }
  ]
}