)]}'
{
  "commit": "7acba5f3a6ff10f1424c309d0d34d2b713233019",
  "tree": "268d6fc5498f71f907466b66b6fe8312e954f5e3",
  "parents": [
    "13fcb9e63892f18de043e8308bc645ae5baf4aa4"
  ],
  "author": {
    "name": "Wouter Bolsterlee",
    "email": "uws@xs4all.nl",
    "time": "Fri Jun 20 20:07:46 2014"
  },
  "committer": {
    "name": "Dwayne Litzenberger",
    "email": "dlitz@dlitz.net",
    "time": "Mon Jun 23 07:12:24 2014"
  },
  "message": "Increase attempts for recovering RSA (p,q) from (n,e,d)\n\nBump the maximum number of iterations to recover (p,q) given (n,e,d) to\nincrease the chance that the algorithm succeeds. The algorithm used is a\nprobabilistic one with a 1/2 chance of finding the right value in each\niteration, so it\u0027s likely that only a few iterations are needed.\n\nHowever, in some extreme cases this may still fail. Bumping the maximum\nnumber allow the algorithm to correctly find the right values for these\ncases. This changes bumps the number of iterations from 50 to 500 (the\nvalue \u0027a\u0027 is increased by 2 in each step), and hence reduces the chance\nof failure from 2**-50 to 2**-500.\n\nNote that this change does *not* result in a performance degradation.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "e9f48f9bf49893b997c8e8833d813611784c718c",
      "old_mode": 33188,
      "old_path": "lib/Crypto/PublicKey/_slowmath.py",
      "new_id": "1350773eb0227b50872af34e74c7bd76c89c20d9",
      "new_mode": 33188,
      "new_path": "lib/Crypto/PublicKey/_slowmath.py"
    },
    {
      "type": "modify",
      "old_id": "c33155739106d78f150a78371695bcf68e341abd",
      "old_mode": 33188,
      "old_path": "src/_fastmath.c",
      "new_id": "e369f5a7ae6fb7b36c898cdb03339f150cc1a2cb",
      "new_mode": 33188,
      "new_path": "src/_fastmath.c"
    }
  ]
}