Large moduli multipliers

In this work we present a new table look-up storage scheme and a class of table look-up multipliers capable of working with exact (modular) numbering systems. Memory savings associated with the new look-up multiplier, when compared to contemporary methods, are shown to be on the order of
2/N
where
N=2^{n}
,
n
=input wordlength. Throughput is shown to be equal to that obtained using VLSI and classic architectures.