A new architecture for a parallel finite field multiplier with low complexity based on composite fields (Q4420885)

From MaRDI portal
Revision as of 05:08, 29 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1966814
Language Label Description Also known as
English
A new architecture for a parallel finite field multiplier with low complexity based on composite fields
scientific article; zbMATH DE number 1966814

    Statements

    A new architecture for a parallel finite field multiplier with low complexity based on composite fields (English)
    0 references
    0 references
    0 references
    1996
    0 references
    0 references
    0 references
    0 references
    0 references
    bit parallel multiplication
    0 references
    polynomial multiplication
    0 references
    Karatsuba Ofman algorithm
    0 references
    VLSI architecture
    0 references