On the public citation graph
A General Approach for Improving RNS Montgomery Exponentiation Using Pre-processing
0 signed · 34 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-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-85053-3_6openalex-snapshot
Exploiting the Power of GPUs for Asymmetric Cryptography
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/bf02238608openalex-snapshot
Base extension using a convolution sum in residue number systems
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.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/arith.2001.930104openalex-snapshot
Modular multiplication and base extensions in residue number systems
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-08302-5_14openalex-snapshot
Practical Analysis of RSA Countermeasures Against Side-Channel Electromagnetic Attacks
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-319-54840-1_6openalex-snapshot
Side Channel Attacks and Their Low Overhead Countermeasures on Residue Number System Multipliers
inferred← citeshttps://doi.org/10.1007/s11265-024-01925-8openalex-snapshot
Fast RNS Implementation of Elliptic Curve Point Multiplication on FPGAs
inferred← citeshttps://doi.org/10.1007/s13389-015-0095-0openalex-snapshot
Vertical and horizontal correlation attacks on RNS-based exponentiations
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/j.micpro.2020.103442openalex-snapshot
WITHDRAWN: Fast RNS elliptic curve point multiplication on FPGAs
inferred← citeshttps://doi.org/10.1049/iet-cdt.2017.0017openalex-snapshot
65‐nm CMOS low‐energy RNS modular multiplier for elliptic‐curve cryptography
inferred← citeshttps://doi.org/10.1109/arith.2013.31openalex-snapshot
Fault Detection in RNS Montgomery Modular Multiplication
inferred← citeshttps://doi.org/10.1109/arith.2017.39openalex-snapshot
Lazy Leak Resistant Exponentiation in RNS
inferred← citeshttps://doi.org/10.1109/dsd.2013.44openalex-snapshot
Electromagnetic Analysis on RSA Algorithm Based on RNS
inferred← citeshttps://doi.org/10.1109/icjece.2023.3243888openalex-snapshot
High-Performance RNS Modular Exponentiation by Sum-Residue Reduction
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029534openalex-snapshot
Babaï round-off CVP method in RNS: Application to lattice based cryptographic protocols
inferred← citeshttps://doi.org/10.1109/tc.2012.84openalex-snapshot
An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
inferred← citeshttps://doi.org/10.1109/tc.2013.92openalex-snapshot
Novel RNS Parameter Selection for Fast Modular Multiplication
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase/icess.2017.344openalex-snapshot
Base Extent Optimization for RNS Montgomery Algorithm
inferred← citeshttps://doi.org/10.21203/rs.3.rs-86431/v1openalex-snapshot
High-Performance RNS Modular Exponentiation by Sum-Residue Reduction
inferred← citeshttps://doi.org/10.23919/fpl.2017.8056816openalex-snapshot
Fast RNS implementation of elliptic curve point multiplication in GF(p) with selected base pairs
inferred← citeshttps://doi.org/10.5937/bnsr15-58114openalex-snapshot
An application of residue number system arithmetics to secure hash functions design
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.