A Fast Hybrid Arithmetic Unit for Elliptic Curve Cryptosystem in Galois Fields with Prime and Composite Exponents

摘要

References(7) Cited-By(2) In this paper, we propose the efficient flexible hybrid arithmetic unit for elliptic curve cryptographic applications which executes addition, multiplication and inversion in GF (2m). The proposed flexible hybrid GFAU is beneficial in cost-effectively implementing microprocessors' elliptic curve public-key extensions. It targets applications for smart cards whose gate count is below 20,000.