On the public citation graph
Scalable Montgomery Modular Multiplication Architecture with Low-Latency and Low-Memory Bandwidth Requirement
0 signed · 37 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-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
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.1049/el:19991230openalex-snapshot
Montgomery exponentiation needs no final subtractions
inferredcites →https://doi.org/10.1049/ip-cdt:20040791openalex-snapshot
Modified Montgomery modular multiplication and RSA exponentiation techniques
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/82.700944openalex-snapshot
A new RSA cryptosystem hardware design based on Montgomery's algorithm
inferredcites →https://doi.org/10.1109/arith.1993.378082openalex-snapshot
High-radix modular multiplication for cryptosystems
inferredcites →https://doi.org/10.1109/arith.1995.465359openalex-snapshot
Simplifying quotient determination in high-radix modular multiplication
inferredcites →https://doi.org/10.1109/arith.2005.9openalex-snapshot
An Improved Unified Scalable Radix-2 Montgomery Multiplier
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.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/tvlsi.2008.2000524openalex-snapshot
A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem
inferredcites →https://doi.org/10.1145/1284480.1284562openalex-snapshot
Parallelized radix-4 scalable montgomery multipliers
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1511openalex-snapshot
Efficient modular exponential algorithms compatible with hardware implementation of public-key cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_10openalex-snapshot
Hardware Implementation of Bit Forwarding Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-11203-9_30openalex-snapshot
A Cross-Layer Key Establishment Scheme in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-94472-2_3openalex-snapshot
RSA Cryptosystem Based on Early Word Based Montgomery Modular Multiplication
inferred← citeshttps://doi.org/10.1007/978-981-15-0339-9_1openalex-snapshot
Design of Low Power Montgomery Multiplier Using Clock Technique
inferred← citeshttps://doi.org/10.1007/978-981-33-6378-6_24openalex-snapshot
Design and Implementation of High Performance Elliptic Curve Coprocessor Based on Dual Finite Field
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.11.007openalex-snapshot
Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques
inferred← citeshttps://doi.org/10.1049/iet-ifs.2015.0336openalex-snapshot
Low‐latency digit‐serial dual basis multiplier for lightweight cryptosystems
inferred← citeshttps://doi.org/10.1109/iccad.2017.8203789openalex-snapshot
A novel two-stage modular multiplier based on racetrack memory for asymmetric cryptography
inferred← citeshttps://doi.org/10.1109/iccsnt.2013.6967184openalex-snapshot
Improving radix-4 feedforward scalable montgomery modular multiplier by precomputation and double booth-encodings
inferred← citeshttps://doi.org/10.1109/icsict.2014.7021339openalex-snapshot
Reducing memory requirements in CSA-based scalable Montgomery modular multipliers
inferred← citeshttps://doi.org/10.1109/tc.2015.2417553openalex-snapshot
Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication
inferred← citeshttps://doi.org/10.1109/tc.2022.3198628openalex-snapshot
A Resource Efficient Software-Hardware Co-Design of Lattice-Based Homomorphic Encryption Scheme on the FPGA
inferred← citeshttps://doi.org/10.1145/3675018.3675776openalex-snapshot
Optimized Implementation of SM2 Algorithm Based on Mobile Platforms
inferred← citeshttps://doi.org/10.32657/10356/73359openalex-snapshot
Racetrack memory based logic design for in-memory computing
inferred← citeshttps://doi.org/10.3390/electronics11223712openalex-snapshot
A Scalable Montgomery Modular Multiplication Architecture with Low Area-Time Product Based on Redundant Binary Representation
inferred← citeshttps://doi.org/10.3837/tiis.2020.02.015openalex-snapshot
The Novel Efficient Dual-field FIPS Modular Multiplication
inferred← citeshttps://doi.org/10.4018/ijisp.2017040102openalex-snapshot
Bit Forwarding 3-Bits Technique for Efficient Modular Exponentiation
inferred← citeshttps://doi.org/10.5555/3199700.3199737openalex-snapshot
A novel two-stage modular multiplier based on racetrack memory for 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.