)]}'
{
  "commit": "79221bc26587c2f58c7198cc73d89eda6bdd6025",
  "tree": "8509a0986325091606f00ef66a8f7bbba4645b1f",
  "parents": [
    "ffa49dc3d98b08db46522781f7537155e00d44d7"
  ],
  "author": {
    "name": "Geoff Thorpe",
    "email": "geoff@openssl.org",
    "time": "Fri Feb 14 23:21:19 2003 +0000"
  },
  "committer": {
    "name": "Geoff Thorpe",
    "email": "geoff@openssl.org",
    "time": "Fri Feb 14 23:21:19 2003 +0000"
  },
  "message": "David Brumley \u003cdbrumley@stanford.edu\u003e noted and corrected a case in the\nverification step of CRT private key operations in the RSA code -\npreviously no montgomery form was checked or used for \u0027n\u0027, and so it would\nbe generated on the fly each time. As a result, private key operations are\nnow a percent or two faster.\n\nRather than adding this as another repetition of the nearly-identical\nmontgomery \"check for first-use\" initialisation code blocks, I\u0027ve taken\nthis chance to create a helper function and macro-wrapper to replace them.\n\nPR: 475\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "d4e30647d143bf0464e5f0dbd047118a1e4758fd",
      "old_mode": 33188,
      "old_path": "crypto/rsa/rsa_eay.c",
      "new_id": "04cefd38b7a72a8ed661f62a7716b6f6f8db6243",
      "new_mode": 33188,
      "new_path": "crypto/rsa/rsa_eay.c"
    }
  ]
}