{{ message }}
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathBigInt.java
More file actions
385 lines (325 loc) · 11.1 KB
/
Copy pathBigInt.java
File metadata and controls
385 lines (325 loc) · 11.1 KB
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
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
/*
* Copyright (C) 2008 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package java.math;
/*
* In contrast to BigIntegers this class doesn't fake two's complement representation.
* Any Bit-Operations, including Shifting, solely regard the unsigned magnitude.
* Moreover BigInt objects are mutable and offer efficient in-place-operations.
*/
class BigInt {
/* Fields used for the internal representation. */
transient int bignum = 0;
public void dispose() {
if (this.bignum != 0) {
NativeBN.BN_free(this.bignum);
this.bignum = 0;
}
}
@Override protected void finalize() throws Throwable {
try {
dispose();
} finally {
super.finalize();
}
}
@Override
public String toString() {
return this.decString();
}
public int getNativeBIGNUM() {
return this.bignum;
}
public static int consumeErrors(StringBuilder sb) {
int cnt = 0;
int e, reason;
while ((e = NativeBN.ERR_get_error()) != 0) {
reason = e & 255;
if (reason == 103) {
throw new ArithmeticException("BigInteger division by zero");
}
if (reason == 108) {
throw new ArithmeticException("BigInteger not invertible");
}
if (reason == 65) {
throw new OutOfMemoryError();
}
sb.append(e).append(": ");
String s = NativeBN.ERR_error_string(e);
sb.append(s);
cnt++;
}
return cnt;
}
private static void Check(boolean success) {
if (!success) {
StringBuilder sb = new StringBuilder("(openssl)ERR: ");
int cnt = consumeErrors(sb);
if (cnt > 0)
throw new ArithmeticException(sb.toString());
}
}
private void makeValid() {
if (this.bignum == 0) {
this.bignum = NativeBN.BN_new();
Check(this.bignum != 0);
}
}
private static BigInt newBigInt() {
BigInt bi = new BigInt();
bi.bignum = NativeBN.BN_new();
Check(bi.bignum != 0);
return bi;
}
public static int cmp(BigInt a, BigInt b) {
return NativeBN.BN_cmp(a.bignum, b.bignum);
}
public void putCopy(BigInt from) {
this.makeValid();
Check(NativeBN.BN_copy(this.bignum, from.bignum));
}
public BigInt copy() {
BigInt bi = new BigInt();
bi.putCopy(this);
return bi;
}
public void putLongInt(long val) {
this.makeValid();
Check(NativeBN.putLongInt(this.bignum, val));
}
public void putULongInt(long val, boolean neg) {
this.makeValid();
Check(NativeBN.putULongInt(this.bignum, val, neg));
}
public void putDecString(String original) {
String s = checkString(original, 10);
this.makeValid();
int usedLen = NativeBN.BN_dec2bn(this.bignum, s);
Check((usedLen > 0));
if (usedLen < s.length()) {
throw new NumberFormatException(original);
}
}
public void putHexString(String original) {
String s = checkString(original, 16);
this.makeValid();
int usedLen = NativeBN.BN_hex2bn(this.bignum, s);
Check((usedLen > 0));
if (usedLen < s.length()) {
throw new NumberFormatException(original);
}
}
/**
* Returns a string suitable for passing to OpenSSL.
* Throws if 's' doesn't match Java's rules for valid BigInteger strings.
* BN_dec2bn and BN_hex2bn do very little checking, so we need to manually
* ensure we comply with Java's rules.
* http://code.google.com/p/android/issues/detail?id=7036
*/
public String checkString(String s, int base) {
if (s == null) {
throw new NullPointerException();
}
// A valid big integer consists of an optional '-' or '+' followed by
// one or more digit characters appropriate to the given base,
// and no other characters.
int charCount = s.length();
int i = 0;
if (charCount > 0) {
char ch = s.charAt(0);
if (ch == '+') {
// Java supports leading +, but OpenSSL doesn't, so we need to strip it.
s = s.substring(1);
--charCount;
} else if (ch == '-') {
++i;
}
}
if (charCount - i == 0) {
throw new NumberFormatException(s);
}
boolean nonAscii = false;
for (; i < charCount; ++i) {
char ch = s.charAt(i);
if (Character.digit(ch, base) == -1) {
throw new NumberFormatException(s);
}
if (ch > 128) {
nonAscii = true;
}
}
return nonAscii ? toAscii(s, base) : s;
}
// Java supports non-ASCII decimal digits, but OpenSSL doesn't.
// We need to translate the decimal digits but leave any other characters alone.
// This method assumes it's being called on a string that has already been validated.
private static String toAscii(String s, int base) {
int length = s.length();
StringBuilder result = new StringBuilder(length);
for (int i = 0; i < length; ++i) {
char ch = s.charAt(i);
int value = Character.digit(ch, base);
if (value >= 0 && value <= 9) {
ch = (char) ('0' + value);
}
result.append(ch);
}
return result.toString();
}
public void putBigEndian(byte[] a, boolean neg) {
this.makeValid();
Check(NativeBN.BN_bin2bn(a, a.length, neg, this.bignum));
}
public void putLittleEndianInts(int[] a, boolean neg) {
this.makeValid();
Check(NativeBN.litEndInts2bn(a, a.length, neg, this.bignum));
}
public void putBigEndianTwosComplement(byte[] a) {
this.makeValid();
Check(NativeBN.twosComp2bn(a, a.length, this.bignum));
}
public long longInt() {
return NativeBN.longInt(this.bignum);
}
public String decString() {
return NativeBN.BN_bn2dec(this.bignum);
}
public String hexString() {
return NativeBN.BN_bn2hex(this.bignum);
}
public byte[] bigEndianMagnitude() {
return NativeBN.BN_bn2bin(this.bignum);
}
public int[] littleEndianIntsMagnitude() {
return NativeBN.bn2litEndInts(this.bignum);
}
public int sign() {
return NativeBN.sign(this.bignum);
}
public void setSign(int val) {
if (val > 0) NativeBN.BN_set_negative(this.bignum, 0);
else if (val < 0) NativeBN.BN_set_negative(this.bignum, 1);
}
public boolean twosCompFitsIntoBytes(int desiredByteCount) {
int actualByteCount = (NativeBN.bitLength(this.bignum) + 7) / 8;
return actualByteCount <= desiredByteCount;
}
public int bitLength() {
return NativeBN.bitLength(this.bignum);
}
public boolean isBitSet(int n) {
return NativeBN.BN_is_bit_set(this.bignum, n);
}
// n > 0: shift left (multiply)
public static BigInt shift(BigInt a, int n) {
BigInt r = newBigInt();
Check(NativeBN.BN_shift(r.bignum, a.bignum, n));
return r;
}
public void shift(int n) {
Check(NativeBN.BN_shift(this.bignum, this.bignum, n));
}
public void addPositiveInt(int w) {
Check(NativeBN.BN_add_word(this.bignum, w));
}
public void multiplyByPositiveInt(int w) {
Check(NativeBN.BN_mul_word(this.bignum, w));
}
public static int remainderByPositiveInt(BigInt a, int w) {
int rem = NativeBN.BN_mod_word(a.bignum, w);
Check(rem != -1);
return rem;
}
public static BigInt addition(BigInt a, BigInt b) {
BigInt r = newBigInt();
Check(NativeBN.BN_add(r.bignum, a.bignum, b.bignum));
return r;
}
public void add(BigInt a) {
Check(NativeBN.BN_add(this.bignum, this.bignum, a.bignum));
}
public static BigInt subtraction(BigInt a, BigInt b) {
BigInt r = newBigInt();
Check(NativeBN.BN_sub(r.bignum, a.bignum, b.bignum));
return r;
}
public static BigInt gcd(BigInt a, BigInt b) {
BigInt r = newBigInt();
Check(NativeBN.BN_gcd(r.bignum, a.bignum, b.bignum));
return r;
}
public static BigInt product(BigInt a, BigInt b) {
BigInt r = newBigInt();
Check(NativeBN.BN_mul(r.bignum, a.bignum, b.bignum));
return r;
}
public static BigInt bigExp(BigInt a, BigInt p) {
// Sign of p is ignored!
BigInt r = newBigInt();
Check(NativeBN.BN_exp(r.bignum, a.bignum, p.bignum));
return r;
}
public static BigInt exp(BigInt a, int p) {
// Sign of p is ignored!
BigInt power = new BigInt();
power.putLongInt(p);
return bigExp(a, power);
// OPTIONAL:
// public int BN_sqr(BigInteger r, BigInteger a, BN_CTX ctx);
// int BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx);
}
public static void division(BigInt dividend, BigInt divisor,
BigInt quotient, BigInt remainder) {
int quot, rem;
if (quotient != null) {
quotient.makeValid();
quot = quotient.bignum;
}
else quot = 0;
if (remainder != null) {
remainder.makeValid();
rem = remainder.bignum;
}
else rem = 0;
Check(NativeBN.BN_div(quot, rem, dividend.bignum, divisor.bignum));
}
public static BigInt modulus(BigInt a, BigInt m) {
// Sign of p is ignored! ?
BigInt r = newBigInt();
Check(NativeBN.BN_nnmod(r.bignum, a.bignum, m.bignum));
return r;
}
public static BigInt modExp(BigInt a, BigInt p, BigInt m) {
// Sign of p is ignored!
BigInt r = newBigInt();
Check(NativeBN.BN_mod_exp(r.bignum, a.bignum, p.bignum, m.bignum));
// OPTIONAL:
// int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
return r;
}
public static BigInt modInverse(BigInt a, BigInt m) {
BigInt r = newBigInt();
Check(NativeBN.BN_mod_inverse(r.bignum, a.bignum, m.bignum));
return r;
}
public static BigInt generatePrimeDefault(int bitLength) {
BigInt r = newBigInt();
Check(NativeBN.BN_generate_prime_ex(r.bignum, bitLength, false, 0, 0, 0));
return r;
}
public boolean isPrime(int certainty) {
return NativeBN.BN_is_prime_ex(bignum, certainty, 0);
}
}
You can’t perform that action at this time.