A theta (log n) algorithm for modulo multiplication

A theta (log n) algorithm for large moduli multiplication for residue-number-system (RNS)-based architectures is proposed. The modulo multiplier is much faster than previously proposed multipliers, and more area efficient. The implementation of the multiplier is modular and is based on simple cells,...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the 32nd Midwest Symposium on Circuits and Systems s. 353 - 356 vol.1
Hlavní autori: Elleithy, K.M., Bayoumi, M.A.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1989
Predmet:
Arithmetic
Kernel
Multiplexing
Table lookup
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A theta (log n) algorithm for large moduli multiplication for residue-number-system (RNS)-based architectures is proposed. The modulo multiplier is much faster than previously proposed multipliers, and more area efficient. The implementation of the multiplier is modular and is based on simple cells, which leads to efficient VLSI realization. A VLSI implementation using 3- mu m CMOS process shows that a pipelined n-bit modulo multiplication scheme can operate with a throughput of 30M operations/s.< >
DOI:10.1109/MWSCAS.1989.101864