| commit | b582ef385555f88d41679a621d34bc260de4eb68 | [log] [tgz] |
|---|---|---|
| author | Rémy Oudompheng <oudomphe@phare.normalesup.org> | Sun Feb 24 17:19:09 2013 +0100 |
| committer | Rémy Oudompheng <oudomphe@phare.normalesup.org> | Sun Feb 24 17:19:09 2013 +0100 |
| tree | b2c3c96abeb1f945f5325ad2549caec7b46f56ab | |
| parent | 5a8b7dc6d009bd95f5904b4250107ef57c163c22 [diff] |
crypto/rsa: fix infinite loop in GenerateMultiPrimeKey for large nprimes The heuristics for BitLen of a product of randomly generated primes are wrong, and the generated candidates never match the required size for nprimes > 10. This corner case is not expected to be used in practice. R=agl CC=golang-dev https://golang.org/cl/7397052