A study of the residue-to-binary converters for the three-moduli sets

DOI10.1109/TCSI.2002.808191MaRDI QIDQ5349624zbMATH OpenFDO

Authors Wei Wang, M. N. S. Swamy, M. Omair Ahmad, Yuke Wang

Publication date 25 August 2017

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCSI.2002.808191

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited in

(5)

• Hierarchical residue number systems with small moduli and simple converters
• New adder-based RNS-to-binary converters for the \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\) moduli set
• An iterative modular multiplication algorithm in RNS
• Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM
• An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications

This page was built for publication: A study of the residue-to-binary converters for the three-moduli sets

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