On the public citation graph

An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS

0 signed · 56 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/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.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/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.2009.20openalex-snapshot
Selected RNS Bases for Modular Multiplication
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/tc.2004.2openalex-snapshot
a full RNS implementation of RSA

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119206804.ch6openalex-snapshot
RNS‐Based Arithmetic Circuits and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-34142-8_6openalex-snapshot
Modular Exponentiation, Inversion, and Division
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-41385-3_10openalex-snapshot
RNS in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_1openalex-snapshot
Introduction to Residue Number System: Structure and Teaching Methodology
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-642-40349-1_14openalex-snapshot
Improving Modular Inversion in RNS Using the Plus-Minus Method
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/s00034-016-0336-1openalex-snapshot
Highly Parallel Modular Multiplier for Elliptic Curve Cryptography in Residue Number System
inferred← citeshttps://doi.org/10.1007/s13389-018-0195-8openalex-snapshot
RNS Montgomery reduction algorithms using quadratic residuosity
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.1007/s13389-021-00260-zopenalex-snapshot
Montgomery-friendly primes and applications to cryptography
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.06.005openalex-snapshot
New distributed algorithms for fast sign detection in residue number systems (RNS)
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/access.2016.2599269openalex-snapshot
New Residue Arithmetic Based Barrett Algorithms: Modular Integer Computations
inferred← citeshttps://doi.org/10.1109/apsipa.2016.7820790openalex-snapshot
Algorithms for comparison in residue number systems
inferred← citeshttps://doi.org/10.1109/arith.2013.31openalex-snapshot
Fault Detection in RNS Montgomery Modular Multiplication
inferred← citeshttps://doi.org/10.1109/arith.2016.15openalex-snapshot
Hybrid Position-Residues Number System
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/arith51176.2021.00027openalex-snapshot
Generating Residue Number System Bases
inferred← citeshttps://doi.org/10.1109/arith61463.2024.00013openalex-snapshot
Montgomery Modular Multiplication via Single-Base Residue Number Systems
inferred← citeshttps://doi.org/10.1109/asap.2014.6868631openalex-snapshot
RNS modular multiplication through reduced base extensions
inferred← citeshttps://doi.org/10.1109/icassp.2017.7952342openalex-snapshot
New residue arithmetic based Barrett algorithms: Modular polynomial computations
inferred← citeshttps://doi.org/10.1109/icecs.2013.6815571openalex-snapshot
An RNS modular multiplication algorithm
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/icsict.2014.7021573openalex-snapshot
Parallelism exploitation of montgomery multiplication in RNS on NoC-based platform
inferred← citeshttps://doi.org/10.1109/iscas.2014.6865613openalex-snapshot
An RNS barrett modular multiplication architecture
inferred← citeshttps://doi.org/10.1109/jiot.2018.2881425openalex-snapshot
Signature Gateway: Offloading Signature Generation to IoT Gateway Accelerated by GPU
inferred← citeshttps://doi.org/10.1109/norchip.2017.8124953openalex-snapshot
An RNS based modular multiplier with reduced complexity
inferred← citeshttps://doi.org/10.1109/tc.2016.2529625openalex-snapshot
Binary-Ternary Plus-Minus Modular Inversion in RNS
inferred← citeshttps://doi.org/10.1109/tc.2021.3086071openalex-snapshot
Up to 8k-bit Modular Montgomery Multiplication in Residue Number Systems with Fast 16-bit Residue Channels
inferred← citeshttps://doi.org/10.1109/tc.2025.3587619openalex-snapshot
An Efficient LUT6-Based Montgomery Modular Multiplication Using Radix-16 Booth Method
inferred← citeshttps://doi.org/10.1109/tcad.2025.3584844openalex-snapshot
Big Integer Parallel Stream Modular Multiplier With Variable Bit-Widths
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2283674openalex-snapshot
Multifunction Residue Architectures for Cryptography
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase/icess.2017.344openalex-snapshot
Base Extent Optimization for RNS Montgomery Algorithm
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2355854openalex-snapshot
High-Throughput Modular Multiplication and Exponentiation Algorithms Using Multibit-Scan–Multibit-Shift Technique
inferred← citeshttps://doi.org/10.1145/3431499openalex-snapshot
Efficient Cryptographic Hardware for Safety Message Verification in Internet of Connected Vehicles
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.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/app15105332openalex-snapshot
An Efficient Implementation of Montgomery Modular Multiplication Using a Minimally Redundant Residue Number System
inferred← citeshttps://doi.org/10.3837/tiis.2020.02.015openalex-snapshot
The Novel Efficient Dual-field FIPS Modular Multiplication
inferred← citeshttps://doi.org/10.5937/bnsr15-58114openalex-snapshot
An application of residue number system arithmetics to secure hash functions design
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.