Optimisation of Montgomery modular multiplication algorithm for systolic arrays

Abstract

An improved systolic array for the Montgomery modular multiplication algorithm is presented. The recursive equation proposed by Waiter is explicitly transformed into Boolean algebraic equations. By analysing and optimising these equations, the improved systolic array can he made 20% faster than that proposed by Walter.