1. RSA is definitely a major topic, and how to attack it if it is not applied well. That would also include primality testing and factorization. Also discrete logs I would expect to have a significant portion.
2. I would expect to see some computational questions that would use techniques discussed in class to factor or find discrete logs, and some ciphers similar to what we have done in class that may have some weakness that can be exploited.
3. I feel like my weakest area is some of the more complicated algorithms such as Pohlig Hellman and the Quadratic Sieve.
4. Anything that would relate to number theory somehow I would find interesting, but there is nothing in particular I can think of.
No comments:
Post a Comment