ABSTRACT: This paper is devoted to the design of Quad core crypto processor for executing both Prime field and binary extension field instructions. The proposed design is specifically optimized for Field programmable gate array (FPGA) platform. Combination of two different field (prime field GF(P) and Binary extension field GF(2m)) instructions execution is analyzed. Quad core will execute four instruction at a same time. The design is implemented in Spartan 3E , virtex4 and virtex5. The performance results between them are compared. The implementation result shows the execution of parallelism using dual field instructions.
Keywords: Binary extension field, Cryptoprocessor, FPGA, Primefield
[1] Johannes Wolkerstorfer, "Dual-Field Arithmetic Unit for GF(p) and GF(2m)"Institute for Applied Information Processing and Communications, Graz University of Technology, Inffeldgasse 16a, 8010 Graz, Austria. This work origin from the European Commission funded project USB CRYPT established under contract IST-2000-25169intheInformationSocietyTechnologies(IST)Program.
[2] Jun-Hong Chen, Ming-Der Shieh, Member, IEEE, and Wen-Ching Lin, "A High-Performance Unified-Field Reconfigurable Cryptographic Processor" IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 18, NO. 8, AUGUST 2010.
[3] Michael Grand, Lilian Bossuet2, Guy Gogniat, Bertrand Le Gal, Jean-Philippe Delahaye and Dominique Dallet, "A Reconfigurable Multi-core Cryptoprocessor for Multi-channel Communication Systems", published in "IPDPS - 25th IEEE International Parallel & Distributed Processing Symposium, Anchorage : United States (2011)"
[4] Santosh Ghosh, Debdeep Mukhopadhyay, and Dipanwita Roychowdhury "Secure Dual-Core Cryptoprocessor for Pairings Over Barreto-Naehrig Curves on FPGA Platform" IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS,
[5] P.C. Kocher, "Timing attacks on implementations of diffle-hellman, RSA,DSS and other systems," in Adv. Cryptology-CRYPTO'96,LNCS1109,1996,pp.104-113.
[6] D.Kammler, D.Zhang, P.Schwabe,H. charwaechter, M. Langenberg, D. Auras, G. Ascheid, and R. Mathar, "Designing an ASIP for cryptographic pairings over Barreto-Naehrig Curves," CHES'09, LNCS 5747, pp. 254-271,2009.
[7] J. Fan, F. Vercauteren, and I.Verbauwhede, "Faster Fp-arithematic for Cryptographic pairings on Barreto-Naehrig curves," CHES'09, LNCS 5747, pp.240-253, 2009.
[8] D. N. Amanor, C. Paar, J. Pelzl, V. Bunimov, and M. Schimmler, "Efficient hardware architectures for modular multiplication on FPGAs," in proc.Int. Conf. Field Program. LogicAppl.2005,pp.539-542. [9] V. Bunimov and M. Schmiller, "Area and time efficient modular multiplication of large integers," in Proc. ASAP, 2003,pp.400-409. [10] Huapeng Wu, Member IEEE, "Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis", IEEE TRANSACTIONS ON COMPUTERS, VOL. 51, NO. 7, JULY 2002