Discovery Early Career Researcher Award - Grant ID: DE150100720
Funder
Australian Research Council
Funding Amount
$375,000.00
Summary
Testing Isomorphism of Algebraic Structures. 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 ....Testing Isomorphism of Algebraic Structures. 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.Read moreRead less
Evidence-based frameworks for security protocol verification. Security protocols are an essential part of secure communication networks. This project aims to develop verification techniques for security protocols that produce independently verifiable formal certificates of correctness. The project's outcome will contribute to the certification processes for secure network systems at the highest level of assurance.
Mechanised foundations of proof calculi. Commercial program verification tools based upon special-purpose logic-based proof calculi can now guarantee that large programs are free of specific bugs. But who verifies the proof-calculi? Our research will lead to tools to automatically verify proof-calculi and will eventually help to avoid costly post-construction debugging.