Learn More
We present a new sequential normal basis multiplier over GF (2 m). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to(More)
This paper presents a new digit-serial systolic multiplier over <i>GF</i>(2<sup><i>m</i></sup>) for cryptographic applications. When input data come in continuously, the proposed array produces multiplication results at a rate of one every [<i>m/D</i>] + 2 clock cycles, where <i>D</i> is the selected digit size. Since the inner structure of the proposed(More)
In this paper, we propose a high performance elliptic curve cryptographic processor over GF(2<sup>163</sup>). The proposed architecture is based on a modified Lopez-Dahab elliptic curve point multiplication algorithm and uses Gaussian normal basis (GNB) for GF(2<sup>163</sup>) field arithmetic. To achieve a high throughput rates, we design two new word-(More)