On the public citation graph

Optimal normal bases

0 signed · 87 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.1016/0166-218x(88)90090-xopenalex-snapshot

Optimal normal bases in GF(pn)

What points at this work

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

inferred← citeshttps://doi.org/10.1006/ffta.1999.0270openalex-snapshot

Rings of Low Multiplicative Complexity

inferred← citeshttps://doi.org/10.1006/ffta.2000.0304openalex-snapshot

Abelian Groups, Gauss Periods, and Normal Bases

inferred← citeshttps://doi.org/10.1006/jsco.1999.0309openalex-snapshot

Algorithms for Exponentiation in Finite Fields

inferred← citeshttps://doi.org/10.1007/11596219_30openalex-snapshot

Modified Serial Multipliers for Type-IV Gaussian Normal Bases

inferred← citeshttps://doi.org/10.1007/3-540-45311-3_11openalex-snapshot

A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

inferred← citeshttps://doi.org/10.1007/3-540-45537-x_18openalex-snapshot

Fast Normal Basis Multiplication Using General Purpose Processors

inferred← citeshttps://doi.org/10.1007/3-540-46796-3_38openalex-snapshot

Constructing Elements of Large Order in Finite Fields

inferred← citeshttps://doi.org/10.1007/3-540-48059-5_12openalex-snapshot

Fast Multiplication in Finite Fields GF(2n)

inferred← citeshttps://doi.org/10.1007/3-540-58691-1_59openalex-snapshot

On orders of optimal normal basis generators

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-030-05153-2_10openalex-snapshot

Normal Basis Exhaustive Search: 10 Years Later

inferred← citeshttps://doi.org/10.1007/978-3-032-02717-7_24openalex-snapshot

On Acceleration of Logarithms Computing in the Chor-Rivest Cryptosystem

inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_5openalex-snapshot

Density Estimates Related to Gauß Periods

inferred← citeshttps://doi.org/10.1007/978-3-319-16277-5_4openalex-snapshot

Reducing the Complexity of Normal Basis Multiplication

inferred← citeshttps://doi.org/10.1007/978-3-540-39927-8_32openalex-snapshot

(Virtually) Free Randomization Techniques for Elliptic Curve Cryptography

inferred← citeshttps://doi.org/10.1007/978-3-540-73074-3_6openalex-snapshot

Efficient Multiplication Using Type 2 Optimal Normal Bases

inferred← citeshttps://doi.org/10.1007/978-3-540-74377-4_49openalex-snapshot

A New Parallel Multiplier for Type II Optimal Normal Basis

inferred← citeshttps://doi.org/10.1007/978-3-642-13797-6_3openalex-snapshot

A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier

inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_14openalex-snapshot

Gauß Periods in Finite Fields

inferred← citeshttps://doi.org/10.1007/bf01418530openalex-snapshot

Self-dual bases in $$\mathbb{F}_{q^n } $$

inferred← citeshttps://doi.org/10.1007/bfb0027920openalex-snapshot

Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields

inferred← citeshttps://doi.org/10.1007/bfb0055739openalex-snapshot

An elliptic curve implementation of the finite field digital signature algorithm

inferred← citeshttps://doi.org/10.1007/s00145-004-0221-0openalex-snapshot

Polynomial and Normal Bases for Finite Fields

inferred← citeshttps://doi.org/10.1007/s002000050049openalex-snapshot

Almost weakly self-dual bases for finite fields

inferred← citeshttps://doi.org/10.1007/s002000050093openalex-snapshot

Orders of Gauss Periods in Finite Fields

inferred← citeshttps://doi.org/10.1007/s10114-005-0613-6openalex-snapshot

Normal Bases and Their Dual–Bases over Finite Fields

inferred← citeshttps://doi.org/10.1007/s10623-008-9195-5openalex-snapshot

The trace of an optimal normal element and low complexity normal bases

inferred← citeshttps://doi.org/10.1007/s10623-011-9490-4openalex-snapshot

Gauss periods as constructions of low complexity normal bases

inferred← citeshttps://doi.org/10.1007/s11128-022-03474-0openalex-snapshot

A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dynamical system

inferred← citeshttps://doi.org/10.1007/s11424-009-9172-8openalex-snapshot

On the complexity of the normal bases via prime Gauss period over finite fields

inferred← citeshttps://doi.org/10.1016/0024-3795(95)00744-xopenalex-snapshot

Specific irreducible polynomials with linearly independent roots over finite fields

inferred← citeshttps://doi.org/10.1016/0024-3795(95)90163-9openalex-snapshot

The combinatorial power of the companion matrix

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/j.ffa.2006.09.008openalex-snapshot

Finite field arithmetic using quasi-normal bases

inferred← citeshttps://doi.org/10.1016/j.ffa.2008.07.004openalex-snapshot

Elliptic periods for finite fields

inferred← citeshttps://doi.org/10.1016/j.ffa.2010.09.005openalex-snapshot

Low complexity of a class of normal bases over finite fields

inferred← citeshttps://doi.org/10.1016/j.ffa.2011.10.002openalex-snapshot

Construction of self-dual normal bases and their complexity

inferred← citeshttps://doi.org/10.1016/j.ffa.2014.09.004openalex-snapshot

A new criterion on normal bases of finite field extensions

inferred← citeshttps://doi.org/10.1016/j.ffa.2018.06.010openalex-snapshot

Artin–Schreier extensions of normal bases

inferred← citeshttps://doi.org/10.1016/j.jnt.2012.01.013openalex-snapshot

The Gaussian normal basis and its trace basis over finite fields

inferred← citeshttps://doi.org/10.1016/j.jnt.2012.07.007openalex-snapshot

Elliptic periods and primality proving

inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.002openalex-snapshot

Normal bases from 1-dimensional algebraic groups

inferred← citeshttps://doi.org/10.1016/s1071-5797(03)00040-6openalex-snapshot

Low complexity normal bases in F2n

inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80013-1openalex-snapshot

Finite Fields and Their Applications

inferred← citeshttps://doi.org/10.1017/cbo9781139013673openalex-snapshot

Cryptography and Secure Communication

inferred← citeshttps://doi.org/10.1049/iet-cds.2014.0276openalex-snapshot

Subquadratic space complexity Gaussian normal basis multipliers over GF (2 m ) based on Dickson–Karatsuba decomposition

inferred← citeshttps://doi.org/10.1090/s0002-9939-99-04795-4openalex-snapshot

Elements of provable high orders in finite fields

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-1994-1257578-3openalex-snapshot

Primitive Normal Polynomials Over 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.1090/s0025-5718-99-00988-6openalex-snapshot

Normal bases via general Gauss periods

inferred← citeshttps://doi.org/10.1090/s0273-0979-1994-00466-5openalex-snapshot

Book Review: Computational and algorithmic problems in finite fields

inferred← citeshttps://doi.org/10.1109/12.485570openalex-snapshot

GF(2/sup m/) multiplication and division over the dual basis

inferred← citeshttps://doi.org/10.1109/12.707588openalex-snapshot

Low complexity bit-parallel multipliers for a class of finite fields

inferred← citeshttps://doi.org/10.1109/iccias.2006.295271openalex-snapshot

A New Parallel Multiplier for Type II Optimal Normal Basis

inferred← citeshttps://doi.org/10.1109/icrccs.2009.47openalex-snapshot

On the Field Multiplication Algorithms over Binary Extension Field Using Normal Basis

inferred← citeshttps://doi.org/10.1109/itcc.2005.236openalex-snapshot

Quadrinomial modular arithmetic using modified polynomial basis

inferred← citeshttps://doi.org/10.1109/lascas.2013.6519014openalex-snapshot

Design of an elliptic curve cryptoprocessor using optimal normal basis over GF(2 233 )

inferred← citeshttps://doi.org/10.1109/mue.2011.47openalex-snapshot

Modified Sequential Multipliers for Type-k Gaussian Normal Bases

inferred← citeshttps://doi.org/10.1109/tc.2002.1004590openalex-snapshot

A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/tc.2002.1047755openalex-snapshot

Finite field multiplier using redundant representation

inferred← citeshttps://doi.org/10.1109/tc.2003.1190584openalex-snapshot

Efficient multiplication beyond optimal normal bases

inferred← citeshttps://doi.org/10.1109/tc.2003.1244936openalex-snapshot

Fast normal basis multiplication using general purpose processors

inferred← citeshttps://doi.org/10.1109/tc.2007.1076openalex-snapshot

Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases

inferred← citeshttps://doi.org/10.1109/tc.2007.70845openalex-snapshot

Low Complexity Normal Elements over Finite Fields of Characteristic Two

inferred← citeshttps://doi.org/10.1109/tc.2011.198openalex-snapshot

Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases

inferred← citeshttps://doi.org/10.1109/tc.2016.2543228openalex-snapshot

A Matrix Decomposition Method for Optimal Normal Basis Multiplication

inferred← citeshttps://doi.org/10.1109/tcsi.2013.2283674openalex-snapshot

Multifunction Residue Architectures for Cryptography

inferred← citeshttps://doi.org/10.1109/tvlsi.2013.2280092openalex-snapshot

New Implementations of the WG Stream Cipher

inferred← citeshttps://doi.org/10.1109/tvt.2010.2095432openalex-snapshot

$\hbox{EP}^{2}\hbox{DF}$: An Efficient Privacy-Preserving Data-Forwarding Scheme for Service-Oriented Vehicular Ad Hoc Networks

inferred← citeshttps://doi.org/10.1109/wispnet.2017.8300158openalex-snapshot

Hardware implementation and performance comparison of normal basis multiplication methods over GF (2m)

inferred← citeshttps://doi.org/10.1137/s0895480192237361openalex-snapshot

Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$

inferred← citeshttps://doi.org/10.1145/120694.120717openalex-snapshot

Finding (good) normal bases in finite fields

inferred← citeshttps://doi.org/10.1145/2517300.2517305openalex-snapshot

Efficient hardware implementation of the stream cipher WG-16 with composite field arithmetic

inferred← citeshttps://doi.org/10.1145/309831.309869openalex-snapshot

Computing special powers in finite fields

inferred← citeshttps://doi.org/10.11845/sxjz.20130501openalex-snapshot

A Survey on Normal Bases Over Finite Fields

inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot

Cryptography

inferred← citeshttps://doi.org/10.13067/jkiecs.2013.8.8.1207openalex-snapshot

Fast Sequential Optimal Normal Bases Multipliers over Finite Fields

inferred← citeshttps://doi.org/10.13067/jkiecs.2014.9.4.409openalex-snapshot

A Low Complexity Bit-Parallel Multiplier over Finite Fields with ONBs

inferred← citeshttps://doi.org/10.1515/dma.2001.11.4.327openalex-snapshot

On a quick multiplication in normal bases of finite fields

inferred← citeshttps://doi.org/10.2307/2153492openalex-snapshot

On Orders of Optimal Normal Basis Generators

inferred← citeshttps://doi.org/10.3390/sym10120702openalex-snapshot

Normal Bases on Galois Ring Extensions

inferred← citeshttps://doi.org/10.4213/dm294openalex-snapshot

О быстром умножении в нормальных базисах конечных полей

inferred← citeshttps://doi.org/10.5120/11702-7276openalex-snapshot

Design and Implementation of Secure Stream Cipher based on Elliptic Curves on Time Shared Basis

inferred← citeshttps://doi.org/10.5831/hmj.2007.29.3.415openalex-snapshot

EFFICIENT PARALLEL GAUSSIAN NORMAL BASES MULTIPLIERS OVER FINITE FIELDS

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.