Everyone likes to win. However, some games combine chance with strategy, making victory uncertain. This talk will explore strategies to increase the chances of winning two popular board games with probabilistic elements.
(Ignite talks all consist of 20 slides which each auto-advance after 15 seconds. Apologies for rushing over the description of Markov chains, but it would be difficult to fully describe the mathematics in five minutes, let alone fifteen seconds!!)
This was filmed at the Sonoma State University mathematics colloquium on November 5th, 2008. In the talk, Dylan speaks about hash functions, their applications and attacks on them. He specifically focuses on the design of the MD5 algorithm. Dylan also gives a preview of what is in store for the future of hashes- the SHA-3 competition put on by the NIST. For the slides from this presentation, visit dylanfield.com/slides.