- Roberto M. Avanzi, Henri Cohen, Christophe Doche, Gerhard Frey, Tanja Lange, Kim Nguyen, and Frederik Vercauteren, Handbook of elliptic and hyperelliptic curve cryptography, Chapman & Hall/CRC, 2005.
- Eric Bach and Jeffrey Shallit, Algorithmic number thoery, Volume I: Efficient algorithms, MIT Press, 1996.
- Joe Buhler and Peter Stevenhagen (Eds.), Algorithmic number thoery: Lattices, number fields, curves, and cryptography, MSRI, 2008.
- Henri Cohen, A course in computational number theory, Springer, 1993.
- Henri Cohen, Advanced topics in computational number theory, Springer, 2000.
- Henri Cohen, Number theory. Volume I: Tools and Diophantine equations, Springer, 2007.
- Henri Cohen, Number theory. Volume II: Analytic and modern tools, Springer, 2007.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, fourth edition, MIT PRess, 2022.
- Richard Crandall and Carl Pomerance, Prime numbers: A computational perspective, 2nd edition, Springer, 2005.
- Bettina Eick, Derek F. Holt, and Eamonn A. O'Brien, Handbook of computational group theory, Chapman & Hall/CRC, 2005.
- Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete mathematics, Addison Wesley, 1994.
- Donald E. Knuth, The art of computer programming, Volumes 1-4A, Addison-Wesley,2011.
- Steven Galbraith, Mathematics of public key cryptography, Cambrudge University Press, 2012.
- Joachim von zur Gathen and Jürgen Gerhard, Modern computer algebra, 3rd edition, Cambridge University Press, 2013.
- David A. Cox, John Little, and Donal O'Shea, Ideals, varieties, and algorithms, 4th edition, Springer, 2015.
- Victor Shoup, A computational introduction to number theory and algebra, 2nd edition, Cambridge University Press, 2009.
- William Stein, Modular forms, a computational approach, AMS, 2007.
- Andrew V. Sutherland, Elliptic curves, lecture notes for 18.783, MIT OpenCourseWare, 2021.