On the public citation graph
Secure hyperelliptic cryptosystems and their performance
0 signed · 50 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/0-387-34799-2_8openalex-snapshot
A Family of Jacobians Suitable for Discrete Log Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
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-46416-6_27openalex-snapshot
Non Supersingular Elliptic Curves for Public Key Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-48405-1openalex-snapshot
Advances in Cryptology — CRYPTO’ 99
inferredcites →https://doi.org/10.1007/3-540-48658-5_6openalex-snapshot
Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks
inferredcites →https://doi.org/10.1007/3-540-57220-1_86openalex-snapshot
Elliptic curves over F p suitable for cryptosystems
inferredcites →https://doi.org/10.1007/3-540-58691-1_39openalex-snapshot
A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields
inferredcites →https://doi.org/10.1007/s001459900052openalex-snapshot
The Discrete Logarithm Problem on Elliptic Curves of Trace One
inferredcites →https://doi.org/10.1016/0166-218x(88)90090-xopenalex-snapshot
Optimal normal bases in GF(pn)
inferredcites →https://doi.org/10.1016/0890-5401(88)90024-7openalex-snapshot
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
inferredcites →https://doi.org/10.1016/s0898-1221(97)84597-xopenalex-snapshot
Finite fields: Encyclopedia of mathematics and its applications
inferredcites →https://doi.org/10.1017/cbo9781107360211openalex-snapshot
Elliptic Curves in Cryptography
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-0866101-0openalex-snapshot
Computing in the Jacobian of a Hyperelliptic Curve
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1035941-xopenalex-snapshot
Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
inferredcites →https://doi.org/10.1090/s0025-5718-98-00887-4openalex-snapshot
Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
inferredcites →https://doi.org/10.1109/18.259647openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferredcites →https://doi.org/10.1109/49.223883openalex-snapshot
An implementation of elliptic curve cryptosystems over F/sub 2/155
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
inferredcites →https://doi.org/10.2307/2007968openalex-snapshot
Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
inferredcites →https://doi.org/10.2307/2153546openalex-snapshot
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10719994_18openalex-snapshot
A Hardware-Oriented Algorithm for Computing in Jacobians and Its Implementation for Hyperelliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/10719994_8openalex-snapshot
Over F p vs. over F $_{2^{n}}$ and on Pentium vs. on Alpha in Software Implementation of Hyperelliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/10722028_28openalex-snapshot
Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-45600-7_9openalex-snapshot
Fast Scalar Multiplication on the Jacobian of a Family of Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_29openalex-snapshot
Supersingular Curves in Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_12openalex-snapshot
On the Performance of Hyperelliptic Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_8openalex-snapshot
Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2 n
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_11openalex-snapshot
Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations
inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_28openalex-snapshot
Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
inferred← citeshttps://doi.org/10.1007/bf02960774openalex-snapshot
Selection of secure hyperelliptic curves ofg=2 based on a subfield
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2007.05.006openalex-snapshot
On efficient implementation of FPGA-based hyperelliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00167-7openalex-snapshot
How to construct efficient signcryption schemes on elliptic curves
inferred← citeshttps://doi.org/10.1109/acssc.2004.1399187openalex-snapshot
Optimal tower fields for hyperelliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/fpt.2004.1393295openalex-snapshot
FPGA design of HECC coprocessors
inferred← citeshttps://doi.org/10.1109/itcc.2004.1286706openalex-snapshot
High performance arithmetic for special hyperelliptic curve cryptosystems of genus two
inferred← citeshttps://doi.org/10.1109/itcc.2004.1286710openalex-snapshot
Finding optimum parallel coprocessor design for genus 2 hyperelliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/tc.2005.109openalex-snapshot
Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1145/1015047.1015051openalex-snapshot
Elliptic and hyperelliptic curves on embedded μP
inferred← citeshttps://doi.org/10.11591/ijece.v1i2.86openalex-snapshot
A Survey Report On Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.3934/amc.2010.4.115openalex-snapshot
Optimization of the arithmetic of the ideal class group for genus 4 hyperelliptic curves over projective coordinates
inferred← citeshttps://doi.org/10.48550/arxiv.math/0305284openalex-snapshot
Computing the Automorphism Groups of Hyperelliptic Function Fields
inferred← citeshttps://doi.org/10.5120/10112-4777openalex-snapshot
Signcryption Scheme that Utilizes Elliptic Curve for both Encryption and Signature Generation
inferred← citeshttps://doi.org/10.70675/213abca0ze883z48f6z97a2z0e84d266952copenalex-snapshot
Unités arithmétiques et cryptoprocesseurs matériels pour la cryptographie sur courbe hyperelliptique
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.