Oops. I read the wrong section last time. But I really liked this reading on primality testing. We talked about the jacobi symbols, but not really what they meant. It was neat to see how they fit into primality testing.
I am not really sure what "probably prime" means. I understood that if these tests told us a number was composite, then we knew that for sure. When using primes for an RSA encryption, I doubt that they just use a number that is pseudoprime, or even strong pseudoprime. What other tests do they do? Are they very complicated? I remember reading this last summer about some primality tests and they went way over my head.
No comments:
Post a Comment