Centre for Research in Mathematics and Data Science

Algorithmic approaches to braids and their generalisations

ARC Discovery Grant

Key people: Volker Gebhardt, Patrick Dehorney, Juan Gonzalez-Menses
ARC Discovery Grant 2010-2012

This project combines theoretical methods from pure mathematics with computational experiments in order to gain new knowledge. The objects of interest, so-called braid groups and generalisations, are important for many fields of mathematics, but also have applications for data security.
Both the theoretical outcomes of this project and the algorithms developed will strengthen Australia as a centre of cutting-edge research in computational algebra. Moreover, the results can lead to new technologies for protecting confidential data, which are more efficient and hence cheaper to implement than existing alternatives. Secure identification of legitimate users in the context of online banking is one possible field of application.