Issue No. 09 - September (2005 vol. 54)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2005.147
Recently, cryptographic applications based on finite fields have attracted much interest. This paper presents a transformation method to implement low-complexity Montgomery multipliers for all-one polynomials and trinomials. Using this method, we proposed a new bit-parallel systolic architecture for computing multiplications over GF(2^m). These new multipliers have a latency m+1 clock cycles and each cell incorporates at most one 2-input AND gate, two 2-input XOR gates, and four 1-bit latches. Moreover, these new multipliers are shown to exhibit significantly lower latency and circuit complexity than the related systolic multipliers and are highly appropriate for VLSI systems because of their regular interconnection pattern, modular structure, and fully inherent parallelism.
Index Terms- Bit-parallel systolic multiplier, finite field, irreducible trinomial, montgomery multiplication, irreducible AOP.
"Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)," in IEEE Transactions on Computers, vol. 54, no. , pp. 1061-1070, 2005.