* Galois Theory - I have a basic understanding of abstract algebra but for some reason Galois theory confounds me, especially as it relates to the inability of radical solutions to fifth and higher degree polynomials
* "State-of-the-art" Quantum Entanglement experiments and their purported success in closing all loopholes
* Babai's proof on graph isomorphism being (almost/effectively) in P - specifically how it might relate to other areas of group actions etc.
* Low density parity checks and other algorithms for reaching the Shannon entropy limit for communication over noisy channels
* Hash functions and their success as one-way(ish)/trapdoor(ish) functions - is SHA-2 believed to be secure because a lot of people threw stuff at the wall to see what stuck or is there a theoretical backpinning that allows people to design these hashes with some degree of certainty that they are irreversible?