A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m) (Q3628444): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4718481 / 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: AOP arithmetic architectures over GF(2\(^m\)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5248329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of parallel multipliers for a class of fields \(GF(2^ m)\) / rank
 
Normal rank

Latest revision as of 14:49, 1 July 2024

scientific article
Language Label Description Also known as
English
A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)
scientific article

    Statements

    A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m) (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2009
    0 references
    0 references
    Galois field
    0 references
    bit-serial multiplier
    0 references
    irreducible polynomial
    0 references
    linear feedback shift register
    0 references
    elliptic curve cryptography
    0 references
    0 references