Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (Q1124585): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56453869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Architectures for exponentiation in GF(2n) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal normal bases in \(GF(p^ n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 10:25, 20 June 2024

scientific article
Language Label Description Also known as
English
Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
scientific article

    Statements

    Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel multipliers
    0 references
    canonical bases
    0 references
    AND-gates
    0 references
    EOR-gates
    0 references
    structural modularity
    0 references
    all one polynomial
    0 references
    equally spaced polynomial
    0 references
    0 references