Abstract
In this paper, four parallel-in parallel-out sy stolic arrays are proposed for computing inve rsion or division in finite fields GF(2m) base d on new variants of Euclid’s algorithm with the standard basis representation. Two of th ese arrays involve O(m2) area-complexity an d O(1) time-complexity. The other two involv e O(m) area-complexity and O(m) time-comp lexity. They are highly regular, modular, and thus well suited to VLSI implementation. As compared to existing related systolic archite ctures：1) the former two and the one in [1 4] have the same area and time complexitie s, but our proposed arrays involve less hard ware area； 2) the latter two with O (m) are a-complexity gains a significant improvemen t in area complexity.