Category Archives: Complexity of Lattice Problems

In complexity theory, we say a problem is hard if it it hard for the worst-case instance; while in cryptography, a problem is deemed hard only if it is hard for the average-case instance (i.e., for all but a negligible fraction of instances). Basics Lattice Definition of a Lattice Continue reading →

Complexity of Lattice Problems Planned topics (notes not yet published): Continue reading →