1. Lecture Notes in Computer Science;L.M. Adleman,1994
2. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Symposium on the Theory of Computing (STOC’01), pp. 601–610 (2001)
3. Aumasson, J.P., Finiasz, M., Meier, W., Vaudenay, S.: TCHo: a hardware-oriented trapdoor cipher. In: ACISP’07: Proceedings of the 12th Australasian Conference on Information Security and Privacy, pp. 184–199. Springer, Berlin/Heidelberg (2007)
4. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384–386 (1978)
5. Brent, R.P., Zimmermann, P.: Algorithms for finding almost irreducible and almost primitive trinomials. In: Primes and Misdemeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, p. 212. Fields Institute (2003)