Arithmetic operations in \(GF(2^ m)\)
type: Item
instance of: scholarly article
title: Arithmetic operations in \(GF(2^ m)\)
zbMATH Open document ID: 0793.11032
DOI: 10.1007/BF02620228
author: G. B. Agnew
author: Thomas Beth
author: Ronald C. Mullin
author: Scott A. Vanstone
published in: Journal of Cryptology
publication date: 1993-05-16T00:00:00Z
review text: The paper is concerned with the efficient computation of multiplicative inverses and of exponentiations in \(GF(2^ m)\) by exploiting a normal basis representation of the field. The method used for exponentiation is suited to parallel computation.
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 12E20
Mathematics Subject Classification ID: 11T30
zbMATH DE Number: 164962
zbMATH Keywords: efficient computation of multiplicative inverses
zbMATH Keywords: exponentiations
zbMATH Keywords: normal basis
zbMATH Keywords: parallel computation
reviewed by: Gabriele Steidl
MaRDI profile type: Publication
cites work: An implementation for a fast public-key cryptosystem
cites work: New directions in cryptography
cites work: Primitive Normal Bases for Finite Fields
cites work: On a Special Class of Polynomials
full work available at URL: https://doi.org/10.1007/bf02620228
OpenAlex ID: W2008443281
description: scientific article; zbMATH DE number 164962