On the public citation graph
Selected RNS Bases for Modular Multiplication
0 signed · 68 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.1007/978-3-540-28632-5_5openalex-snapshot
Leak Resistant Arithmetic
inferredcites →https://doi.org/10.1007/978-3-540-85053-3_6openalex-snapshot
Exploiting the Power of GPUs for Asymmetric Cryptography
inferredcites →https://doi.org/10.1007/s102070100002openalex-snapshot
The Elliptic Curve Digital Signature Algorithm (ECDSA)
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/12.381948openalex-snapshot
Fast combinatorial RNS processors for DSP applications
inferredcites →https://doi.org/10.1109/71.382314openalex-snapshot
Modulo reduction in residue number systems
inferredcites →https://doi.org/10.1109/81.678485openalex-snapshot
RNS-to-binary conversion for efficient VLSI implementation
inferredcites →https://doi.org/10.1109/82.160172openalex-snapshot
An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set
inferredcites →https://doi.org/10.1109/82.471401openalex-snapshot
A high-speed realization of a residue to binary number system converter
inferredcites →https://doi.org/10.1109/acssc.1998.750847openalex-snapshot
New Chinese remainder theorems
inferredcites →https://doi.org/10.1109/acssc.2007.4487461openalex-snapshot
Residue Number System for Low-Power DSP Applications
inferredcites →https://doi.org/10.1109/arith.2001.930104openalex-snapshot
Modular multiplication and base extensions in residue number systems
inferredcites →https://doi.org/10.1109/icact.2008.4494087openalex-snapshot
A New Moduli Set {3n - 1,3n+1,3n + 2,3n - 2} in Residue Number System
inferredcites →https://doi.org/10.1109/mwscas.2003.1562409openalex-snapshot
Parallel FPGA Implementation of RSA with Residue Number Systems—Can side-channel threats be avoided?
inferredcites →https://doi.org/10.1109/tc.2003.1197124openalex-snapshot
New CRT-based RNS converter using restricted moduli set
inferredcites →https://doi.org/10.1109/tc.2007.1084openalex-snapshot
Hardware Complexity of Modular Multiplication and Exponentiation
inferredcites →https://doi.org/10.1109/tcsii.2008.2010157openalex-snapshot
A Generalization of a Fast RNS Conversion for a New 4-Modulus Base
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-14971-4_4openalex-snapshot
Residue Number Systems in Cryptography: Design, Challenges, Robustness
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_1openalex-snapshot
Introduction to Residue Number System: Structure and Teaching Methodology
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_12openalex-snapshot
RNS-Based Public-Key Cryptography (RSA and ECC)
inferred← citeshttps://doi.org/10.1007/978-3-319-72453-9_7openalex-snapshot
Fast Chinese Remaindering in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-36334-4_10openalex-snapshot
Faster Pairing Coprocessor Architecture
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/s00034-014-9799-0openalex-snapshot
Method for Designing Efficient Mixed Radix Multipliers
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-020-00231-wopenalex-snapshot
Residue arithmetic systems in cryptography: a survey on modern security applications
inferred← citeshttps://doi.org/10.1016/j.jisa.2019.102434openalex-snapshot
Steganography over Redundant Residue Number System Codes
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.1049/iet-cdt.2012.0148openalex-snapshot
A ROM‐less reverse RNS converter for moduli set {2 q ± 1, 2 q ± 3}
inferred← citeshttps://doi.org/10.1109/acssc.2011.6189975openalex-snapshot
On building general modular adders from standard binary arithmetic components
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.9openalex-snapshot
Modulo-(2^n -- 2^q -- 1) Parallel Prefix Addition via Excess-Modulo Encoding of Residues
inferred← citeshttps://doi.org/10.1109/arith51176.2021.00027openalex-snapshot
Generating Residue Number System Bases
inferred← citeshttps://doi.org/10.1109/arith54963.2022.00027openalex-snapshot
Generating Very Large RNS Bases
inferred← citeshttps://doi.org/10.1109/cads.2013.6714234openalex-snapshot
Improved modulo-(2n ± 3) multipliers
inferred← citeshttps://doi.org/10.1109/dtis.2016.7483807openalex-snapshot
Residue Number System as a side channel and fault injection attack countermeasure in elliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/eurospw.2017.56openalex-snapshot
Secure and Efficient RNS Software Implementation for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1109/iccasm.2010.5622857openalex-snapshot
An improved RNS Montgomery modular multiplier
inferred← citeshttps://doi.org/10.1109/iccke.2013.6682865openalex-snapshot
Efficient design of Elliptic Curve Point Multiplication based on fast Montgomery modular multiplication
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/ipas.2016.7880137openalex-snapshot
Efficient software implementation of RNS-montgomery modular multiplication for embedded 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/tc.2012.84openalex-snapshot
An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
inferred← citeshttps://doi.org/10.1109/tc.2013.92openalex-snapshot
Novel RNS Parameter Selection for Fast Modular Multiplication
inferred← citeshttps://doi.org/10.1109/tc.2019.2917433openalex-snapshot
A Generalized RNS Mclaughlin Modular Multiplication with Non-Coprime Moduli Sets
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/tetc.2021.3073475openalex-snapshot
Efficient Word Size Modular Arithmetic
inferred← citeshttps://doi.org/10.1109/tetc.2022.3187072openalex-snapshot
Generating Very Large RNS Bases
inferred← citeshttps://doi.org/10.1109/tps-isa48467.2019.00017openalex-snapshot
An RNS Implementation of the Elliptic Curve Cryptography for IoT Security
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase/icess.2017.344openalex-snapshot
Base Extent Optimization for RNS Montgomery Algorithm
inferred← citeshttps://doi.org/10.1109/tvlsi.2012.2210916openalex-snapshot
Efficient RNS Implementation of Elliptic Curve Point Multiplication Over ${\rm GF}(p)$
inferred← citeshttps://doi.org/10.1145/2694805.2694814openalex-snapshot
Fault and Power Analysis Attack Resistant RNS based Edwards Curve Point Multiplication
inferred← citeshttps://doi.org/10.11606/t.3.2013.tde-23052014-010449openalex-snapshot
Método de multiplicação de baixa potência para criptosistema de chave-pública.
inferred← citeshttps://doi.org/10.22436/jmcs.012.01.05openalex-snapshot
Efficient Implementation Of Rns Montgomery Multiplication Using Balanced Rns Bases
inferred← citeshttps://doi.org/10.23919/fpl.2017.8056816openalex-snapshot
Fast RNS implementation of elliptic curve point multiplication in GF(p) with selected base pairs
inferred← citeshttps://doi.org/10.24297/ijmit.v2i1.1410openalex-snapshot
Efficient Montgomery Modular Multiplication by using Residue Number System
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.3390/cryptography3020014openalex-snapshot
Improved Sum of Residues Modular Multiplication Algorithm
inferred← citeshttps://doi.org/10.46586/tches.v2019.i1.259-282openalex-snapshot
Practical Evaluation of Protected Residue Number System Scalar Multiplication
inferred← citeshttps://doi.org/10.53555/kuey.v30i5.3278openalex-snapshot
Efficient Implementation Of The Sum Of Residues Modular Reduction Using Arithmetic-Friendly RNS Moduli Set
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/a9c9f258zd5d8z4eb6za0f7z8a5b4b0e66c9openalex-snapshot
RNS-Flexible hardware accelerators for high-security asymmetric cryptography
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.