Title :
Squaring architecture for GF(2m) and its applications in cryptographic systems
Author :
Orlando, G. ; Paar, C.
Author_Institution :
Dept. of Electr. Comput. Eng., Worcester Polytech. Inst., MA, USA
fDate :
6/22/2000 12:00:00 AM
Abstract :
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
Keywords :
cryptography; multiplying circuits; polynomials; GF(2m); addition; computational time; cryptographic systems; field polynomial; multiplication; squaring architecture; standard basis field representation;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20000824
