YEN-CHING CHANG2026-10-162026-10-162012-01-01Pure ID: 15149698Pure UUID: b5410aae-2c4e-4df7-94e4-260505afc16310.1109/ISBAST.2012.13https://www.scopus.com/pages/publications/84862104304https://scholars.csmu.edu.tw/handle/123456789/25886A novel low-complexity scalable architecture for dual basis multiplications over GF(2 m) is proposed in this paper. This multiplier architecture is derived from the Hankel matrix-vector representation of dual basis multiplication, and is feasible for the finite fields generated by irreducible trinomials. By appropriately selecting its digit size, the proposed scalable architecture can achieve a satisfactory trade-off between hardware complexity and throughput performance for implementing ECC cryptosystems such as ECDSA in resource-constrained environments such as embedded systems and smart cards. Analytical results exhibit that the space complexity of the proposed multiplier architecture is substantially lower than that of the non-scalable architectures. Besides, owing to its features of regularity, modularity and concurrency, the proposed architecture is highly feasible for VLSI implementations.6enjournal article