On the public citation graph

A Scalable Montgomery Modular Multiplication Architecture with Low Area-Time Product Based on Redundant Binary Representation

https://doi.org/10.3390/electronics11223712
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.
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/978-981-13-1328-8_56openalex-snapshot
Area-Efficient Design of Modular Exponentiation Using Montgomery Multiplier for RSA Cryptosystem
inferredcites →https://doi.org/10.1049/cje.2017.11.013openalex-snapshot
A High‐Performance RSA Coprocessor Based on Half‐Carry‐Save and Dual‐Core MAC Architecture
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.1109/edssc.2017.8126455openalex-snapshot
Design of an 8192-bit RNS montgomery multiplier
inferredcites →https://doi.org/10.1109/et2ecn.2014.7044987openalex-snapshot
Fast modular multiplication using parallel prefix adder
inferredcites →https://doi.org/10.1109/iccic.2017.8524218openalex-snapshot
RSA Cryptosystem with Modified Montgomery Modular Multiplier
inferredcites →https://doi.org/10.1109/icm.2010.5696148openalex-snapshot
High radix implementation of Montgomery multipliers with CSA
inferredcites →https://doi.org/10.1109/icsict.2014.7021339openalex-snapshot
Reducing memory requirements in CSA-based scalable Montgomery modular multipliers
inferredcites →https://doi.org/10.1109/icspc51351.2021.9451717openalex-snapshot
A High Speed Montgomery Multiplier used in Security Applications
inferredcites →https://doi.org/10.1109/iscas.2012.6271962openalex-snapshot
Fast scalable radix-4 Montgomery modular multiplier
inferredcites →https://doi.org/10.1109/lascas.2013.6519072openalex-snapshot
8912-bit Montgomery multipliers using radix-8 booth encoding and coded-digit
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.2003.1228516openalex-snapshot
A scalable architecture for modular multiplication based on montgomery's 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.2012.218openalex-snapshot
Scalable Montgomery Modular Multiplication Architecture with Low-Latency and Low-Memory Bandwidth Requirement
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/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.2021.3053630openalex-snapshot
A High-Performance and Low-Cost Montgomery Modular Multiplication Based on Redundant Binary Representation
inferredcites →https://doi.org/10.1109/tie.2010.2080653openalex-snapshot
Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation
inferredcites →https://doi.org/10.1109/tvlsi.2010.2049037openalex-snapshot
Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers
inferredcites →https://doi.org/10.1109/tvlsi.2015.2409113openalex-snapshot
Low-Cost High-Performance VLSI Architecture for Montgomery Modular Multiplication
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

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4671147openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-031-65522-7_37openalex-snapshot
Survey on Cryptoprocessors Advances and Technological Trends
inferred← citeshttps://doi.org/10.1007/978-3-032-22372-2_16openalex-snapshot
Research and Development of an Interactive WebAR Platform for 3D Modeling and Visualization of Furniture in Real-World Environment
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.1109/tcsii.2023.3313783openalex-snapshot
Efficient Barrett Modular Multiplication Based on Toom-Cook Multiplication
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/electronics12153241openalex-snapshot
A Low-Cost High-Performance Montgomery Modular Multiplier Based on Pipeline Interleaving for IoT Devices
inferred← citeshttps://doi.org/10.3390/electronics12214480openalex-snapshot
Efficient Hardware Implementation of Elliptic-Curve Diffie–Hellman Ephemeral on Curve25519
inferred← citeshttps://doi.org/10.3390/electronics14071402openalex-snapshot
Efficient Large-Width Montgomery Modular Multiplier Design Based on Toom–Cook-5
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.