On the public citation graph

Using an RSA Accelerator for Modular Inversion

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.
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.1006/jagm.1994.1006openalex-snapshot
Two Fast GCD Algorithms
inferredcites →https://doi.org/10.1007/10931455_18openalex-snapshot
Faster Double-Size Modular Multiplication from Euclidean Multipliers
inferredcites →https://doi.org/10.1007/3-540-36400-5_6openalex-snapshot
New Algorithm for Classical Modular Inverse
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-39118-5_10openalex-snapshot
The RSA Cryptography 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.1007/3-540-49649-1_6openalex-snapshot
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
inferredcites →https://doi.org/10.1007/978-3-540-45238-6_20openalex-snapshot
GCD-Free Algorithms for Computing Modular Inverses
inferredcites →https://doi.org/10.1007/b97644openalex-snapshot
Guide to Elliptic Curve Cryptography
inferredcites →https://doi.org/10.1007/s00145-001-0009-4openalex-snapshot
Selecting Cryptographic Key Sizes
inferredcites →https://doi.org/10.1016/0021-9991(67)90047-2openalex-snapshot
Computational problems associated with Racah algebra
inferredcites →https://doi.org/10.1017/cbo9781107360211openalex-snapshot
Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1080/00029890.1938.11990797openalex-snapshot
Euclid's Algorithm for Large Numbers
inferredcites →https://doi.org/10.1145/164081.164102openalex-snapshot
A generalization of the binary GCD 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/978-3-030-70416-2_15openalex-snapshot
Towards a Symmetric Crypto Algorithm: The HAJ
inferred← citeshttps://doi.org/10.1007/978-3-540-73458-1_19openalex-snapshot
Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-25516-8_20openalex-snapshot
Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves
inferred← citeshttps://doi.org/10.1007/s10207-015-0308-7openalex-snapshot
Efficient and verifiable algorithms for secure outsourcing of cryptographic computations
inferred← citeshttps://doi.org/10.1109/coconet.2015.7411236openalex-snapshot
Hardware design for multiplicative modular inverse based on table look up technique
inferred← citeshttps://doi.org/10.1109/edst.2007.4289808openalex-snapshot
A cost-Efficient Implementation of Public-key Cryptography on Embedded Systems
inferred← citeshttps://doi.org/10.1109/iccicct.2014.6992961openalex-snapshot
An efficient scalar multiplication algorithm for ECC in WSNs
inferred← citeshttps://doi.org/10.1109/tenconspring.2013.6584439openalex-snapshot
Fast elliptic curve point multiplication for WSNs
inferred← citeshttps://doi.org/10.1145/2350716.2350750openalex-snapshot
Fast point quadrupling on elliptic curves
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1140openalex-snapshot
Sole Inversion Precomputation for Elliptic Curve Scalar Multiplications
inferred← citeshttps://doi.org/10.2140/involve.2017.10.541openalex-snapshot
New algorithms for modular inversion and representation by the form x2+ 3xy + y2
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.