Crypto: Math Theory for the Practically Minded
![](https://www.socallinuxexpo.org/sites/default/files/styles/square_thumbnail/public/speakers/elijah_caine_0.png?itok=GSMeJGBF)
Math is hard and intimidating, but it doesn't have to be! This talk covers advanced topics in Cryptography, condensed into the most essential information. The goal being to equip you, a kickass coder or admin, with some of the theory behind the protocols of past, present, and future.
Step away from the keyboard, sit back in your chair, and come on a journey about Elliptic Curve Cryptography, Memory Hard Functions, Garbled Circuits, and Private Set Intersection. Enjoy the fruits of countless hours of academic research condensed into a fraction of the time they deserve and in an easy to understand presentation anyone can enjoy. If you want to sound smart with your friends, this is a talk for you.
To be precise we'll cover:
- Memory Hard Functions: Preventing the bad guys from using your password-dump.
- Elliptic Curve Cryptography: Encryption better than RSA.
- Garbled Circuits: Secure multi-party communication.
- Private Set Intersection: Privacy for the future.
You don't need to have a PHD to know why your network connection is secure or what a Garbled Circuit even is. This talk presents some of the interesting problems, and solutions, Cryptography has to offer without the lingo and formulas even Wikipedia can't seem to escape.