Adnan Gutub - FAST ELLIPTIC CURVE CRYPTOGRAPHIC PROCESSOR ARCHITECTURE BASED ON THREE PARALLEL GF(2k) BIT LEVEL PIPELINED DIGIT SERIAL MULTIPLIERS

IEEE 10th International Conference on Electronics, Circuits and Systems (ICECS 2003), pages 72-75, University of Sharjah, United Arab Emirates, December 14-17, 2003

FAST ELLIPTIC CURVE CRYPTOGRAPHIC PROCESSOR ARCHITECTURE BASED ON THREE PARALLEL GF(2^k) BIT LEVEL PIPELINED DIGIT SERIAL MULTIPLIERS

Adnan Abdul-Aziz Gutub

Computer Engineering Department

King Fahd University of Petroleum and Minerals

Dhahran 31261, SAUDI ARABIA

Email: gutub@kfupm.edu.sa

Abstract:

Unusual processor architecture for elliptic curve encryption is proposed in this paper. The architecture exploits projective coordinates (x=X/Z, y=Y/Z) to convert GF(2^k) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2^k) multipliers implemented using bit-level pipelined digit serial computation. It is shown that this results in a faster operation than using fully parallel multipliers with the added advantage of requiring less area. The proposed architecture is a serious contender for implementing data security systems based on elliptic curve cryptography.