ACC Seminar: Simple Groups in Cryptography

A wall like structure, overlaid with digital schematics and binary numbers with Cryptography in the center

Department of Mathematical Sciences

Location: North Building 316

Speaker: Eilidh McKemmie, Assistant Professor, Kean University

Refreshments will be served at 4:00 PM.

ABSTRACT

We discuss two different factorization problems involving finite simple groups. First, we consider approaches to searching in Cayley graphs and applications to hash functions. Then we will define logarithmic signatures and an associated rewriting problem which appears in several proposed public-key cryptosystems.

BIOGRAPHY

Portrait of Eilidh McKemmie

Eilidh McKemmie is an Assistant Professor of Mathematics at Kean University. She received her PhD from the University of Southern California under the direction of Robert Guralnick. Professor McKemmie's research interests include group theory with applications to number theory and cryptography.

A campus map is available at https://tour.stevens.edu.
Additional information is available at https://web.stevens.edu/algebraic/.

Zoom Link:

https://stevens.zoom.us/j/93228680142 (Password: ACC)