1.
M. Ajtai, The shortest vector problem in l2 is np-hard for randomized reductions, in Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, 1998, 10-19.
2.
G. Alagic, D. Apon, D. Cooper, Q. Dang, T. Dang, J. Kelsey, J. Lichtinger, C. Miller, D. Moody, R. Peralta, et al., Status report on the third round of the NIST post-quantum cryptography standardization process, National Institute of Standards and Technology, Gaithersburg.
3. Fast constant-time gcd computation and modular inversion
4. Y. Chen and P. Q. Nguyen, BKZ 2.0: Better lattice security estimates, in International Conference on the Theory and Application of Cryptology and Information Security, Springer, 7073 (2011), 1-20.
5. M. Coglianese and B.-M. Goi, MaTRU: A new NTRU-Based cryptosystem, in Progress in Cryptology - INDOCRYPT 2005, Lecture notes in computer science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, 232-243.