The most difficult part of this reading was the part about the Miller-Rabin primality test. I just didn't really understand how it's performed or the part about probability of getting a prime around a certain number.
It is really interesting to know that there are methods for testing whether a large integer is composite. Though its not the same as factoring it, that can be still a very useful piece of knowledge. Such as when the problem of the week asks you to determine whether a large integer is prime or composite. But it's also plain to see that this is useful in studying RSA, and its good to see a useful application of Legendre and Jacobi symbols.
No comments:
Post a Comment