Overview The Crandall reduction algorithm provides an efficient way to compute modular reduction for numbers of the special form p = 2^k + c. This is particularly useful in cryptographic applications, ...

You may never have heard of modular arithmetic, but you use it every day without the slightest difficulty. In this system, numbers wrap around when they reach a certain size called the modulus; it ...