Fast Algorithms for Large-Integer Arithmetic

This chapter explores the galaxy of “fast” algorithms that admit of applications in prime number and factorization computations, and starts with multiplication, which is perhaps the simplest arithmetic algorithm whose classical form admits of genuine enhancements.