)]}'
{
  "commit": "cba958f4069fdbe6fdd37ba3dc1d1c23328eeb5d",
  "tree": "070dd2775f02eebbb86d84d798b377729d698a79",
  "parents": [
    "c4e4757b636b1765a322b76406e6d472e60b5f01"
  ],
  "author": {
    "name": "David Benjamin",
    "email": "davidben@google.com",
    "time": "Sun Mar 04 00:58:20 2018 -0500"
  },
  "committer": {
    "name": "Adam Langley",
    "email": "alangley@gmail.com",
    "time": "Fri Mar 30 19:54:00 2018 +0000"
  },
  "message": "Make RSA_check_key constant-time and more meaningful.\n\nRather than recompute values the same as in key generation, where\npossible, we check differently. In particular, most RSA values are\nmodular inverses of some value. Check each of them by multiplying and\nusing our naive constant-time division function.\n\nMedian of 29 RSA keygens: 0m0.218s -\u003e 0m0.205s\n(Accuracy beyond 0.1s is questionable.)\n\nBug: 238\nChange-Id: Iaca19f12c045457013def844a17bf502ed09136e\nReviewed-on: https://boringssl-review.googlesource.com/26373\nReviewed-by: Adam Langley \u003calangley@gmail.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "6477a26e49b4274d784c2adcd19803dad220fa96",
      "old_mode": 33188,
      "old_path": "crypto/fipsmodule/rsa/rsa.c",
      "new_id": "9a74c3c8cf325903c5c6a33240c6eaf4ff5719a5",
      "new_mode": 33188,
      "new_path": "crypto/fipsmodule/rsa/rsa.c"
    }
  ]
}