On the public citation graph

Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n

https://doi.org/10.1007/bfb0054116
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.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/3-540-46766-1_20openalex-snapshot
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
inferredcites →https://doi.org/10.1007/3-540-48285-7_4openalex-snapshot
A New Elliptic Curve Based Analogue of RSA
inferredcites →https://doi.org/10.1007/978-1-4615-3198-2openalex-snapshot
Elliptic Curve Public Key Cryptosystems
inferredcites →https://doi.org/10.1007/978-1-4757-1920-8openalex-snapshot
The Arithmetic of Elliptic Curves
inferredcites →https://doi.org/10.1007/978-1-4757-4330-2openalex-snapshot
The Little Book of Big Primes
inferredcites →https://doi.org/10.1016/0890-5401(87)90030-7openalex-snapshot
Reductions among number theoretic problems
inferredcites →https://doi.org/10.1016/s0022-0000(76)80043-8openalex-snapshot
Riemann's hypothesis and tests for primality
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777280-6openalex-snapshot
Elliptic curves over finite fields and the computation of square roots mod 𝑝
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.2307/1971363openalex-snapshot
Factoring Integers with Elliptic Curves
inferredcites →https://doi.org/10.2307/2007968openalex-snapshot
Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11586821_26openalex-snapshot
Pairings on Elliptic Curves over Finite Commutative Rings
inferred← citeshttps://doi.org/10.1007/11593447_14openalex-snapshot
Spreading Alerts Quietly and the Subgroup Escape Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_11openalex-snapshot
Hard Isogeny Problems over RSA Moduli and Groups with Infeasible Inversion
inferred← citeshttps://doi.org/10.1007/978-3-319-76620-1_10openalex-snapshot
Factoring n and the Number of Points of Kummer Hypersurfaces mod n
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_11openalex-snapshot
ECC: Do We Need to Count?
inferred← citeshttps://doi.org/10.1007/bf03037307openalex-snapshot
Efficient algorithms for NMR quantum computers with small qubits
inferred← citeshttps://doi.org/10.1007/bfb0054153openalex-snapshot
Security of an identity-based cryptosystem and the related reductions
inferred← citeshttps://doi.org/10.1007/s00145-014-9181-1openalex-snapshot
Spreading Alerts Quietly and the Subgroup Escape Problem
inferred← citeshttps://doi.org/10.1007/s11139-023-00822-1openalex-snapshot
Factoring numbers with elliptic curves
inferred← citeshttps://doi.org/10.1007/s13369-021-05666-9openalex-snapshot
A Truly Dynamic Substitution Box Generator for Block Ciphers Based on Elliptic Curves Over Finite Rings
inferred← citeshttps://doi.org/10.3390/math8122126openalex-snapshot
Factorization and Malleability of RSA Moduli, and Counting Points on Elliptic Curves Modulo N
inferred← citeshttps://doi.org/10.37193/cmi.2022.01.05openalex-snapshot
Counting points on elliptic curves modulo a prime power
inferred← citeshttps://doi.org/10.48550/arxiv.1911.11004openalex-snapshot
Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N
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.