Research

My research interests are in the area of algorithms and computational complexity.

For my Master's thesis I worked on security in the Random Oracle Model (ROM), a topic in Cryptography. My main result was to prove that every secure canonical identification scheme — even a "trivial" one — can be converted to a Fiat-Shamir signature scheme which is secure in the ROM. I further showed how to modify an early version of a certain public-key encryption scheme to make it CCA2-secure in the ROM.

I also did some research funded by NSERC USRA awards as an undergraduate. With Rudi Mathon, I designed and implemented in C a Stochastic Local Search algorithm for finding induced subgraphs with a given number of edges. The algorithm was subsequently used to constructively prove the existence of certain combinatorial designs. With Christina Christara, I wrote a suite of MATLAB functions for performing accurate monotonicity-preserving cubic interpolation, which was later incorporated into a PDE solver.