1. Y. Arbitman, G. Dogon, V. Lyubashevsky, D. Micciancio, C. Peikert, A. Rosen, SWIFFTX: A proposal for the SHA-3 standard. Submitted to NIST SHA-3 competition
2. M. Ajtai, Generating hard instances of lattice problems, electronic colloquium on computational complexity (ECCC), TR96-007 (1996)
3. N. Bansal, S. Garg, J. Nederlof, N. Vyas, Faster space-efficient algorithms for subset sum and k-sum, in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 (2017), pp. 198–209
4. A. Becker, J.-S. Coron, A. Joux, Improved generic algorithms for hard knapsacks, in K. G. Paterson (ed.), EUROCRYPT 2011. LNCS, 6632 (Springer, 2011), pp. 364–385
5. D.J. Bernstein, Better price-performance ratios for generalized birthday attacks, in Workshop Record of SHARCS07, (2007).
http://cr.yp.to/papers.html#genbday