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 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290
|
/*
* Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
import sun.security.util.math.*;
import java.math.BigInteger;
import java.nio.ByteBuffer;
import java.util.Arrays;
import java.util.Optional;
/**
* Arithmetic in the field of integers modulo a prime value implemented using
* BigInteger. This implementation is very versatile, but it is slow and none
* of the operations are value-independent. This class is intended for use in
* testing and prototyping, and production code should probably use a more
* specialized arithmetic implementation.
*/
public class BigIntegerModuloP implements IntegerFieldModuloP {
private final BigInteger p;
public BigIntegerModuloP(BigInteger p) {
this.p = p;
}
@Override
public BigInteger getSize() {
return p;
}
@Override
public ImmutableElement get0() {
return new ImmutableElement(BigInteger.ZERO);
}
@Override
public ImmutableElement get1() {
return new ImmutableElement(BigInteger.ONE);
}
@Override
public ImmutableElement getElement(BigInteger v) {
return new ImmutableElement(v);
}
@Override
public ImmutableElement getElement(byte[] v, int offset, int length,
byte highByte) {
byte[] bigIntIn = new byte[length + 1];
System.arraycopy(v, offset, bigIntIn, 0, length);
bigIntIn[length] = highByte;
reverse(bigIntIn);
return new ImmutableElement(new BigInteger(1, bigIntIn).mod(getSize()));
}
@Override
public SmallValue getSmallValue(int i) {
return new SmallElement(i);
}
private abstract class Element implements IntegerModuloP {
protected BigInteger v;
protected Element(BigInteger v) {
this.v = v;
}
protected Element(boolean v) {
this.v = BigInteger.valueOf(v ? 1 : 0);
}
private BigInteger getModulus() {
return getField().getSize();
}
@Override
public IntegerFieldModuloP getField() {
return BigIntegerModuloP.this;
}
@Override
public BigInteger asBigInteger() {
return v;
}
@Override
public MutableElement mutable() {
return new MutableElement(v);
}
@Override
public ImmutableElement fixed() {
return new ImmutableElement(v);
}
@Override
public ImmutableElement add(IntegerModuloP b) {
return new ImmutableElement(
v.add(b.asBigInteger()).mod(getModulus()));
}
@Override
public ImmutableElement additiveInverse() {
return new ImmutableElement(v.negate().mod(getModulus()));
}
@Override
public ImmutableElement multiply(IntegerModuloP b) {
return new ImmutableElement(
v.multiply(b.asBigInteger()).mod(getModulus()));
}
@Override
public void addModPowerTwo(IntegerModuloP arg, byte[] result) {
BigInteger biThis = asBigInteger();
BigInteger biArg = arg.asBigInteger();
bigIntAsByteArray(biThis.add(biArg), result);
}
private void bigIntAsByteArray(BigInteger arg, byte[] result) {
byte[] bytes = arg.toByteArray();
// bytes is backwards and possibly too big
// Copy the low-order bytes into result in reverse
int sourceIndex = bytes.length - 1;
for (int i = 0; i < result.length; i++) {
if (sourceIndex >= 0) {
result[i] = bytes[sourceIndex--];
} else {
result[i] = 0;
}
}
}
@Override
public void asByteArray(byte[] result) {
bigIntAsByteArray(v, result);
}
@Override
public long[] getLimbs() {
return null;
}
}
private class ImmutableElement extends Element
implements ImmutableIntegerModuloP {
private ImmutableElement(BigInteger v) {
super(v);
}
}
private class MutableElement extends Element
implements MutableIntegerModuloP {
private MutableElement(BigInteger v) {
super(v);
}
@Override
public void conditionalSet(IntegerModuloP b, int set) {
if (set == 1) {
v = b.asBigInteger();
}
}
@Override
public void conditionalSwapWith(MutableIntegerModuloP b, int swap) {
if (swap == 1) {
BigInteger temp = v;
v = b.asBigInteger();
((Element) b).v = temp;
}
}
@Override
public MutableElement setValue(IntegerModuloP v) {
this.v = ((Element) v).v;
return this;
}
@Override
public MutableElement setValue(byte[] arr, int offset, int length,
byte highByte) {
byte[] bigIntIn = new byte[length + 1];
System.arraycopy(arr, offset, bigIntIn, 0, length);
bigIntIn[length] = highByte;
reverse(bigIntIn);
v = new BigInteger(bigIntIn).mod(getSize());
return this;
}
@Override
public MutableElement setValue(ByteBuffer buf, int length,
byte highByte) {
byte[] bigIntIn = new byte[length + 1];
buf.get(bigIntIn, 0, length);
bigIntIn[length] = highByte;
reverse(bigIntIn);
v = new BigInteger(bigIntIn).mod(getSize());
return this;
}
@Override
public MutableElement setSquare() {
v = v.multiply(v).mod(getSize());
return this;
}
@Override
public MutableElement setProduct(IntegerModuloP b) {
Element other = (Element) b;
v = v.multiply(other.v).mod(getSize());
return this;
}
@Override
public MutableElement setProduct(SmallValue value) {
BigInteger bigIntValue = ((SmallElement) value).asBigInteger();
v = v.multiply(bigIntValue).mod(getSize());
return this;
}
@Override
public MutableElement setSum(IntegerModuloP b) {
Element other = (Element) b;
v = v.add(other.v).mod(getSize());
return this;
}
@Override
public MutableElement setDifference(IntegerModuloP b) {
Element other = (Element) b;
v = v.subtract(other.v).mod(getSize());
return this;
}
@Override
public MutableElement setAdditiveInverse() {
v = BigInteger.ZERO.subtract(v);
return this;
}
}
private class SmallElement extends ImmutableElement implements SmallValue {
public SmallElement(int v) {
super(BigInteger.valueOf(v).mod(getSize()));
}
}
private static void swap(byte[] arr, int i, int j) {
byte tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
private static void reverse(byte [] arr) {
int i = 0;
int j = arr.length - 1;
while (i < j) {
swap(arr, i, j);
i++;
j--;
}
}
}
|