Lex is going to touch on some of the basic mathematical concepts used in modern (and to some extend ancient) cryptography such as Prime Numbers, Password Entropy Calculation and Probability Theory, with a focus on Modular Arithmetic. With that, he hopes to be able to demonstrate how the Diffie-Hellman key exchange works in practice by making use of a simple example with small integers.
Pentesters don't do programming (not very well, at least!). Programmers don't do security (usually). It doesn't need to be this way.
Miguel is going to go through OWASPs Secure Coding practices in his own words. Here's to hoping developers gain critical and basic knowledge to prevent a lot of the most common attacks on applications.
And yes, burp will be mentioned again :)
