On the public citation graph

Efficient and optimal exponentiation in finite fields

0 signed · 44 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-45961-8_22openalex-snapshot
Fast Exponentiation in GF(2n)
inferredcites →https://doi.org/10.1007/3-540-47721-7_23openalex-snapshot
Architectures for exponentiation in GF(2n)
inferredcites →https://doi.org/10.1007/bf01137457openalex-snapshot
Rapid parallel calculation of degrees in a quotient ring of polynomials over a finite field
inferredcites →https://doi.org/10.1016/0020-0190(87)90031-7openalex-snapshot
On the length of word chains
inferredcites →https://doi.org/10.1016/0020-0190(92)90259-xopenalex-snapshot
Processor-efficient exponentiation in finite fields
inferredcites →https://doi.org/10.1016/0890-5401(91)90078-gopenalex-snapshot
Boolean circuits versus arithmetic circuits
inferredcites →https://doi.org/10.1016/s0065-2458(08)60610-5openalex-snapshot
Binary Arithmetic
inferredcites →https://doi.org/10.1016/s0747-7171(08)80028-4openalex-snapshot
Inversion in finite fields using logarithmic depth
inferredcites →https://doi.org/10.1016/s0747-7171(08)80158-7openalex-snapshot
Constructing normal bases in finite fields
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/49.1927openalex-snapshot
Architectures for exponentiation in GF(2/sup m/)
inferredcites →https://doi.org/10.1109/tc.1985.1676616openalex-snapshot
VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
inferredcites →https://doi.org/10.1137/0216060openalex-snapshot
Computing Powers in Parallel
inferredcites →https://doi.org/10.1137/0219049openalex-snapshot
Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
inferredcites →https://doi.org/10.1145/44483.44496openalex-snapshot
The parallel complexity of exponentiating polynomials over finite fields
inferredcites →https://doi.org/10.22028/d291-26104openalex-snapshot
VLSI complexity, efficient VLSI algorithms and the HILL design system

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1997.0913openalex-snapshot
A Survey of Fast Exponentiation Methods
inferred← citeshttps://doi.org/10.1006/jsco.1999.0309openalex-snapshot
Algorithms for Exponentiation in Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_13openalex-snapshot
Efficient Finite Field Basis Conversion Involving dual bases
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_98openalex-snapshot
Gauss periods and fast exponentiation in finite fields
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_8openalex-snapshot
Exponentiation in finite fields: Theory and practice
inferred← citeshttps://doi.org/10.1007/978-3-642-02181-7_13openalex-snapshot
A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-25516-8_17openalex-snapshot
Parallelizing the Weil and Tate Pairings
inferred← citeshttps://doi.org/10.1007/978-3-642-34047-5_21openalex-snapshot
Higher-Order Masking Schemes for S-Boxes
inferred← citeshttps://doi.org/10.1007/978-3-642-40349-1_24openalex-snapshot
Analysis and Improvement of the Generic Higher-Order Masking Scheme of FSE 2012
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_14openalex-snapshot
Gauß Periods in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-662-49301-4_20openalex-snapshot
Polynomial Evaluation and Side Channel Analysis
inferred← citeshttps://doi.org/10.1007/bfb0054331openalex-snapshot
The CREW PRAM complexity of modular inversion
inferred← citeshttps://doi.org/10.1007/s00145-004-0221-0openalex-snapshot
Polynomial and Normal Bases for Finite Fields
inferred← citeshttps://doi.org/10.1007/s001450010002openalex-snapshot
On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping
inferred← citeshttps://doi.org/10.1007/s10623-017-0377-xopenalex-snapshot
Message encoding and retrieval for spread and cyclic orbit codes
inferred← citeshttps://doi.org/10.1016/j.amc.2006.05.078openalex-snapshot
Applying quick exponentiation for block upper triangular matrices
inferred← citeshttps://doi.org/10.1016/j.amc.2012.08.042openalex-snapshot
A quick exponentiation algorithm for 3 × 3 block upper triangular matrices
inferred← citeshttps://doi.org/10.1016/j.crma.2015.12.001openalex-snapshot
Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.06.005openalex-snapshot
Efficient parallel exponentiation in using normal basis representations
inferred← citeshttps://doi.org/10.1090/mcom/3230openalex-snapshot
Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
inferred← citeshttps://doi.org/10.1090/s0025-5718-03-01599-0openalex-snapshot
Computing special powers in finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-1995-1297469-6openalex-snapshot
On orders of optimal normal basis generators
inferred← citeshttps://doi.org/10.1137/s0097539797328070openalex-snapshot
The CREW PRAM Complexity of Modular Inversion
inferred← citeshttps://doi.org/10.1145/309831.309869openalex-snapshot
Computing special powers in finite fields
inferred← citeshttps://doi.org/10.1145/345542.345645openalex-snapshot
Some remarks on parallel exponentiation (extended abstract)
inferred← citeshttps://doi.org/10.1145/378580.378632openalex-snapshot
Efficient parallel exponentiation in GF(2 n ) using normal basis representations
inferred← citeshttps://doi.org/10.2307/2153492openalex-snapshot
On Orders of Optimal Normal Basis Generators
inferred← citeshttps://doi.org/10.6100/ir564670openalex-snapshot
Speeding up subgroup cryptosystems
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.