On the public citation graph
A Low-Cost High-Performance Montgomery Modular Multiplier Based on Pipeline Interleaving for IoT Devices
0 signed · 42 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_17openalex-snapshot
High-Radix Design of a Scalable Modular Multiplier
inferredcites →https://doi.org/10.1007/3-540-48059-5_10openalex-snapshot
A Scalable Architecture for Montgomery Nultiplication
inferredcites →https://doi.org/10.1016/j.bushor.2015.03.008openalex-snapshot
The Internet of Things (IoT): Applications, investments, and challenges for enterprises
inferredcites →https://doi.org/10.1016/j.comnet.2018.11.025openalex-snapshot
Current research on Internet of Things (IoT) security: A survey
inferredcites →https://doi.org/10.1016/j.compeleceng.2021.107585openalex-snapshot
Efficient implementation of Montgomery modular multiplier on FPGA
inferredcites →https://doi.org/10.1016/j.vlsi.2021.12.006openalex-snapshot
Efficient FPGA implementation of RNS Montgomery multiplication using balanced RNS bases
inferredcites →https://doi.org/10.1049/iet-cds.2017.0300openalex-snapshot
Efficient digit‐serial modular multiplication algorithm on FPGA
inferredcites →https://doi.org/10.1049/iet-cds.2018.5182openalex-snapshot
Efficient implementation of digit‐serial Montgomery modular multiplier architecture
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/access.2021.3052867openalex-snapshot
Lightweight Cryptography Algorithms for Resource-Constrained IoT Devices: A Review, Comparison and Research Opportunities
inferredcites →https://doi.org/10.1109/arith.1995.465359openalex-snapshot
Simplifying quotient determination in high-radix modular multiplication
inferredcites →https://doi.org/10.1109/edssc.2017.8126455openalex-snapshot
Design of an 8192-bit RNS montgomery multiplier
inferredcites →https://doi.org/10.1109/jiot.2021.3095077openalex-snapshot
A Survey on Federated Learning for Resource-Constrained IoT Devices
inferredcites →https://doi.org/10.1109/pacrim.2013.6625466openalex-snapshot
New and improved word-based unified and scalable architecture for radix 2 Montgomery modular multiplication algorithm
inferredcites →https://doi.org/10.1109/tc.2010.247openalex-snapshot
New Hardware Architectures for Montgomery Modular Multiplication Algorithm
inferredcites →https://doi.org/10.1109/tc.2010.72openalex-snapshot
Word-Based Montgomery Modular Multiplication Algorithm for Low-Latency Scalable Architectures
inferredcites →https://doi.org/10.1109/tc.2016.2601334openalex-snapshot
Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication
inferredcites →https://doi.org/10.1109/tc.2021.3052999openalex-snapshot
High-Radix Design of a Scalable Montgomery Modular Multiplier With Low Latency
inferredcites →https://doi.org/10.1109/tc.2022.3154164openalex-snapshot
An Iterative Montgomery Modular Multiplication Algorithm With Low Area-Time Product
inferredcites →https://doi.org/10.1109/tcsi.2021.3062871openalex-snapshot
Hardware Architecture for Supersingular Isogeny Diffie-Hellman and Key Encapsulation Using a Fast Montgomery Multiplier
inferredcites →https://doi.org/10.1109/tcsii.2018.2886962openalex-snapshot
A Division-Free Toom–Cook Multiplication-Based Montgomery Modular Multiplication
inferredcites →https://doi.org/10.1109/tcsii.2019.2932328openalex-snapshot
A Low-Latency and Low-Cost Montgomery Modular Multiplier Based on NLP Multiplication
inferredcites →https://doi.org/10.1109/tcsii.2022.3197314openalex-snapshot
Efficient High-Radix GF(p) Montgomery Modular Multiplication Via Deep Use Of Multipliers
inferredcites →https://doi.org/10.1109/tvlsi.2017.2652979openalex-snapshot
A General Digit-Serial Architecture for Montgomery Modular Multiplication
inferredcites →https://doi.org/10.1109/vdat53777.2021.9601001openalex-snapshot
Area-Time Scalable High Radix Montgomery Modular Multiplier for Large Modulus
inferredcites →https://doi.org/10.1137/s0036144503439190openalex-snapshot
A Survey of Public-Key Cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.23919/icact.2017.7890132openalex-snapshot
Managing IoT devices using blockchain platform
inferredcites →https://doi.org/10.3390/electronics11223712openalex-snapshot
A Scalable Montgomery Modular Multiplication Architecture with Low Area-Time Product Based on Redundant Binary Representation
inferredcites →https://doi.org/10.4236/jcc.2015.35021openalex-snapshot
Internet of Things (IoT): A Literature Review
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2024.109533openalex-snapshot
IoT-driven optimization of a NxN enhanced pipeline multiplier
inferred← citeshttps://doi.org/10.1016/j.procs.2026.05.185openalex-snapshot
A Systematic Review of Montgomery Multiplication Techniques for Cryptographic Hardware Acceleration
inferred← citeshttps://doi.org/10.1109/iccces62661.2026.11437340openalex-snapshot
Implementation of N x N Enhanced Multiplier Using Reversible Logic Gate
inferred← citeshttps://doi.org/10.1109/tcad.2024.3415017openalex-snapshot
Area-Efficient Barrett Modular Multiplication With Optimized Karatsuba Algorithm
inferred← citeshttps://doi.org/10.1109/tcad.2025.3590663openalex-snapshot
Exploration of Karatsuba Algorithm for Efficient Barrett Modular Multiplication
inferred← citeshttps://doi.org/10.1186/s42269-024-01285-0openalex-snapshot
FPGA design and implementation for montgomery multiplication algorithm using MATLAB HDL coder
inferred← citeshttps://doi.org/10.3390/cryptography10040049openalex-snapshot
A Brief Survey on Hardware Implementation of Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.3390/cryptography10050069openalex-snapshot
Multicore Modular Multiplication of Progressive Multiplier Reduction Algorithm
inferred← citeshttps://doi.org/10.3390/cryptography9020046openalex-snapshot
Review of Modular Multiplication Algorithms over Prime Fields for Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.3390/electronics12194110openalex-snapshot
Power/Area-Efficient ECC Processor Implementation for Resource-Constrained Devices
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.