A Low-Complexity High-Radix RNS Multiplier

DOI10.1109/TCSI.2009.2015548MaRDI QIDQ5010892zbMATH OpenOpenAlexFDO

Authors Ioannis Kouretas, Vassilis Paliouras

Publication date 26 August 2021

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcsi.2009.2015548

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Mathematical problems of computer architecture (68M07)

Recommendations

• A low-complexity combinatorial RNS multiplier
• Fast and highly compact RNS multipliers
• New efficient structure for a modular multiplier for RNS
• scientific article; zbMATH DE number 1878333
• Area-Efficient Multipliers Based on Multiple-Radix Representations
• High-Radix Design of a Scalable Montgomery Modular Multiplier With Low Latency
• scientific article; zbMATH DE number 4191561
• An iterative modular multiplication algorithm in RNS
• scientific article; zbMATH DE number 1024495

Cited in

(5)

• Very-high radix CORDIC rotation based on selection by rounding
• Single base modular multiplication for efficient hardware RNS implementations of ECC
• A low-complexity combinatorial RNS multiplier
• Fast Radix-10 Multiplication Using Redundant BCD Codes
• Area-Efficient Multipliers Based on Multiple-Radix Representations

This page was built for publication: A Low-Complexity High-Radix RNS Multiplier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010892)