Listeners will learn the fundamental mathematics behind RSA encryption, including modular arithmetic, multiple precision arithmetic, a GCD algorithm, the repeated-square-and-multiply algorithm and the actual encryption/decryption scheme. Audience will be walked through an example of encryption/decryption by hand, then a code walk-through which performs a similar task will be done. A small discussion of the strength, uses, and future of RSA might be included, given enough time.

John Ryan
John Ryan is a Computer Engineering student at WSU. Currently, he gets paid to play with robots at Pacific Northwest Labs. Buy him a beer.