News for hackers. Stuff that matters.
Re:Math topics useful for computer science/programming by stplsd on Sunday April 20, 2014 @01:48PM (#7617714)
- number theory underpinning almost all modern cryptography

- NFA/DFA underpinning regular expressions ( well practical regular exp are not in fact regular, but anyway)

Re:Math topics useful for computer science/programming by tptacek on Sunday April 20, 2014 @02:09PM (#7617809)
Actually, although number theory touches a lot of "conventional" crypto (some of the design rationale for AES, polynomial MACs), most of workhorse cryptography in normal applications is not especially number-theoretic, and has more to do with information theory and statistics.

The belief that number theory is essential for cryptography is due to its role in public-key cryptography. But even if you're comfortable with number theory, new applications of public-key cryptography are tremendously difficult to get right, and require subject-matter specific expertise.