Secure and Efficient Cryptographic Hashing. This project will enhance information security, which is absolutely crucial for rapidly growing e-commerce, e-government services and for national security (Priority 4 -Safeguarding Australia - Protection against Terrorism and Crime). The project will strengthen international collaboration by reciprocal exchange of researchers and postgraduate students leading to more attractive and productive research environment. At the same time, the project will he ....Secure and Efficient Cryptographic Hashing. This project will enhance information security, which is absolutely crucial for rapidly growing e-commerce, e-government services and for national security (Priority 4 -Safeguarding Australia - Protection against Terrorism and Crime). The project will strengthen international collaboration by reciprocal exchange of researchers and postgraduate students leading to more attractive and productive research environment. At the same time, the project will help to maintain high research profile of Australian researchers, to increase the capacity for consultancy and contract work, and provide a cutting-edge information technology for the Australian telecommunications industry, business and government (Priority 3 - Frontier Technologies). Read moreRead less
Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is ....Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is relevant to public-key cryptography, where breaking an encryption scheme should be infeasible, and to many real-life situations where NP-complete problems need to be solved, either exactly or approximately.Read moreRead less
Efficient Pre-Processing of Hard Problems: New Approaches, Basic Theory and Applications. Computers store even larger amounts of data about all aspects of human and industrial activity. However, they have not become significantly better at solving common problems in optimization and search. Traditional complexity theory indicates many of these problems require algorithms that are very unlikely to exist. The Parameterized Complexity approach allows us to obtain very efficient algorithms for a lar ....Efficient Pre-Processing of Hard Problems: New Approaches, Basic Theory and Applications. Computers store even larger amounts of data about all aspects of human and industrial activity. However, they have not become significantly better at solving common problems in optimization and search. Traditional complexity theory indicates many of these problems require algorithms that are very unlikely to exist. The Parameterized Complexity approach allows us to obtain very efficient algorithms for a large variety of problems, but the machinery required was diverse and complicated. This research will organize the machinery into a new approach that systematically finds good algorithms by applying simplifications around a parameter of the domain of the problem. As a result, efficient algorithms are obtained for many diverse areas.Read moreRead less