Problems in Computational Group Theory arising from Cryptanalysis
In the course of some recent cryptanalytic work, we encountered a number of interesting problems in computational group theory, including the computation of certain types of subgroups and applications of the constructive recognition problem. In this talk we detail some original results allowing for the resolution of these problems, as well as their application to cryptanalysis. This is joint work with several co-authors.