On the public citation graph
Multi-fault Attack Detection for RNS Cryptographic Architecture
0 signed · 31 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/3-540-36400-5_22openalex-snapshot
The Montgomery Powering Ladder
inferredcites →https://doi.org/10.1007/3-540-44709-1_21openalex-snapshot
Electromagnetic Analysis: Concrete Results
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-68697-5_9openalex-snapshot
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
inferredcites →https://doi.org/10.1007/978-3-319-16763-3_9openalex-snapshot
Double Level Montgomery Cox-Rower Architecture, New Bounds
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.1007/978-3-642-36334-4_10openalex-snapshot
Faster Pairing Coprocessor Architecture
inferredcites →https://doi.org/10.1007/978-3-642-40349-1_14openalex-snapshot
Improving Modular Inversion in RNS Using the Plus-Minus Method
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/71.382314openalex-snapshot
Modulo reduction in residue number systems
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.2013.31openalex-snapshot
Fault Detection in RNS Montgomery Modular Multiplication
inferredcites →https://doi.org/10.1109/proc.1966.5275openalex-snapshot
Self-checked computation using residue arithmetic
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-34339-2_22openalex-snapshot
Using Freivalds’ Algorithm to Accelerate Lattice-Based Signature Verifications
inferred← citeshttps://doi.org/10.1007/978-3-030-97348-3_14openalex-snapshot
Enhanced Encodings for White-Box Designs
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.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/ccwc47524.2020.9031218openalex-snapshot
Continuous Error Detection and Correction of Arithmetic in a Complement RRNS
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/hpca.2018.00065openalex-snapshot
Memory System Design for Ultra Low Power, Computationally Error Resilient Processor Microarchitectures
inferred← citeshttps://doi.org/10.1109/idaacs.2019.8924395openalex-snapshot
A Method for Decimal Number Recovery from its Residues Based on the Addition of the Product Modules
inferred← citeshttps://doi.org/10.1109/tetc.2022.3187072openalex-snapshot
Generating Very Large RNS Bases
inferred← citeshttps://doi.org/10.1145/3177837openalex-snapshot
Extending Moore’s Law via Computationally Error-Tolerant Computing
inferred← citeshttps://doi.org/10.1515/jmc-2016-0066openalex-snapshot
Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices
inferred← citeshttps://doi.org/10.18372/2410-7840.26.18825openalex-snapshot
АРИФМЕТИКА АСИМЕТРИЧНИХ КРИПТОСИСТЕМ В ПОЛІ КОМПЛЕКСНИХ ЧИСЕЛ
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.