)]}'
{
  "commit": "b7ded430e4e32ecbd6716282e3d7278e9fc78fcd",
  "tree": "b87445165b0af4cbf2cdec215f4f720e1e9d4802",
  "parents": [
    "ddd5ba78a949c5458aad9f7c3f19d214a2e8338e"
  ],
  "author": {
    "name": "David Benjamin",
    "email": "davidben@google.com",
    "time": "Tue Apr 11 13:24:31 2017 -0400"
  },
  "committer": {
    "name": "Adam Langley",
    "email": "agl@google.com",
    "time": "Wed Apr 12 22:27:45 2017 +0000"
  },
  "message": "Constrain RSA bit sizes.\n\nThe FIPS RSA generation algorithm is unkind to keys with funny bit\nsizes. Odd numbers of bits are especially inconvenient, but the sqrt(2)\nbound is much simpler if the key size is a multiple of 128 (thus giving\nprime sizes a multiple of 64, so the sqrt(2) bound is easier to work\nwith).\n\nAlso impose a minimum RSA key size. 255-bit RSA is far too small as it\nis and gives small enough primes that the p-q FIPS bound (2^(n/2-100))\nstarts risking underflow.\n\nChange-Id: I4583c90b67385e53641ccee9b29044e79e94c920\nReviewed-on: https://boringssl-review.googlesource.com/14947\nReviewed-by: Adam Langley \u003cagl@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "6bb8ab8ace995218164c57c27f3c718e64f605f0",
      "old_mode": 33188,
      "old_path": "crypto/rsa/rsa_impl.c",
      "new_id": "325ccc746a1050008b7d99f3695d9d02d9d3bf0b",
      "new_mode": 33188,
      "new_path": "crypto/rsa/rsa_impl.c"
    },
    {
      "type": "modify",
      "old_id": "c44131ec6826aca0351f954a830cce82f99ecba9",
      "old_mode": 33188,
      "old_path": "crypto/rsa/rsa_test.cc",
      "new_id": "7f4197b235f0cfd9450a6573dac7e56746908d98",
      "new_mode": 33188,
      "new_path": "crypto/rsa/rsa_test.cc"
    }
  ]
}