Bonfring International Journal of Power Systems and Integrated Circuits

Online ISSN: 2277-5072 | Print ISSN: 2250-1088 | Frequency: 4 Issues/Year

Impact Factor: 0.651 | International Scientific Indexing(ISI) calculate based on International Citation Report(ICR)

Digit Serial Finite Field Multiplier Using Normal Basis for Cryptographic Applications

N. Gayathri and P.F. Khaleelur Rahiman

---

Abstract:

In this paper a new digit serial finite field multiplier using normal basis is proposed. In digit serial architecture data words with length m are partitioned into digits of few bits each and then processed on a digit by digit basis. If the digit size is L-bits and N=m/L the digit serial system process input data at a rate of L-bits per clock cycle and output is produced in every N clock cycle. Latency of a digit serial operation is the time taken to produce a digit. Using a sum of partial multiplication the latency is less compared with other digit serial multipliers. This architecture is well suitable for VLSI implementation and widely used in cryptographic application like elliptic curve cryptography.

Keywords: Finite Field Multiplier, Normal Basis, Digit Serial Architecture, Elliptic Curve Cryptography

Volume: 2 | Issue: Special Issue on Communication Technology Interventions for Rural and Social Development

Pages: 149-151

Issue Date: February , 2012