1. Bi, J., Nguyen, P.Q.: Rounding LLL: finding faster small roots of univariate polynomial congruences. Public-Key Cryptogr.-PKC 2014, 185–202 (2014)
2. Boneh, D.: Twenty years of attacks on the rsa cryptosystem. Not. AMS 46(2), 203–213 (1999)
3. Coppersmith, D.: Finding a small root of a univariate modular equation. Adv. Cryptol. Eurocrypt 96, 155–165 (1997)
4. Development team, T. F. fplll, a lattice reduction library. Available at 2016
5. Galbraith, S.D.: Mathematics of Public Key Cryptography. Cambridge University Press (2012)