Arithmetic operations in \(GF(2^ m)\) (Q1207693): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ronald C. Mullin / rank
Normal rank
 
Property / author
 
Property / author: Scott A. Vanstone / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Gabriele Drauschke / rank
Normal rank
 
Property / author
 
Property / author: Ronald C. Mullin / rank
 
Normal rank
Property / author
 
Property / author: Scott A. Vanstone / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Gabriele Drauschke / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation for a fast public-key cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Normal Bases for Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Special Class of Polynomials / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02620228 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008443281 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:46, 30 July 2024

scientific article
Language Label Description Also known as
English
Arithmetic operations in \(GF(2^ m)\)
scientific article

    Statements

    Arithmetic operations in \(GF(2^ m)\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    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.
    0 references
    efficient computation of multiplicative inverses
    0 references
    exponentiations
    0 references
    normal basis
    0 references
    parallel computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references