)]}'
{
  "commit": "18254e25a6c0befdce98528724cb3622f7f75775",
  "tree": "29f758b05cfc804eeb842482ab7853e25aab37fc",
  "parents": [
    "72791efa1be507f91116e23ed16576c6e78466be"
  ],
  "author": {
    "name": "David Benjamin",
    "email": "davidben@google.com",
    "time": "Thu Jun 06 13:44:07 2019 -0400"
  },
  "committer": {
    "name": "CQ bot account: commit-bot@chromium.org",
    "email": "commit-bot@chromium.org",
    "time": "Thu Jun 13 22:24:59 2019 +0000"
  },
  "message": "Discuss the doubling case in windowed Booth representation.\n\nUsing signed digits for point multiplication halves the size of the table,\nwhich is a valuable optimization. However, it is dependent on the curve whether\nthe doubling case in point addition is reachable. Assuming my reasoning is\nvalid, the condition for the standard table strategy is:\n\n  The non-trivial doubling case in single-point scalar multiplication may occur\n  if and only if the 2^(w-1) bit of the group order is zero.\n\nIt would be nice to transcribe this to Coq someday but, for now, check in a\nproof in prose. The condition also does not apply to EC_GFp_nistz256_method\u0027s\nmulti-level tables.\n\nThis file is now 91% comments by line count.\n\nChange-Id: I29b394289793db957f99e80734e10ed59a96fcec\nReviewed-on: https://boringssl-review.googlesource.com/c/boringssl/+/36364\nCommit-Queue: David Benjamin \u003cdavidben@google.com\u003e\nReviewed-by: Adam Langley \u003cagl@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "8951203de015c5811a70f46291e5094b060e869f",
      "old_mode": 33188,
      "old_path": "crypto/fipsmodule/ec/util.c",
      "new_id": "4f39f18bf45c5e4fdb895020ec1e2170958abe9c",
      "new_mode": 33188,
      "new_path": "crypto/fipsmodule/ec/util.c"
    }
  ]
}