On the public citation graph

Hybrid Position-Residues Number System

0 signed · 35 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/3-540-36400-5_22openalex-snapshot
The Montgomery Powering Ladder
inferredcites →https://doi.org/10.1007/3-540-44709-1_30openalex-snapshot
Implementation of RSA Algorithm Based on RNS 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-3-540-30564-4_11openalex-snapshot
Modular Number Systems: Beyond the Mersenne Family
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-662-48324-4_7openalex-snapshot
Single Base Modular Multiplication for Efficient Hardware RNS Implementations of ECC
inferredcites →https://doi.org/10.1007/b97644openalex-snapshot
Guide to Elliptic Curve Cryptography
inferredcites →https://doi.org/10.1007/s11265-014-0875-2openalex-snapshot
An Efficient Scalable RNS Architecture for Large Dynamic Ranges
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/12.16508openalex-snapshot
Fast base extension using a redundant modulus in RNS
inferredcites →https://doi.org/10.1109/12.709376openalex-snapshot
An RNS Montgomery modular multiplication algorithm
inferredcites →https://doi.org/10.1109/71.382314openalex-snapshot
Modulo reduction in residue number systems
inferredcites →https://doi.org/10.1109/78.80821openalex-snapshot
On the polynomial residue number system (digital signal processing)
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/arith.2015.25openalex-snapshot
Contributions to the Design of Residue Number System Architectures
inferredcites →https://doi.org/10.1109/arith.2015.30openalex-snapshot
RNS Arithmetic Approach in Lattice-Based Cryptography: Accelerating the "Rounding-off" Core Procedure
inferredcites →https://doi.org/10.1109/asap.2014.6868631openalex-snapshot
RNS modular multiplication through reduced base extensions
inferredcites →https://doi.org/10.1109/t-c.1975.224172openalex-snapshot
The Sign/Logarithm Number System
inferredcites →https://doi.org/10.1109/tc.2012.84openalex-snapshot
An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
inferredcites →https://doi.org/10.1109/tcsi.2013.2283674openalex-snapshot
Multifunction Residue Architectures for Cryptography
inferredcites →https://doi.org/10.1109/tec.1959.5219515openalex-snapshot
The Residue Number System
inferredcites →https://doi.org/10.1109/tec.1961.5219227openalex-snapshot
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
inferredcites →https://doi.org/10.1145/582475.582479openalex-snapshot
Modern computer algebra

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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/access.2020.2982365openalex-snapshot
Using Floating-Point Intervals for Non-Modular Computations in Residue Number System
inferred← citeshttps://doi.org/10.1109/access.2020.2983020openalex-snapshot
The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
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/arith.2019.00049openalex-snapshot
HyPoRes: An Hybrid Representation System for ECC
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.00027openalex-snapshot
Generating Very Large RNS Bases
inferred← citeshttps://doi.org/10.1109/dessert50317.2020.9125030openalex-snapshot
Determination of Positional Characteristics of Numbers in the Residual Class System
inferred← citeshttps://doi.org/10.1109/tetc.2022.3187072openalex-snapshot
Generating Very Large RNS Bases
inferred← citeshttps://doi.org/10.1145/3320326.3320353openalex-snapshot
Introduction to Steganography in RRNS based Communications
inferred← citeshttps://doi.org/10.70675/761ba544z2838z4a66z904ez582aa59d3055openalex-snapshot
Représentations adaptées à l'arithmétique modulaire et à la résolution de systèmes flous
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.