1. A sieve algorithm for the shortest lattice vector problem;Ajtai,2001
2. Hardness of computing the most significant bits of secret keys in Diffie–Hellman and related schemes;Boneh,1996
3. Rounding in lattices and its cryptographic applications;Boneh,1997
4. Estimates on polynomial exponential sums;Bourgain;Israel J. Math.,2010
5. Counting roots for polynomials modulo prime powers;Cheng,2019