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.
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.
- Those consequences follow from the defining support pattern; they do not require irreducibility.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:9b66295a68d9 · see in the full table