The thesis contains results reported in the above top four papers.
Official double spaced version:
Convenient single spaced version:
My M.Sc. thesis deals with heuristic reductions from knapsack problem to the problem of finding short vectors in integer lattices. The latter is efficiently solved by the Lenstra, Lenstra and Lovasz algorithm. A good reduction results in better ways of solving knapsack. Look at the short summary
(better written), or full thesis
(ps) (a bit messier).
The following publications are not available online due to Non-Disclosure
Biometric Key Binding. Technical report sponsored by
Bioscrypt, Inc. and
Canadian National Research Council's Industrial Research Assistance
Program (NRC-IRAP). With Omid Jahromi, Rene McIver, Colin Soutar
and Alex Stoianov, 2005
Binding Strong Keys to Fingerprints Securely and Privately.
Bioscrypt, Inc., 2005