Squaring architecture for GF(2(m)) and its applications in cryptographic systems

A squaring architecture for standard basis held representation is presented . The architecture is based on the observation that a squaring operation in GF(2(m)) can be transformed into an addition and a multiplication of two e lements of special form, the computational time of which depends on the for m of the field polynomial.