On the public citation graph

Base extension using a convolution sum in residue number systems

0 signed · 33 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-0348-5330-9openalex-snapshot
Vorlesungen über Zahlentheorie
inferredcites →https://doi.org/10.1090/s0025-5718-1976-0457374-xopenalex-snapshot
Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥). II
inferredcites →https://doi.org/10.1090/s0025-5718-1976-0457375-1openalex-snapshot
Corrigendum: “Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥). II” (Math. Comput. 30 (1976), no. 134, 337–360)
inferredcites →https://doi.org/10.1109/12.16508openalex-snapshot
Fast base extension using a redundant modulus in RNS
inferredcites →https://doi.org/10.2307/2005479openalex-snapshot
Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)

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-16763-3_9openalex-snapshot
Double Level Montgomery Cox-Rower Architecture, New Bounds
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-54840-1_6openalex-snapshot
Side Channel Attacks and Their Low Overhead Countermeasures on Residue Number System Multipliers
inferred← citeshttps://doi.org/10.1007/978-3-540-30179-0_19openalex-snapshot
Design Architecture and Model of MDVM System
inferred← citeshttps://doi.org/10.1007/978-3-540-30536-1_45openalex-snapshot
Designing the MDVM-Stub and Memory Estimator
inferred← citeshttps://doi.org/10.1007/978-3-540-30561-3_14openalex-snapshot
Designing Mobile Distributed Virtual Memory System
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-642-02384-2_22openalex-snapshot
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware
inferred← citeshttps://doi.org/10.1007/978-3-642-23951-9_28openalex-snapshot
FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
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/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/0377-0427(95)00164-6openalex-snapshot
Division in residue number systems involving length indicators
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.1109/71.382314openalex-snapshot
Modulo reduction 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.2019.00016openalex-snapshot
Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography
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/icecs66544.2025.11270539openalex-snapshot
Area-Efficient Hardware Design for Approximate Basis Conversion in RNS-Variant CKKS Schemes
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.7029536openalex-snapshot
Zero collision attack and its countermeasures on Residue Number System multipliers
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367071openalex-snapshot
Massive parallelism on a chip-VLSI aspects involving dynamic logic
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.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.25209/2079-3316-2019-10-3-81-127openalex-snapshot
High-precision computations using residue-interval arithmetic on FPGAs
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.