"Key sizes, algorithms, elliptic curves - they all make a difference in data protection. But few people understand enough about them to make informed decisions that balance security, usability, and performance. In this session Mike Danseglio dissects a few representative algorithms to show how they work, what the bit-strength actually means, and how it differs between algorithms, He'll explain how public-key and shared-secret-key play together in real-world scenarios and how to choose the right algo+keylength for IT application scenarios including PKI, IPSec, and Kerberos. If time permits, Mike will also demonstrate how Diffie-Hellman provides both strength and weakness to the entire framework."