Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404): 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.2013.10.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082754925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265362 / 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 modified Massey-Omura parallel multiplier for a class of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mastrovito multiplier for all trinomials / 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: Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial / 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: Low complexity bit-parallel multipliers for a class of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new hardware architecture for operations in GF(2/sup n/) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797793 / 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: Five, six, and seven-term Karatsuba-like formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite field multiplier using redundant representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplexer-based array multipliers / rank
 
Normal rank

Latest revision as of 10:11, 8 July 2024

scientific article
Language Label Description Also known as
English
Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
scientific article

    Statements

    Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (English)
    0 references
    0 references
    0 references
    0 references
    14 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    generalized Karatsuba algorithm
    0 references
    bit-parallel multiplier
    0 references
    all-one polynomial
    0 references
    redundant representation
    0 references
    cryptography
    0 references
    0 references