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,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 32nd Midwest Symposium on Circuits and Systems S. 353 - 356 vol.1
Hauptverfasser: Elleithy, K.M., Bayoumi, M.A.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 1989
Schlagworte:
Arithmetic
Kernel
Multiplexing
Table lookup
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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