Title: GF(2^m) versatile multiplier/adder architecture for cryptographic applications

Authors: Haichour Amina Selma; Hamadouche M'hamed

Addresses: LIMOSE Laboratory, Faculty of Sciences, University M'hamed Bougara of Boumerdes, Independence Avenue, DZ-35000, Boumerdes, Algeria ' LIMOSE Laboratory, Faculty of Sciences, University M'hamed Bougara of Boumerdes, Independence Avenue, DZ-35000, Boumerdes, Algeria

Abstract: This paper describes a versatile module architecture for performing multiplication and addition in binary finite fields GF(2^m), with applications to cryptography, using a polynomial basis representation. The proposed architecture provides an execution of the most significant bit (MSB)-first bit-serial multiplication for different operand lengths. This arithmetic module has cryptographic relevance, indeed the latter offers architecture with the features of high order of flexibility which allows an easy configuration for different field sizes, and low hardware complexity which results in small area. The evaluation of efficiency of the proposed architecture is based on criteria of time (latency, critical path) and space (gate-latch number).

Keywords: elliptic curve cryptography; ECC; finite fields; GF(2^m) arithmetic; most significant bit; MSB-first multiplication; polynomial basis; versatile architecture; multiplier architecture; adder architecture; latency; critical path; gate-latch number.

DOI: 10.1504/IJCAD.2016.082141

International Journal of Circuits and Architecture Design, 2016 Vol.2 No.2, pp.118 - 131

Received: 22 Sep 2015
Accepted: 31 Mar 2016
Published online: 08 Feb 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article