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

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 32nd Midwest Symposium on Circuits and Systems pp. 353 - 356 vol.1
Main Authors: Elleithy, K.M., Bayoumi, M.A.
Format: Conference Proceeding
Language:English
Published: IEEE 1989
Subjects:
Arithmetic
Kernel
Multiplexing
Table lookup
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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