Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198)

From MaRDI portal
Revision as of 08:41, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
scientific article

    Statements

    Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    0 references
    multiplier
    0 references
    cryptography
    0 references
    multiplexer
    0 references
    finite field
    0 references
    polynomial basis
    0 references
    0 references