Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (Q2413208): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.07.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2481001706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial basis multiplication over \(\text{GF}(2^m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mastrovito multiplier for general irreducible polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of parallel multipliers for a class of fields \(GF(2^ m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel multipliers based on special irreducible pentanomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mastrovito multiplier for all trinomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-parallel finite field multiplier and squarer using polynomial basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials / rank
 
Normal rank

Latest revision as of 11:10, 15 July 2024

scientific article
Language Label Description Also known as
English
Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
scientific article

    Statements

    Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2018
    0 references
    0 references
    finite field
    0 references
    irreducible polynomial
    0 references
    polynomial basis
    0 references
    multiplication
    0 references
    0 references