[Cite as http://purl.org/au-research/grants/arc/DE150100720]
Researchers Dr Youming Qiao
Brief description The algorithmic problem of isomorphism testing seeks to decide whether two objects from a mathematical category are essentially the same. This project focuses on the setting when the categories are from algebra, including but not limited to, groups and polynomials. It is a family of fundamental problems in complexity theory, with important applications in cryptography. The project aims to develop efficient algorithms with provable guarantee, or formal hardness proofs, for these problems. Algorithms will be implemented to examine the impacts on certain cryptography schemes. The successful completion of this project will enhance the understanding of computational complexities of these problems, and identify the security of certain cryptography schemes.
Funding Amount 375000
Funding Scheme Discovery Early Career Researcher Award