|
|
|
|
|
|
by less_less
247 days ago
|
|
|
Do the standards require strong primes for RSA? I think FIPS doesn't ... it gives you that option, either for the legacy reasons or to get a proof with Pocklington's theorem that (p,q) really are prime, but just choosing a random (p,q) and running enough rounds of Miller-Rabin on them is considered acceptable IIRC. |
|
|
There is probably a newer standard superseeding that but it is there in the ansi standards