On the public citation graph

Fault Detection in RNS Montgomery Modular Multiplication

0 signed · 38 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-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/3-540-69053-0_4openalex-snapshot
On the Importance of Checking Cryptographic Protocols for Faults
inferredcites →https://doi.org/10.1007/978-3-540-28632-5_5openalex-snapshot
Leak Resistant Arithmetic
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.1016/s0026-2692(97)00046-3openalex-snapshot
Principles of digital design
inferredcites →https://doi.org/10.1017/cbo9780511661952openalex-snapshot
Algorithmic Algebraic Number Theory
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1093/comjnl/bxr119openalex-snapshot
RNS-Based Elliptic Curve Point Multiplication for Massive Parallel Architectures
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/arith.2001.930104openalex-snapshot
Modular multiplication and base extensions in residue number systems
inferredcites →https://doi.org/10.1109/arith.2011.35openalex-snapshot
A General Approach for Improving RNS Montgomery Exponentiation Using Pre-processing
inferredcites →https://doi.org/10.1109/proc.1966.5275openalex-snapshot
Self-checked computation using residue arithmetic
inferredcites →https://doi.org/10.1109/t-c.1973.223594openalex-snapshot
Error Correction in Redundant Residue Number Systems
inferredcites →https://doi.org/10.1109/t-c.1973.223711openalex-snapshot
Error Correcting Properties of Redundant Residue Number Systems
inferredcites →https://doi.org/10.1109/tc.1972.5009006openalex-snapshot
Error Correction in Residue Arithmetic
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.1145/1457838.1457864openalex-snapshot
The residue number system

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-030-99766-3_1openalex-snapshot
Machine-Learning Assisted Side-Channel Attacks on RNS ECC Implementations Using Hybrid Feature Engineering
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_12openalex-snapshot
RNS-Based Public-Key Cryptography (RSA and ECC)
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.1109/arith.2016.16openalex-snapshot
Multi-fault Attack Detection for RNS Cryptographic Architecture
inferred← citeshttps://doi.org/10.1109/arith51176.2021.00027openalex-snapshot
Generating Residue Number System Bases
inferred← citeshttps://doi.org/10.1109/asap.2014.6868631openalex-snapshot
RNS modular multiplication through reduced base extensions
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/tc.2017.2722440openalex-snapshot
Efficient Detection for Malicious and Random Errors in Additive Encrypted Computation
inferred← citeshttps://doi.org/10.1109/tcad.2025.3592590openalex-snapshot
Partial Recomputation Fault Detection Architecture for Multiple-Precision Montgomery Modular Multiplication
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.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/app12073365openalex-snapshot
Error-Correction Coding Using Polynomial Residue Number System
inferred← citeshttps://doi.org/10.3390/computation7040063openalex-snapshot
Field Programmable Gate Array Applications—A Scientometric Review
inferred← citeshttps://doi.org/10.46586/tches.v2019.i1.259-282openalex-snapshot
Practical Evaluation of Protected Residue Number System Scalar Multiplication
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.