A generalisation of Brickell's algorithm for fast modular multiplication

Abstract

Abstract.BrickeWs algorithm finds A x Bmod C for n-bit integers A, B, C, using O(n) hardware to achieve an O(n) running time. This paper gives a generalisation of his algorithm, and presents a proof, missing from Brickell's paper, that it works, showing the existence of other similar schemes.