On the public citation graph

The implementation of elliptic curve cryptosystems

https://doi.org/10.1007/bfb0030345
0 signed · 45 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_29openalex-snapshot
N Using RSA with Low Exponent in a Public Key Network
inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/978-1-4615-3198-2_3openalex-snapshot
Isomorphism Classes of Elliptic Curves Over Finite Fields
inferredcites →https://doi.org/10.1007/978-1-4684-0310-7openalex-snapshot
A Course in Number Theory and Cryptography
inferredcites →https://doi.org/10.1007/978-1-4757-1920-8openalex-snapshot
The Arithmetic of Elliptic Curves
inferredcites →https://doi.org/10.1007/bf00196789openalex-snapshot
An implementation for a fast public-key cryptosystem
inferredcites →https://doi.org/10.1016/0166-218x(88)90090-xopenalex-snapshot
Optimal normal bases in GF(pn)
inferredcites →https://doi.org/10.1016/0166-218x(89)90001-2openalex-snapshot
Low complexity normal bases
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866113-7openalex-snapshot
Speeding the Pollard and Elliptic Curve Methods of Factorization
inferredcites →https://doi.org/10.1109/cicc.1989.56740openalex-snapshot
A high speed data encryption processor for public key cryptography
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11745853_13openalex-snapshot
Efficient Scalar Multiplication by Isogeny Decompositions
inferred← citeshttps://doi.org/10.1007/11792086_35openalex-snapshot
Efficiently Computable Endomorphisms for Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_11openalex-snapshot
Constructing Elliptic Curve Cryptosystems in Characteristic 2
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_40openalex-snapshot
A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_23openalex-snapshot
Efficient Algorithms for Pairing-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_27openalex-snapshot
Non Supersingular Elliptic Curves for Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_28openalex-snapshot
Building Cyclic Elliptic Curves Modulo Large Primes
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_7openalex-snapshot
Counting the number of points on elliptic curves over finite fields: strategies and performances
inferred← citeshttps://doi.org/10.1007/3-540-54522-0_97openalex-snapshot
Arithmetic on non supersingular elliptic curves
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_38openalex-snapshot
Fixed-parameter complexity and cryptography
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_39openalex-snapshot
On ordinary elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_26openalex-snapshot
Finding Good Random Elliptic Curves for Cryptosystems Defined over $$ \mathbb{F}_{{\text{2}}^n } $$
inferred← citeshttps://doi.org/10.1007/978-1-4615-3198-2_7openalex-snapshot
Counting Points on Elliptic Curves Over F2m
inferred← citeshttps://doi.org/10.1007/978-3-319-31515-7_4openalex-snapshot
Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-319-72565-9_6openalex-snapshot
Computing Low-Weight Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-642-78502-3_27openalex-snapshot
Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/bf03158670openalex-snapshot
Von der empirischen zur abstrakten Kryptographie
inferred← citeshttps://doi.org/10.1007/bfb0052247openalex-snapshot
Efficient algorithms for elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1007/bfb0054012openalex-snapshot
Overview of elliptic curve cryptography
inferred← citeshttps://doi.org/10.1007/s00145-018-9294-zopenalex-snapshot
Koblitz Curves over Quadratic Fields
inferred← citeshttps://doi.org/10.1007/s001459900021openalex-snapshot
Batch RSA
inferred← citeshttps://doi.org/10.1007/s10623-015-0106-2openalex-snapshot
Guest Editorial: Special Issue in Honor of Scott A. Vanstone
inferred← citeshttps://doi.org/10.1016/j.ffa.2004.07.001openalex-snapshot
Koblitz curve cryptosystems
inferred← citeshttps://doi.org/10.1017/s0004972700040521openalex-snapshot
Explicit endomorphisms and Correspondences
inferred← citeshttps://doi.org/10.1109/18.259647openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferred← citeshttps://doi.org/10.1109/isce.1997.658414openalex-snapshot
About a method for distribution keys of a computer network using elliptic curves
inferred← citeshttps://doi.org/10.1109/kes.1998.725865openalex-snapshot
Investigation of the efficiency of the elliptic curve cryptosystem for multi-applications smart card
inferred← citeshttps://doi.org/10.1145/103418.103434openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferred← citeshttps://doi.org/10.1504/ijact.2012.045590openalex-snapshot
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
inferred← citeshttps://doi.org/10.24275/uami.0k225b156openalex-snapshot
Criptografía y curvas elípticas
inferred← citeshttps://doi.org/10.24996/ijs.2024.65.1.31openalex-snapshot
ECC Based Encryption for the Secured Proactive Network Forensic Framework
inferred← citeshttps://doi.org/10.3929/ethz-a-004704198openalex-snapshot
Application exploration regarding a DPC like architecture
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.