blob: f0e44ebe677de7f7d620d237694e44668081f316 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
|
using System;
namespace Org.BouncyCastle.Pqc.Math.LinearAlgebra
{
/**
* This class implements vectors over the finite field
* <tt>GF(2<sup>m</sup>)</tt> for small <tt>m</tt> (i.e.,
* <tt>1<m<32</tt>). It extends the abstract class {@link Vector}.
*/
public class GF2mVector : Vector
{
/**
* the finite field this vector is defined over
*/
private GF2mField field;
/**
* the element array
*/
private int[] vector;
/**
* creates the vector over GF(2^m) of given length and with elements from
* array v (beginning at the first bit)
*
* @param field finite field
* @param v array with elements of vector
*/
public GF2mVector(GF2mField field, byte[] v)
{
this.field = new GF2mField(field);
// decode vector
int d = 8;
int count = 1;
while (field.GetDegree() > d)
{
count++;
d += 8;
}
if ((v.Length % count) != 0)
{
throw new ArgumentException(
"Byte array is not an encoded vector over the given finite field.");
}
length = v.Length / count;
vector = new int[length];
count = 0;
for (int i = 0; i < vector.Length; i++)
{
for (int j = 0; j < d; j += 8)
{
vector[i] |= (v[count++] & 0xff) << j;
}
if (!field.IsElementOfThisField(vector[i]))
{
throw new ArgumentException(
"Byte array is not an encoded vector over the given finite field.");
}
}
}
/**
* Create a new vector over <tt>GF(2<sup>m</sup>)</tt> of the given
* length and element array.
*
* @param field the finite field <tt>GF(2<sup>m</sup>)</tt>
* @param vector the element array
*/
public GF2mVector(GF2mField field, int[] vector)
{
this.field = field;
length = vector.Length;
for (int i = vector.Length - 1; i >= 0; i--)
{
if (!field.IsElementOfThisField(vector[i]))
{
throw new ArithmeticException(
"Element array is not specified over the given finite field.");
}
}
this.vector = IntUtils.Clone(vector);
}
/**
* Copy constructor.
*
* @param other another {@link GF2mVector}
*/
public GF2mVector(GF2mVector other)
{
field = new GF2mField(other.field);
length = other.length;
vector = IntUtils.Clone(other.vector);
}
/**
* @return the finite field this vector is defined over
*/
public GF2mField GetField()
{
return field;
}
/**
* @return int[] form of this vector
*/
public int[] GetIntArrayForm()
{
return IntUtils.Clone(vector);
}
/**
* @return a byte array encoding of this vector
*/
public override byte[] GetEncoded()
{
int d = 8;
int count = 1;
while (field.GetDegree() > d)
{
count++;
d += 8;
}
byte[] res = new byte[vector.Length * count];
count = 0;
for (int i = 0; i < vector.Length; i++)
{
for (int j = 0; j < d; j += 8)
{
res[count++] = (byte)(Utils.UnsignedRightBitShiftInt(vector[i], j));
}
}
return res;
}
/**
* @return whether this is the zero vector (i.e., all elements are zero)
*/
public override bool IsZero()
{
for (int i = vector.Length - 1; i >= 0; i--)
{
if (vector[i] != 0)
{
return false;
}
}
return true;
}
/**
* Add another vector to this vector. Method is not yet implemented.
*
* @param addend the other vector
* @return <tt>this + addend</tt>
* @throws ArithmeticException if the other vector is not defined over the same field as
* this vector.
* <p>
* TODO: implement this method
*/
public override Vector Add(Vector addend)
{
throw new SystemException("not implemented");
}
/**
* Multiply this vector with a permutation.
*
* @param p the permutation
* @return <tt>this*p = p*this</tt>
*/
public override Vector Multiply(Permutation p)
{
int[] pVec = p.GetVector();
if (length != pVec.Length)
{
throw new ArithmeticException(
"permutation size and vector size mismatch");
}
int[] result = new int[length];
for (int i = 0; i < pVec.Length; i++)
{
result[i] = vector[pVec[i]];
}
return new GF2mVector(field, result);
}
/**
* Compare this vector with another object.
*
* @param other the other object
* @return the result of the comparison
*/
public override bool Equals(Object other)
{
if (!(other is GF2mVector))
{
return false;
}
GF2mVector otherVec = (GF2mVector)other;
if (!field.Equals(otherVec.field))
{
return false;
}
return IntUtils.Equals(vector, otherVec.vector);
}
}
}
|
