Diffie-Hellman, RSA, AES, and Other Fun Cryptography Math
Effective cryptographic schemes like AES, Diffie-Hellman, digital signature, and RSA depend on a few basic mathematical concepts like Modulo Math and the Discrete Logarithm Problem to keep them secure. This seminar is intended as a fun refresher for those who like to know the math behind the algorithms.
Details:
Date: Saturday - May 17
Time: 16:00
Length: 45 minutes
Location: DH Holmes
Speakers:
Michele Bousquet
Michele Bousquet is a digital forensics analyst and a professor at Tulane University, where she teaches cryptography.