Squaring architecture for GF (2 m )and itsapplications in cryptographic systems
Gerardo Orlando, Christof Paar · Electronics Letters · 2000
A squaring architecture for standard basis field representation is presented. The architecture is based on the observation that a squaring operation in GF(2m) can be transformed into an addition and a multiplication of two elements of special form, the computational time of which depends on the form of the field polynomial.