|Date:||Mon, March 7, 2016|
|Place:||Research II Lecture Hall|
Abstract: In this talk I will survey some of the cryptosystems based on group theoretic problems and their computational complexity such as Conjugacy, Membership, Endomorphism, Word, Twisted Conjugacy, and Geodesic Length Problems. I will speak about some non-abelian groups in which they have been proposed as platforms for such cryptosystems: Braid, Polycyclic, Metabelian, Grigorchuck, Thompson, Matrix, Hyperbolic, Right Angeled Artin Groups. There will be open problems related to both group theoretic and cryptographic problems that I will mention at the end of the talk.
The colloquium is preceded by tea from 16:45 in the Resnikoff Mathematics Common Room, Research I, 127.