-
Rémy Oudompheng authored
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
b582ef38
| Name |
Last commit
|
Last update |
|---|---|---|
| .. | ||
| pkcs1v15.go | ||
| pkcs1v15_test.go | ||
| rsa.go | ||
| rsa_test.go |