Arithmetic operations in \(GF(2^ m)\)

DOI10.1007/BF02620228zbMath0793.11032OpenAlexW2008443281MaRDI QIDQ1207693

G. B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone

Publication date: 16 May 1993

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02620228

zbMATH Keywords

parallel computationexponentiationsnormal basisefficient computation of multiplicative inverses

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (6)

Complexity of computation in finite fields ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ On primitive and free roots in a finite field ⋮ Primitive Normal Polynomials Over Finite Fields ⋮ An implementation for a fast public-key cryptosystem ⋮ Elliptic curve cryptosystems and their implementation

Cites Work

• An implementation for a fast public-key cryptosystem
• New directions in cryptography
• Primitive Normal Bases for Finite Fields
• On a Special Class of Polynomials

This page was built for publication: Arithmetic operations in \(GF(2^ m)\)