COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
Mohsen Machhout1, Zied Guitouni1, Kholdoun Torki 2, Lazhar Khriji3 and Rached Tourki1
1Electronics and Micro-Electronics Laboratory (E. µ .E. L), Faculty of Sciences of Monastir, Tunisia
2TIMA – CMP Laboratory, Grenoble, France
3Information Engineering Department, Sultane Qaboos University, Oman.
ABSTRACT
In this paper, we propose an elliptic curve key generation processor over GF(2163) scheme based on the Montgomery scalar multiplication algorithm. The new architecture is performed using polynomial basis. The Finite Field operations use a cellular automata multiplier and Fermat algorithm for inversion. For real time implementation, the architecture has been tested on an ISE 9.1 Software using Xilinx Virtex II Pro FPGA and on an ASIC CMOS 45 nm technology as well. The proposed implementation provides a time of 2.07 ms and 38 percent of Slices in Xilinx Virtex II Pro FPGA. Such features reveal the high efficiently of this implementation design.
KEYWORDS
Elliptic curve cryptography, cellular automata, finite fields & Montgomery algorithm.
Original Source Link : http://airccse.org/journal/nsa/0410ijnsa8.pdf
No comments:
Post a Comment