Succinct certificates for almost all subset sum problems

Finding the closest lattice vector when it's unusually close

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

The Two Faces of Lattices in Cryptology

CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices

The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

An improved low-density subset sum algorithm

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

A hybrid lattice-reduction and meet-in-the-middle attack against NTRU

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology

Basis reduction and the complexity of branch-and-bound

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Integer feasibility of random polytopes: random integer programs

Proceedings of the 5th conference on Innovations in theoretical computer science