On the public citation graph
Self-dual bases in $$\mathbb{F}_{q^n } $$
0 signed · 27 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-51083-4_62openalex-snapshot
Symmetry and duality in normal basis multiplication
inferredcites →https://doi.org/10.1016/0166-218x(88)90090-xopenalex-snapshot
Optimal normal bases in GF(pn)
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1109/12.2212openalex-snapshot
A comparison of VLSI architecture of finite field multipliers using dual, normal, or standard bases
inferredcites →https://doi.org/10.1109/12.35840openalex-snapshot
An algorithm to design finite field multipliers using a self-dual normal basis
inferredcites →https://doi.org/10.1109/18.45274openalex-snapshot
Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields
inferredcites →https://doi.org/10.1109/49.17708openalex-snapshot
Algorithm engineering for public key algorithms
inferredcites →https://doi.org/10.1109/tit.1982.1056591openalex-snapshot
Bit-serial Reed - Solomon encoders
inferredcites →https://doi.org/10.1137/0209059openalex-snapshot
Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
inferredcites →https://doi.org/10.1137/0403012openalex-snapshot
Bit Serial Multiplication in Finite Fields
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-60693-9_27openalex-snapshot
A note on the hash function of Tillich and Zémor
inferred← citeshttps://doi.org/10.1007/3-540-60865-6_42openalex-snapshot
A note on the hash function of Tillich and zémor
inferred← citeshttps://doi.org/10.1007/s002000050049openalex-snapshot
Almost weakly self-dual bases for finite fields
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.031openalex-snapshot
A new characterization of dual bases in finite fields and its applications
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80013-1openalex-snapshot
Finite Fields and Their Applications
inferred← citeshttps://doi.org/10.1109/12.736433openalex-snapshot
New low-complexity bit-parallel finite field multipliers using weakly dual bases
inferred← citeshttps://doi.org/10.1109/92.974900openalex-snapshot
Efficient exponentiation using weakly dual basis
inferred← citeshttps://doi.org/10.1109/ecctd.2009.5274961openalex-snapshot
High speed VLSI implementation of a finite field multiplier using redundant representation
inferred← citeshttps://doi.org/10.1109/tc.2004.52openalex-snapshot
A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2003005openalex-snapshot
A High-Speed Word Level Finite Field Multiplier in ${\BBF}_{2^m}$ Using Redundant Representation
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.