RESIDUE NUMBER SYSTEM ENHANCEMENTS FOR PROGRAMMABLE PROCESSORS

330 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

CacheBleed: a timing attack on OpenSSL constant-time RSA (2016, methodology): “The message m can then be recovered from m p and mq using Garner’s formula [23]:”
FLUSH+RELOAD: A High Resolution, Low Noise, L3 Cache Side-Channel Attack (2014, methodology): “m is then computed from mp and mq using Garner’s formula [25]:”
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (2021, background): “RNS representation [31] enables representing a single polynomial with wide coefficients as multiple polynomials with narrower coefficients, called residue polynomials.”
A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes (2016, background): “And the rounding operation involves comparisons which require to switch from RNS to another positional system anyway, should it be a classical binary system or a mixed-radix one [12].”