Public-key Cryptography: Theory and Practice

Suggestions for Further Reading

The integer factorization problem is one of the oldest computational problems. Though the exact notion of computational complexity took shape only after the advent of computers, the apparent difficulty of solving the factorization problem has been noticed centuries ago. Crandall and Pomerance [69] call it the fundamental computational problem of arithmetic. Numerous books and articles provide discussions on this subject at varying levels of coverage. Crandall and Pomerance [69] is perhaps the most extensive in this regard. The reader can also take a look at Bressoud’s (much simpler) book [36] or the (compact, yet reasonably detailed) Chapter 10 of Henri Cohen’s book [56]. The articles by Lenstra et al. [164] and ...