1. Lecture Notes in Computer Science;P. Barrett,1987
2. Bernstein, D.J.: Removing redundancy in high-precision Newton iteration, 13 pages (2004),
http://cr.yp.to/fastnewton.html
3. Bernstein, D.J.: Scaled remainder trees, 8 pages (2004),
http://cr.yp.to/papers.html#scaledmod
4. Bostan, A., Lecerf, G., Schost, E.: Tellegen’s principle into practice. In: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (Philadelphia, PA, USA, 2003), pp. 37–44 (2003)
5. Brent, R.P.: Some integer factorization algorithms using elliptic curves. Australian Computer Science Communications 8, 149–163 (1986),
http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pub/pub102.html