Fast base extension using a redundant modulus in RNS
From MaRDI portal
Recommendations
- Base extension using a convolution sum in residue number systems
- Fast conversion techniques for binary-residue number systems
- Computational Science and Its Applications – ICCSA 2004
- Four moduli RNS bases for efficient design of modular multiplication
- A high-speed residue-to-binary converter for three-moduli \((2^k, 2^k -1, 2^{k-1} -1)\) RNS and a scheme for its VLSI implementation
Cited in
(12)- Fast algorithms for erasures and error correction in redundant residue number systems
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Division in residue number systems involving length indicators
- Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system
- Base extension using a convolution sum in residue number systems
- Highly parallel modular multiplier for elliptic curve cryptography in residue number system
- Methodology for basic selection in recursive residue number system
- An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
- Toward Acceleration of RSA Using 3D Graphics Hardware
- Exploiting the Power of GPUs for Asymmetric Cryptography
- Pursuit and synchronization in hydrodynamic dipoles
- Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM
This page was built for publication: Fast base extension using a redundant modulus in RNS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3817598)
