Category Archives: A Decade of Lattice Cryptography

Why do we need worse-case to average-case reductions in lattice-based cryptography? Lattice hard problems are believed to be difficult to solve in the worst case. But not every instance of these problems is hard, and some instances may be easy to solve, for example when we use orthogonal basis vectors.… Continue reading →