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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082161294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703780 / 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: Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation with finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new architecture for a parallel finite field multiplier with low complexity based on composite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient multiplier architectures for Galois fields GF(2/sup 4n/) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new construction of Massey-Omura parallel multiplier over GF(2/sup m/) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New low-complexity bit-parallel finite field multipliers using weakly dual bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-serial Reed - Solomon encoders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIGNED BINARY MULTIPLICATION TECHNIQUE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplexer-based array multipliers / rank
 
Normal rank

Latest revision as of 07:41, 6 July 2024

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
    multiplier
    0 references
    cryptography
    0 references
    multiplexer
    0 references
    finite field
    0 references
    polynomial basis
    0 references

    Identifiers