Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
scientific article

    Statements

    Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (English)
    0 references
    0 references
    0 references
    19 April 2010
    0 references
    shifted polynomial basis (SPB)
    0 references
    equally-spaced trinomial (EST)
    0 references
    Karatsuba method
    0 references
    bit-parallel multiplier
    0 references
    cryptography
    0 references

    Identifiers