A new dual-field elliptic curve cryptography processor

A new elliptic curve cryptography (ECC processor is proposed in this paper, which supports Galois fields GF(p) and GF(2ⁿ) arithmetic for arbitrary prime numbers and irreducible polynomials by introducing a dual-field unified algorithm and data-path. To speed up the scalar multiplication, OJW (optimal joint weight) form is used to convert the integers to optimal signed-binary form on the fly, which is especially useful for the verifying operation of elliptic curve digital signature algorithm. Also in this paper, Montgomery multiplication and modular division algorithm are unified to achieve high area-efficiency and carry-save redundant form of the intermediate results is preserved to reduce the critical path delay. At the same time, the EC arithmetic is executed in an anti-attack form ensuring the proposed design against side-channel power attacks efficiently