Location: 8-302

Starts: 13:00:00

Ends: 14:00:00

General CSS Meeting - Part II of Dr. Rich's Cryptography series, which will cover "Elliptic Curve Cryptography."

From his abstract:

In abstract algebra, a group is a set of elements and an operation satisfying the closure, associativity, identity and inverse properties. In cryptography, the ability to invert is indispensible if you want to recover plaintext from ciphertext produced by encryption, so it's natural that groups form the mathematical foundation of cryptosystems.

Elliptic curve groups are sets of points on a 2-dimensional elliptic curve, along with a geometrically-defined "addition" operation. They form a convenient basis for public-key cryptography, and provide stronger security and better performance with shorter keys than more popular public-key cryptosystems like RSA.

You're invited to learn about elliptic curves and see a graphical illustration of elliptic curve cryptographic techniques.

Wednesday, May 14, 1-2pm in 8-302