Ishay Haviv is a computer scientist and faculty member at the Academic College of Tel Aviv-Yaffo. His research interests are theoretical computer science, computational complexity, lattices, hardness of approximation, coding theory and combinatorics.

Ishay received his PhD from Tel Aviv University. His thesis “Combinatorics and Theoretical Aspects of Computer Sciences; Complexity of Lattice Problems” was written under the supervision of Prof. Oded Regev. His PhD researched lattices – an extremely important subject in mathematics, computer science and cryptography. A central problem is computing, exactly or approximately, the shortest non-zero vector in a lattice, known as the Shortest Vector Problem (SVP). The best known algorithms to compute SVP are very inefficient, but are still used routinely to design attacks on cryptosystems. An efficient algorithm for SVP would be terrible news for the security of many cryptosystems. It is therefore important to prove rigorously that no efficient algorithm can even approximately compute SVP. Ishay’s work (with Oded Regev) substantially improved on all previous results and attracted much attention.

Ishay has published his work in a variety of journals including Discrete & Computational Geometry, Theory of Computing, Journal of Approximation Theory and Computational Complexity.