Squaring Architecture for GF(2^m) and its Applications in Cryptographic Systems

G. Orlando, Chris­tof Paar

Electronic Letters, vol. 36, no. 13, pp. 1116-1117, June, 2000.


Abstract

This contribution describes a squarer architecture for standard basis field representation. This architecture is based on the observation that one can transform a squaring operation in GF(2m) into an addition and a multiplication of two elements of special form, which computational time depends on the form of the eld polynomial.

[pdf] [gz]

Tags: cryptography