Descriptioncrypto/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.
Patch Set 1 #Patch Set 2 : diff -r 083759101bc9 https://go.googlecode.com/hg/ #Patch Set 3 : diff -r 083759101bc9 https://go.googlecode.com/hg/ #Patch Set 4 : diff -r 083759101bc9 https://go.googlecode.com/hg/ #Patch Set 5 : diff -r 655b43c97d76 https://go.googlecode.com/hg/ #
MessagesTotal messages: 6
|
||||||||||||||||||||||||||||