1. M. Ajtai: The shortest vector problem in $$L_2$$ L 2 is NP-hard for randomized reductions, Proceedings of the 30th annual ACM symposium on Theory of computing (1998), Dallas, Texas, United States, ACM. pp. 10-19.
2. E.R. Berlekamp: Factoring polynomials over finite fields, Bell System Technical Journal 46 (1967), pp. 1853-1859.
3. D.G. Cantor, H. Zassenhaus: A new algorithm for factoring polynomials over finite fields, Mathematics of Computation 36 (1981), pp. 587-592.
4. J.E. Cremona, T.A. Fisher, C. O’neil, D. Simon, M. Stoll: Explicit $$n$$ n -descent on elliptic curves I. Algebra, Journal für die reine und angewandte Mathematik, Vol. 615 (2008), pp. 121-155.
5. J.E. Cremona, T.A. Fisher, C. O’neil, D. Simon, M. Stoll: Explicit $$n$$ n -descent on elliptic curves II. Geometry, Journal für die reine und angewandte Mathematik 632 (2009), pp. 63–84.