The Goldreich-Goldwasser-Halevi Cryptosystem

Recently, O. Goldreich, S. Goldwasser and S. Halevi described a construction of a trapdoor function whose security is based on the assumed hardness of the closest-lattice-vector problem (CVP). A description of this construction can be found in the article From this page you can download challenges for breaking this cryptosystem with lattice in dimensions ranging from 200 to 400. Our current estimate is that dimensions 300 and up should be infeasible to break.

Follows are the challenges. Each challenge file begins with a short description of its format. The description itself can alse be found here.