Lines Matching defs:ks
43 private int[] ks;
58 this.ks = null;
97 // convert rp into ks
99 this.ks = new int[bitCount-2];
100 for (int i = this.ks.length-1; i >= 0; i--) {
102 this.ks[i] = index;
111 * field is based on {@code ks} whose content
120 * > {@code k1} >= 1), so {@code ks} should
123 * @param ks the order of the middle term(s) of the
126 * @exception NullPointerException if {@code ks} is null.
128 * is not positive, or the length of {@code ks}
129 * is neither 1 nor 3, or values in {@code ks}
133 public ECFieldF2m(int m, int[] ks) {
134 // check m and ks
136 this.ks = ks.clone();
140 if ((this.ks.length != 1) && (this.ks.length != 3)) {
142 ("length of ks is neither 1 nor 3");
144 for (int i = 0; i < this.ks.length; i++) {
145 if ((this.ks[i] < 1) || (this.ks[i] > m-1)) {
147 ("ks["+ i + "] is out of range");
149 if ((i != 0) && (this.ks[i] >= this.ks[i-1])) {
151 ("values in ks are not in descending order");
154 // convert ks into rp
157 for (int j = 0; j < this.ks.length; j++) {
158 rp = rp.setBit(this.ks[j]);
203 if (ks == null) {
206 return ks.clone();
221 // no need to compare rp here since ks and rp
224 (Arrays.equals(ks, ((ECFieldF2m) obj).ks)));
237 // no need to involve ks here since ks and rp