A generalisation of Brickell's algorithm for fast modular multiplication (Q1115183)

Brickell's algorithm [\textit{E. F. Brickell}, Advances in cryptology, Proc. Workshop, Santa Barbara/Calif. 1982, 51-60 (1983; Zbl 0519.68058)] finds \(A\times B\) mod C for n-bit integers A, B, C, using O(n) hardware to achieve an O(n) running time. This paper gives a generalization of his algorithm, and presents a proof, missing from Brickell's paper, that it works, showing the existence of other similar schemes.