On the public citation graph
Faster Double-Size Modular Multiplication from Euclidean Multipliers
0 signed · 25 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-36400-5openalex-snapshot
Cryptographic Hardware and Embedded Systems - CHES 2002
inferredcites →https://doi.org/10.1007/3-540-36400-5_7openalex-snapshot
Increasing the Bitlength of a Crypto-Coprocessor
inferredcites →https://doi.org/10.1007/3-540-46766-1openalex-snapshot
Advances in Cryptology – CRYPTO 2018
inferredcites →https://doi.org/10.1007/3-540-46766-1_26openalex-snapshot
Faster Modular Multiplication by Operand Scaling
inferredcites →https://doi.org/10.1007/3-540-47721-7openalex-snapshot
Advances in Cryptology — CRYPTO’ 86
inferredcites →https://doi.org/10.1007/3-540-47721-7_24openalex-snapshot
Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor
inferredcites →https://doi.org/10.1007/3-540-49162-7_18openalex-snapshot
Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
inferredcites →https://doi.org/10.1016/s0167-4048(99)80061-3openalex-snapshot
RNS-modulo reduction upon a restricted base value set and its applicability to RSA cryptography
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.1997.614900openalex-snapshot
An RNS Montgomery modular multiplication algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11545262_16openalex-snapshot
Fast Truncated Multiplication for Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/11545262_17openalex-snapshot
Using an RSA Accelerator for Modular Inversion
inferred← citeshttps://doi.org/10.1007/978-3-540-73458-1_18openalex-snapshot
Double-Size Bipartite Modular Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-74462-7_14openalex-snapshot
Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-85893-5_6openalex-snapshot
A Black Hen Lays White Eggs
inferred← citeshttps://doi.org/10.1007/978-3-642-00862-7_23openalex-snapshot
Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
inferred← citeshttps://doi.org/10.1007/s10207-008-0060-3openalex-snapshot
Bipartite modular multiplication with twice the bit-length of multipliers
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.203openalex-snapshot
Montgomery Multiplication with Twice the Bit-Length of Multipliers
inferred← citeshttps://doi.org/10.1109/reconfig.2009.83openalex-snapshot
Realizing Arbitrary-Precision Modular Multiplication with a Fixed-Precision Multiplier Datapath
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1851openalex-snapshot
Faster Double-Size Bipartite Multiplication out of Montgomery Multipliers
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.180openalex-snapshot
Recursive Double-Size Modular Multiplications from Euclidean and Montgomery Multipliers
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.