Fast base extension using a redundant modulus in RNS

DOI10.1109/12.16508zbMath0666.68031OpenAlexW2058358002MaRDI QIDQ3817598

No author found.

Publication date: 1989

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

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

zbMATH Keywords

residue number systemcomputer arithmeticbase extensionredundant residue channel

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Radix representation; digital problems (11A63)

Related Items (11)

Base extension using a convolution sum in residue number systems ⋮ Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM ⋮ Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ Division in residue number systems involving length indicators ⋮ A full RNS variant of FV like somewhat homomorphic encryption schemes ⋮ Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system ⋮ Toward Acceleration of RSA Using 3D Graphics Hardware ⋮ Pursuit and synchronization in hydrodynamic dipoles ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ Exploiting the Power of GPUs for Asymmetric Cryptography ⋮ Fast algorithms for erasures and error correction in redundant residue number systems

This page was built for publication: Fast base extension using a redundant modulus in RNS