300 likes | 467 Views
Purpose. RSA modulus n = pqStrong primesrandom"ZpIrreducible polynomialsEtc.. Approach. Generate a canditate odd n Randomly chosenConstructedTest n for primalityProbabilistic testsTrue primality testsIf the test in step 2 fails (n is composite), return to step 1.. Prime Numbers. Distrib
E N D
1. Public-Key Parameters Handbook of Applied Cryptography Ch. 4