Университет XXI века: научное измерение

Физика, математика, информатика 171 3. Buchmann J., & Ludwig C. Practical Lattice Basis Reduction. In Selected Areas in Cryptography (pp. 1–14). Berlin : Springer, 1997. 4. Cohen H. A Course in Computational Algebraic Number Theory. Berlin : Springer, 1993. 5. Lenstra A. K., Lenstra H. W., & Lovász L. Factoring polynomials with rational coefficients // Mathematische Annalen, 1982. Vol. 261(4). Р. 515–534. 6. Micciancio D., & Goldwasser S. Complexity of Lattice Problems: A Crypto- graphic Perspective. Berlin : Springer, 2002. 7. Nguyen P. Q., & Vallée B. (Eds.). The LLL Algorithm: Survey and Applica- tions. Berlin : Springer, 2010. 8. Pohst M., & Zassenhaus H. Algorithmic Algebraic Number Theory. Cambridge : Cambridge University Press, 1989.