Asymmetric Cryptography and Elliptic Curves w/ Andrew Burkus
A quick tour through modern cryptography, with code samples for popular algorithms such as Diffie-Hellman in both standard and Elliptic group form. Are Elliptic Curves really faster and safer? Is RSA too slow in the world of mobile computing? These are some of the primary questions being answered.
Bio:
Andrew Burkus is a computer science student at DePaul University. He's worked on a variety of projects, ranging from virtual machines to mobile games. Chattanooga is the place where he discovered two interests that would come to dominate his life: rock climbing and computer science.
