Cryptography Reference
In-Depth Information
Table 11-2. Powers of
g
(
x
)=
x
+1
, ascending left to right
01
03
05
0F
11
33
55
FF
1A
2E
72
96
A1
F8
13
35
5F
E1
38
48
D8
73
95
A4
F7
02
06
0A
1E
22
66
AA
E5
34
5C
E4
37
59
EB
26
6A
BE
D9
70
90
AB
E6
31
53
F5
04
0C
14
3C
44
CC
4F
D1
68
B8
D3
6E
B2
CD
4C
D4
67
A9
E0
3B
4D
D7
62
A6
F1
08
18
28
78
88
83
9E
B9
D0
6B
BD
DC
7F
81
98
B3
CE
49
DB
76
9A
B5
C4
57
F9
10
30
50
F0
0B
1D
27
69
BB
D6
61
A3
FE
19
2B
7D
87
92
AD
EC
2F
71
93
AE
E9
20
60
A0
FB
16
3A
4E
D2
6D
B7
C2
5D
E7
32
56
FA
15
3F
41
C3
5E
E2
3D
47
C9
40
C0
5B
ED
2C
74
9C
BF
DA
75
9F
BA
D5
64
AC
EF
2A
7E
82
9D
BC
DF
7A
8E
89
80
9B
B6
C1
58
E8
23
65
AF
EA
25
6F
B1
C8
43
C5
54
FC
1F
21
63
A5
F4
07
09
1B
2D
77
99
B0
CB
46
CA
45
CF
4A
DE
79
8B
86
91
A8
E3
3E
42
C6
51
F3
0E
12
36
5A
EE
29
7B
8D
8C
8F
8A
85
94
A7
F2
0D
17
39
4B
DD
7C
84
97
A2
FD
1C
24
6C
B4
C7
52
F6
01
03
05
0F
11
33
55
FF
1A
2E
72
...
...
...
F6
F
2
8
Function:
multiplication of polynomials in
Syntax:
UCHAR polymul (unsigned int f, unsigned int h);
unsigned int f
(summand)
, unsigned int h
(summand)
Input:
the product
f
ยท
h
Return:
UCHAR
polymul (unsigned int f, unsigned int h)
{
if ((f != 0) && (h != 0))
{
