Sentence:  In this case, the GF(2m) multiplication is implemented in hardware using three algorithms for <WSD>polynomial basis</WSD> (PB) and three for gaussian normal basis (GNB). 
Meaning of the word marked with <WSD> tags:  "Specifically", a basis, of the form <big>{</big>1, "α", ..., "α''''n"-1<big>}</big>, of a finite extension '''F'''<sub>"qn"</sub> of a Galois field '''F'''<sub>"q"</sub>, where "α" is a primitive element of '''F'''<sub>"qn"</sub> (i.e., a root of a degree-"n" primitive polynomial over '''F'''<sub>"q"</sub>).