The Computer Science Colloquium

Benjamin Fine
(Fairfield University)

"Public Key Cryptosystems Using Linear Groups"

Due to the increasing power of computing machinery as well as new ideas in cryptanalysis, algebraic cryptography in increasingly relying on noncommutative platforms. In this talk we present several suggestion for developing cryptosystems both symmetric and public key using a combination of combinatorial group theory and linear groups. The Reidemeister-Schreier rewriting process is used for decryption. We then present a specific secure public key cryptosystem using the classical Modular Group as a platform group and consider the problems, from a computing point of view, of actually implementing this system.

The Colloquium is supported by generous contributions from the Bloomberg, Information Builders, Inc. and Netlogic, Inc.