1. A Computational Introduction to Number Theory and Algebra by Victor
    Shoup, CUP, (2nd ed.), ISBN 978-0-521-51644-0, 2009.

 2. Primality Testing in Polynomial Time, From Randomized Algorithms 
    to "Prime is in P", by Martin Dietzfelbinger, LNCS 3000, Springer,
    ISBN 3-540-40344-2, 2004.
 
 3. Computational Number Theory, by Abhijit Das, Chapman and Hall/CRC,
    ISBN 978-1439866153, 2013.

 4. Computational Number Theory and Modern Cryptography, by Song Y. 
    Yan, Wiley, 978-1-118-18858-3, 2013.

 5. Prime Numbers: A Computational Perspective, by Richard Crandall and 
    Carl B. Pomerance, 2nd Ed., Springer, ISBN: 1441920501, 2010.

 6. Number Theory for Computing, by Song Y. Yan, Springer (2nd ed.), 
    ISBN 978-3-642-07710-4, 2010.

 7. Elementary Number Theory, by David Burton,  Tata McGraw-Hill,
    ISBN 978-0073051888, 2005.

 8. An Introduction to the Theory of Numbers, by Ivan Niven, Herbert S. 
    Zuckerman, Hugh L. Montgomery, John Wiley \& Sons. (5th), 
    ISBN 9971-51-301-3.

 9. Number Theory, by S G Telang, Tata McGrag-Hill Pub. Co., 1996,
    ISBN 0-07-462480-6.

 10. The Art of Computer Programming, Vol. 2, Seminumerical Algorithms,
    by Donald E Kanuth, (3rd. ed.), Addison-Wesley, 1999, 
    ISBN 981-235-883-8.