)]}'
{
  "commit": "b8a651439b1848fec42e2d27037de3a31d1f3e2f",
  "tree": "808fca9ffbcffcdb71e56af84419ebf1ebe28c31",
  "parents": [
    "c7de4fe0bd28f61d6eb62023c08d2605f2955285"
  ],
  "author": {
    "name": "David Benjamin",
    "email": "davidben@google.com",
    "time": "Fri Jun 03 15:27:33 2022 -0400"
  },
  "committer": {
    "name": "Boringssl LUCI CQ",
    "email": "boringssl-scoped@luci-project-accounts.iam.gserviceaccount.com",
    "time": "Fri Jun 03 20:29:18 2022 +0000"
  },
  "message": "Align rsaz and mont5 table construction.\n\nBoth implementations need to compute the first 32 powers of a. There\u0027s a\ncommented out naive version in rsaz_exp.c that claims to be smaller, but\n1% slower. (It doesn\u0027t use squares when it otherwise could.)\n\nInstead, we can write out the square-based strategy as a loop. (I wasn\u0027t\nable to measure a difference between any of the three versions, but this\none\u0027s compact enough and does let us square more and gather5 less.)\n\nChange-Id: I7015f2a78584cd97f29b54d0007479bdcc3a01ba\nReviewed-on: https://boringssl-review.googlesource.com/c/boringssl/+/52828\nReviewed-by: Adam Langley \u003cagl@google.com\u003e\nCommit-Queue: David Benjamin \u003cdavidben@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "074f05d89545749425c6fb8edb98d358655ad45c",
      "old_mode": 33188,
      "old_path": "crypto/fipsmodule/bn/rsaz_exp.c",
      "new_id": "f4e50a6e75cf7c527abaf225da6af2615a2b19ee",
      "new_mode": 33188,
      "new_path": "crypto/fipsmodule/bn/rsaz_exp.c"
    }
  ]
}