On the public citation graph

Contributions to the Design of Residue Number System Architectures

0 signed · 24 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.1006/jsco.1996.0125openalex-snapshot
The Magma Algebra System I: The User Language
inferredcites →https://doi.org/10.1007/3-540-36400-5_5openalex-snapshot
Enhanced Montgomery Multiplication
inferredcites →https://doi.org/10.1007/3-540-45539-6_37openalex-snapshot
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-642-15031-9_4openalex-snapshot
A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
inferredcites →https://doi.org/10.1007/978-3-642-23951-9_28openalex-snapshot
FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
inferredcites →https://doi.org/10.1109/12.16508openalex-snapshot
Fast base extension using a redundant modulus in RNS
inferredcites →https://doi.org/10.1109/71.382314openalex-snapshot
Modulo reduction in residue number systems
inferredcites →https://doi.org/10.1109/arith.2009.20openalex-snapshot
Selected RNS Bases for Modular Multiplication
inferredcites →https://doi.org/10.4153/cjm-1965-045-4openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

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-031-67348-1_13openalex-snapshot
Fault-Tolerant Operation of an Integer Data Processing 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-018-0195-8openalex-snapshot
RNS Montgomery reduction algorithms using quadratic residuosity
inferred← citeshttps://doi.org/10.1109/access.2019.2914641openalex-snapshot
Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation
inferred← citeshttps://doi.org/10.1109/arith.2016.15openalex-snapshot
Hybrid Position-Residues Number System
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/dessert61349.2023.10416508openalex-snapshot
An Improved Method for Performing the Arithmetic Operations of Modulo Addition of the Remainders of Numbers
inferred← citeshttps://doi.org/10.1109/tetc.2022.3187072openalex-snapshot
Generating Very Large RNS Bases
inferred← citeshttps://doi.org/10.15588/1607-3274-2022-4-2openalex-snapshot
METHODS FOR TABULAR IMPLEMENTATION OF ARITHMETIC OPERATIONS OF THE RESIDUES OF TWO NUMBERS REPRESENTED IN THE SYSTEM OF RESIDUAL CLASSES
inferred← citeshttps://doi.org/10.17513/snt.37195openalex-snapshot
FAST MULTIPLICATION IN RESIDUE NUMBER SYSTEMS USING INTERVAL LOGARITHMIC CHARACTERISTIC
inferred← citeshttps://doi.org/10.20535/tacs.2664-29132023.2.278891openalex-snapshot
Mathematical Model of the Process of Raising Integers to an Arbitrary Power of a Natural Number in the System of Residual Classes
inferred← citeshttps://doi.org/10.3390/computation7040063openalex-snapshot
Field Programmable Gate Array Applications—A Scientometric Review
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.