Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2^m).

Reyhani-Masoleh, A., & Hasan, M. A. (2004). Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2^m). IEEE Transactions on Computers, 945-959.

Type

Journal article

Intellectual base

Primary research

Year

2004

DOI

10.1109/tc.2004.47

Link

https://doi.org/10.1109/TC.2004.47

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Equally Spaced Polynomial
  • Those consequences follow from the defining support pattern; they do not require irreducibility.

    This sourcePrimary source defining (s)-ESPs and optimizing reduction/multiplier structures for irreducible ESPs, trinomials, and pentanomials.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:9b66295a68d9 · see in the full table