Let a and b be polynomials in GF(2)[x], and let and r be the corresponding unique...

 

Transcribed Image Text:

Let a and b be polynomials in GF(2)[x], and let and r be the corresponding unique polynomials in GF (2) [x] such that a = bq+r, where 7 = 0 or deg (7) < deg (6). Construct in pseudocode two algorithms Quo (a,b) a and REM (a, b) which respectively compute and . Using the above algorithmic procedures Quo (a,b) and REM (a,b), . con- struct in pseudocode an algorithmic procedure INVERSE(a) which computes the inverse a of a in GF (2"), provided a 0. Let a and b be polynomials in GF(2)[x], and let and r be the corresponding unique polynomials in GF (2) [x] such that a = bq+r, where 7 = 0 or deg (7) < deg (6). Construct in pseudocode two algorithms Quo (a,b) a and REM (a, b) which respectively compute and . Using the above algorithmic procedures Quo (a,b) and REM (a,b), . con- struct in pseudocode an algorithmic procedure INVERSE(a) which computes the inverse a of a in GF (2"), provided a 0.