On the public citation graph
Fast base extension using a redundant modulus in RNS
0 signed · 139 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/31.7577openalex-snapshot
Residue to binary conversion for RNS arithmetic using only modular look-up tables
inferredcites →https://doi.org/10.1109/mc.1984.1659138openalex-snapshot
Residue Arithmetic A Tutorial with Examples
inferredcites →https://doi.org/10.1109/t-c.1975.224147openalex-snapshot
A Note on Fast Base Extension for Residue Number Systems with Three Moduli
inferredcites →https://doi.org/10.1109/tassp.1980.1163442openalex-snapshot
Redundant residue number systems for error detection and correction in digital filters
inferredcites →https://doi.org/10.1109/tassp.1982.1163902openalex-snapshot
The design of specialized residue classes for efficient recursive digital filter realization
inferredcites →https://doi.org/10.1109/tcs.1977.1084321openalex-snapshot
The use of residue number systems in the design of finite impulse response digital filters
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/047085474xopenalex-snapshot
Turbo Coding, Turbo Equalisation and Space‐Time Coding
inferred← citeshttps://doi.org/10.1002/9781119206804.ch6openalex-snapshot
RNS‐Based Arithmetic Circuits and Applications
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_37openalex-snapshot
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-030-12612-4_5openalex-snapshot
An Improved RNS Variant of the BFV Homomorphic Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-69255-1_7openalex-snapshot
A Scalable Simulation of the BB84 Protocol Involving Eavesdropping
inferred← citeshttps://doi.org/10.1007/978-3-030-81652-0_3openalex-snapshot
Algorithmic Acceleration of B/FV-Like Somewhat Homomorphic Encryption for Compute-Enabled RAM
inferred← citeshttps://doi.org/10.1007/978-3-031-34127-4_30openalex-snapshot
Model of Error Correction Device in RNS-FRNN
inferred← citeshttps://doi.org/10.1007/978-3-031-34127-4_4openalex-snapshot
RNS Reverse Conversion Algorithm and Parity Detection for the Wide Arbitrary Moduli Set
inferred← citeshttps://doi.org/10.1007/978-3-031-73122-8_5openalex-snapshot
RISC-V Word-Size Modular Instructions for Residue Number Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-41385-3_6openalex-snapshot
Scaling, Base Extension, Sign Detection and Comparison in RNS
inferred← citeshttps://doi.org/10.1007/978-3-319-41385-3_7openalex-snapshot
Error Detection, Correction and Fault Tolerance in RNS-Based Designs
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_13openalex-snapshot
RNS Approach in Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-69453-5_23openalex-snapshot
A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_5openalex-snapshot
Leak Resistant Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-77272-9_22openalex-snapshot
Toward Acceleration of RSA Using 3D Graphics Hardware
inferred← citeshttps://doi.org/10.1007/978-3-540-85053-3_6openalex-snapshot
Exploiting the Power of GPUs for Asymmetric Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-15031-9_4openalex-snapshot
A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
inferred← citeshttps://doi.org/10.1007/978-3-662-48324-4_7openalex-snapshot
Single Base Modular Multiplication for Efficient Hardware RNS Implementations of ECC
inferred← citeshttps://doi.org/10.1007/978-81-322-1695-7_27openalex-snapshot
Improved RNS Montgomery Modular Multiplication with Residue Recovery
inferred← citeshttps://doi.org/10.1007/bf01188092openalex-snapshot
Fast algorithms for erasures and error correction in redundant residue number systems
inferred← citeshttps://doi.org/10.1007/bf01608538openalex-snapshot
A superfast algorithm for single-error correction in rrns and hardware implementation
inferred← citeshttps://doi.org/10.1007/bf02238608openalex-snapshot
Base extension using a convolution sum in residue number systems
inferred← citeshttps://doi.org/10.1007/s00034-016-0336-1openalex-snapshot
Highly Parallel Modular Multiplier for Elliptic Curve Cryptography in Residue Number System
inferred← citeshttps://doi.org/10.1007/s00224-021-10035-yopenalex-snapshot
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System
inferred← citeshttps://doi.org/10.1007/s11265-014-0879-yopenalex-snapshot
A Flexible Architecture for Modular Arithmetic Hardware Accelerators based on RNS
inferred← citeshttps://doi.org/10.1007/s11432-010-0015-yopenalex-snapshot
A 2 n scaling scheme for signed RNS integers and its VLSI implementation
inferred← citeshttps://doi.org/10.1007/s11767-997-1006-4openalex-snapshot
Fault-tolerant performance of data transmission models based on redundant residue number system
inferred← citeshttps://doi.org/10.1007/s13389-017-0154-9openalex-snapshot
Montgomery reduction within the context of residue number system arithmetic
inferred← citeshttps://doi.org/10.1007/s13389-021-00260-zopenalex-snapshot
Montgomery-friendly primes and applications to cryptography
inferred← citeshttps://doi.org/10.1016/0377-0427(95)00164-6openalex-snapshot
Division in residue number systems involving length indicators
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.06.005openalex-snapshot
New distributed algorithms for fast sign detection in residue number systems (RNS)
inferred← citeshttps://doi.org/10.1016/j.neunet.2004.11.006openalex-snapshot
NEUROM: a ROM based RNS digital neuron
inferred← citeshttps://doi.org/10.1016/s0045-7906(97)00033-5openalex-snapshot
Optimal VLSI complexity design for high speed pipeline FFT using RNS
inferred← citeshttps://doi.org/10.1016/s0167-4048(99)80061-3openalex-snapshot
RNS-modulo reduction upon a restricted base value set and its applicability to RSA cryptography
inferred← citeshttps://doi.org/10.1016/s1383-7621(97)00085-4openalex-snapshot
Sign detection in residue arithmetic units
inferred← citeshttps://doi.org/10.1093/comjnl/bxr119openalex-snapshot
RNS-Based Elliptic Curve Point Multiplication for Massive Parallel Architectures
inferred← citeshttps://doi.org/10.1109/12.214689openalex-snapshot
A systolic redundant residue arithmetic error correction circuit
inferred← citeshttps://doi.org/10.1109/12.237724openalex-snapshot
On theory and fast algorithms for error correction in residue number system product codes
inferred← citeshttps://doi.org/10.1109/12.381948openalex-snapshot
Fast combinatorial RNS processors for DSP applications
inferred← citeshttps://doi.org/10.1109/12.57044openalex-snapshot
An algorithm for scaling and single residue error correction in residue number systems
inferred← citeshttps://doi.org/10.1109/12.709376openalex-snapshot
An RNS Montgomery modular multiplication algorithm
inferred← citeshttps://doi.org/10.1109/71.382314openalex-snapshot
Modulo reduction in residue number systems
inferred← citeshttps://doi.org/10.1109/78.469842openalex-snapshot
Fast base extension and precise scaling in RNS for look-up table implementations
inferred← citeshttps://doi.org/10.1109/82.204106openalex-snapshot
A coding theory approach to error control in redundant residue number systems. I. Theory and single error correction
inferred← citeshttps://doi.org/10.1109/82.204107openalex-snapshot
A coding theory approach to error control in redundant residue number systems. II. Multiple error detection and correction
inferred← citeshttps://doi.org/10.1109/82.782047openalex-snapshot
Multifunction architectures for RNS processors
inferred← citeshttps://doi.org/10.1109/access.2016.2599269openalex-snapshot
New Residue Arithmetic Based Barrett Algorithms: Modular Integer Computations
inferred← citeshttps://doi.org/10.1109/access.2026.3658819openalex-snapshot
A Survey and Review on the BFV Homomorphic Encryption Hardware Architecture Implementations
inferred← citeshttps://doi.org/10.1109/acit69831.2026.11700118openalex-snapshot
Encryption Methods in the RNS Based on Changing Parameters of the Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1109/acssc.1989.1200979openalex-snapshot
New algorithms for correcting errors in redundant residue number systems
inferred← citeshttps://doi.org/10.1109/acssc.1999.831919openalex-snapshot
Montgomery modular multiplication and exponentiation in the residue number system
inferred← citeshttps://doi.org/10.1109/acssc.2000.911210openalex-snapshot
Modular multiplication in the residue number system with application to massively-parallel public-key cryptography systems
inferred← citeshttps://doi.org/10.1109/acssc.2001.987762openalex-snapshot
Modular multiplication in the Montgomery residue number system
inferred← citeshttps://doi.org/10.1109/acssc.2007.4487465openalex-snapshot
An RNS-Enhanced Microprocessor Implementation of Public Key Cryptography
inferred← citeshttps://doi.org/10.1109/apccas.2016.7803882openalex-snapshot
Accelerating residue-to-binary conversion of very high cardinality moduli set for fully homomorphic encryption
inferred← citeshttps://doi.org/10.1109/arith.1997.614900openalex-snapshot
An RNS Montgomery modular multiplication algorithm
inferred← citeshttps://doi.org/10.1109/arith.2001.930104openalex-snapshot
Modular multiplication and base extensions in residue number systems
inferred← citeshttps://doi.org/10.1109/arith.2011.35openalex-snapshot
A General Approach for Improving RNS Montgomery Exponentiation Using Pre-processing
inferred← citeshttps://doi.org/10.1109/arith.2013.31openalex-snapshot
Fault Detection in RNS Montgomery Modular Multiplication
inferred← citeshttps://doi.org/10.1109/arith.2015.25openalex-snapshot
Contributions to the Design of Residue Number System Architectures
inferred← citeshttps://doi.org/10.1109/arith.2015.30openalex-snapshot
RNS Arithmetic Approach in Lattice-Based Cryptography: Accelerating the "Rounding-off" Core Procedure
inferred← citeshttps://doi.org/10.1109/arith.2016.15openalex-snapshot
Hybrid Position-Residues Number System
inferred← citeshttps://doi.org/10.1109/arith.2019.00016openalex-snapshot
Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography
inferred← citeshttps://doi.org/10.1109/arith48897.2020.00020openalex-snapshot
An asymptotically faster version of FV supported on HPR
inferred← citeshttps://doi.org/10.1109/arith54963.2022.00025openalex-snapshot
A software comparison of RNS and PMNS
inferred← citeshttps://doi.org/10.1109/asap.2010.5541000openalex-snapshot
Elliptic Curve point multiplication on GPUs
inferred← citeshttps://doi.org/10.1109/asap.2014.6868631openalex-snapshot
RNS modular multiplication through reduced base extensions
inferred← citeshttps://doi.org/10.1109/assp.1989.28063openalex-snapshot
A fast and accurate RNS scaling technique for high speed signal processing
inferred← citeshttps://doi.org/10.1109/dasip.2010.5706242openalex-snapshot
A new single-error correction scheme based on self-diagnosis residue number arithmetic
inferred← citeshttps://doi.org/10.1109/dsd.2013.44openalex-snapshot
Electromagnetic Analysis on RSA Algorithm Based on RNS
inferred← citeshttps://doi.org/10.1109/eurmic.1994.390354openalex-snapshot
The 'diagonal function' in non-redundant residue number system
inferred← citeshttps://doi.org/10.1109/icapp.1995.472276openalex-snapshot
Designing a new encryption method for optimum parallel performance
inferred← citeshttps://doi.org/10.1109/icassp.2017.7952342openalex-snapshot
New residue arithmetic based Barrett algorithms: Modular polynomial computations
inferred← citeshttps://doi.org/10.1109/icecs66544.2025.11270539openalex-snapshot
Area-Efficient Hardware Design for Approximate Basis Conversion in RNS-Variant CKKS Schemes
inferred← citeshttps://doi.org/10.1109/icent.2017.36openalex-snapshot
Fast Power-of-Two RNS Scaling Algorithm for Large Dynamic Ranges
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5362740openalex-snapshot
Channel Operations in the Residue Number System with Special Modulus on Hardware
inferred← citeshttps://doi.org/10.1109/icjece.2023.3243888openalex-snapshot
High-Performance RNS Modular Exponentiation by Sum-Residue Reduction
inferred← citeshttps://doi.org/10.1109/icpeca47973.2019.8975450openalex-snapshot
Fast Base Extension using Single Redundant Modulus in a Residue Number System
inferred← citeshttps://doi.org/10.1109/ipas.2016.7880137openalex-snapshot
Efficient software implementation of RNS-montgomery modular multiplication for embedded system
inferred← citeshttps://doi.org/10.1109/iscas.2001.921171openalex-snapshot
Fault-tolerance scheme for an RNS MAC: performance and cost analysis
inferred← citeshttps://doi.org/10.1109/iscas.2005.1464785openalex-snapshot
Programmable Power-of-two RNS Scaler and its Application to a QRNS Polyphase Filter
inferred← citeshttps://doi.org/10.1109/iscas.2014.6865614openalex-snapshot
Method for designing multi-channel RNS architectures to prevent power analysis SCA
inferred← citeshttps://doi.org/10.1109/iscas66217.2026.11562540openalex-snapshot
Time-Area Efficient RNS Base-conversion Architecture for HPS-BFV Homomorphic Encryption using Generalized Solinas Primes
inferred← citeshttps://doi.org/10.1109/iscit.2012.6380956openalex-snapshot
An implementation of a scaler in the Residue number System
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029534openalex-snapshot
Babaï round-off CVP method in RNS: Application to lattice based cryptographic protocols
inferred← citeshttps://doi.org/10.1109/isit.2018.8437612openalex-snapshot
A Multi-layer Recursive Residue Number System
inferred← citeshttps://doi.org/10.1109/itqmis56172.2022.9976871openalex-snapshot
Efficient Two-level RNS Reverse Conversion Algorithm for Big Number of Modules
inferred← citeshttps://doi.org/10.1109/jiot.2018.2881425openalex-snapshot
Signature Gateway: Offloading Signature Generation to IoT Gateway Accelerated by GPU
inferred← citeshttps://doi.org/10.1109/mcas.2016.2614714openalex-snapshot
Combining Residue Arithmetic to Design Efficient Cryptographic Circuits and Systems
inferred← citeshttps://doi.org/10.1109/mwscas.1997.666114openalex-snapshot
Modular reduction by multi-level table lookup
inferred← citeshttps://doi.org/10.1109/mwscas.2003.1562409openalex-snapshot
Parallel FPGA Implementation of RSA with Residue Number Systems—Can side-channel threats be avoided?
inferred← citeshttps://doi.org/10.1109/naecon49338.2021.9696438openalex-snapshot
Smart FFT measurement for Reconfigurable Sensor using a Wideband digital receiver
inferred← citeshttps://doi.org/10.1109/nrsc.2001.929397openalex-snapshot
A secure image coding scheme using residue number system
inferred← citeshttps://doi.org/10.1109/ojcas.2025.3581188openalex-snapshot
High Throughput Arithmetic Computing Unit for BFV Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/samos.2017.8344638openalex-snapshot
Pipelined FPGA coprocessor for elliptic curve cryptography based on residue number system
inferred← citeshttps://doi.org/10.1109/sbcci.1998.715403openalex-snapshot
Reconfigurable hardware for tomographic processing
inferred← citeshttps://doi.org/10.1109/tc.2012.84openalex-snapshot
An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
inferred← citeshttps://doi.org/10.1109/tc.2017.2690420openalex-snapshot
Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices
inferred← citeshttps://doi.org/10.1109/tc.2021.3086071openalex-snapshot
Up to 8k-bit Modular Montgomery Multiplication in Residue Number Systems with Fast 16-bit Residue Channels
inferred← citeshttps://doi.org/10.1109/tc.2022.3227874openalex-snapshot
CARM: CUDA-Accelerated RNS Multiplication in Word-Wise Homomorphic Encryption Schemes for Internet of Things
inferred← citeshttps://doi.org/10.1109/tc.2023.3301116openalex-snapshot
Accelerating Finite-Field and Torus Fully Homomorphic Encryption via Compute-Enabled (S)RAM
inferred← citeshttps://doi.org/10.1109/tcsi.2019.2951083openalex-snapshot
Res-DNN: A Residue Number System-Based DNN Accelerator Unit
inferred← citeshttps://doi.org/10.1109/tetc.2019.2902799openalex-snapshot
Implementation and Performance Evaluation of RNS Variants of the BFV Homomorphic Encryption Scheme
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2004550openalex-snapshot
Fast Scaling in the Residue Number System
inferred← citeshttps://doi.org/10.1109/vlsisp.1994.574771openalex-snapshot
Optimal table lookup schemes for VLSI implementation of input/output conversions and other residue number operations
inferred← citeshttps://doi.org/10.1117/12.406499openalex-snapshot
Some improvements on RNS Montgomery modular multiplication
inferred← citeshttps://doi.org/10.1117/12.679541openalex-snapshot
Residue systems efficiency for modular products summation: application to elliptic curves cryptography
inferred← citeshttps://doi.org/10.1142/s021812660700371xopenalex-snapshot
FAST RESIDUE-TO-BINARY CONVERSION USING BASE EXTENSION AND THE CHINESE REMAINDER THEOREM
inferred← citeshttps://doi.org/10.1142/s0219876220500048openalex-snapshot
An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
inferred← citeshttps://doi.org/10.1145/2442829.2442870openalex-snapshot
Deterministic unimodularity certification
inferred← citeshttps://doi.org/10.21203/rs.3.rs-86431/v1openalex-snapshot
High-Performance RNS Modular Exponentiation by Sum-Residue Reduction
inferred← citeshttps://doi.org/10.25209/2079-3316-2019-10-3-81-127openalex-snapshot
High-precision computations using residue-interval arithmetic on FPGAs
inferred← citeshttps://doi.org/10.31237/osf.io/j6rxpopenalex-snapshot
Design of a Modular Multiplier for Public-Key Cryptography Applications Using Residue Number System and Signed-Digit Representation
inferred← citeshttps://doi.org/10.32657/10356/66937openalex-snapshot
New algorithms and VLSI architectures for efficient RNS computations
inferred← citeshttps://doi.org/10.32657/10356/70712openalex-snapshot
New algorithms for hardware-efficient implementation of sign detection and magnitude comparison in residue number systems
inferred← citeshttps://doi.org/10.3390/cryptography3020014openalex-snapshot
Improved Sum of Residues Modular Multiplication Algorithm
inferred← citeshttps://doi.org/10.3390/e24121824openalex-snapshot
An Efficient CRT-Base Power-of-Two Scaling in Minimally Redundant Residue Number System
inferred← citeshttps://doi.org/10.4236/wet.2013.44029openalex-snapshot
Parallel Algorithms for Residue Scaling and Error Correction in Residue Arithmetic
inferred← citeshttps://doi.org/10.46586/tches.v2018.i2.70-95openalex-snapshot
High-Performance FV Somewhat Homomorphic Encryption on GPUs: An Implementation using CUDA
inferred← citeshttps://doi.org/10.48550/arxiv.1209.5520openalex-snapshot
Accelerating Iterative SpMV for Discrete Logarithm Problem Using GPUs
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01551openalex-snapshot
New Residue Arithmetic Based Barrett Algorithms, Part I: Modular Integer Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01553openalex-snapshot
New Residue Arithmetic Based Barrett Algorithms, Part II: Modular Polynomial Computations
inferred← citeshttps://doi.org/10.5555/552517.829453openalex-snapshot
Reconfigurable hardware for tomographic processing
inferred← citeshttps://doi.org/10.5802/pmb.a-152openalex-snapshot
Combining leak-resistant arithmetic for elliptic curves defined over 𝔽 p and RNS representation
inferred← citeshttps://doi.org/10.70675/8966b36czb696z4648zaa9azd33fc8334966openalex-snapshot
Towards efficient arithmetic for Ring-LWE based homomorphic encryption
inferred← citeshttps://doi.org/10.70675/a9c9f258zd5d8z4eb6za0f7z8a5b4b0e66c9openalex-snapshot
RNS-Flexible hardware accelerators for high-security asymmetric cryptography
inferred← citeshttps://doi.org/10.70675/b43ad09bz5077z47a7z9f02zabb4545b0fceopenalex-snapshot
Leak study of cryptosystem implementations in randomized RNS arithmetic
inferred← citeshttps://doi.org/10.9734/bjmcs/2015/19903openalex-snapshot
Computational Algorithms for Syndrome Based Single Error Correction in Residue Number Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.