A recently introduced double-base number representation has proved to be successful in optimizing the performance of several algorithms in cryptography and digital signal processing. The index-calculus version of this number system can be regarded as a multi-dimensional extension of the classical logarithmic number system. This paper builds on previous special results by generalizing the number system both in multiple dimensions (multiple bases) and by the use of multiple digits. Adopting both generalizations we show that large reductions in hardware complexity are achievable compared to an equivalent precision logarithmic number system.
Vassil S. Dimitrov, Jonathan Eskritt, Laurent Imbe