extern "C" void Java_java_math_NativeBN_BN_1generate_1prime_1ex(JNIEnv* env, jclass, jlong ret, int bits, jboolean safe, jlong add, jlong rem, jlong cb) { if (!oneValidHandle(env, ret)) return; BN_generate_prime_ex(toBigNum(ret), bits, safe, toBigNum(add), toBigNum(rem), reinterpret_cast<BN_GENCB*>(cb)); throwExceptionIfNecessary(env); }
extern "C" int Java_java_math_NativeBN_sign(JNIEnv* env, jclass, jlong a) { if (!oneValidHandle(env, a)) return -2; if (BN_is_zero(toBigNum(a))) { return 0; } else if (BN_is_negative(toBigNum(a))) { return -1; } return 1; }
extern "C" void Java_java_math_NativeBN_BN_1shift(JNIEnv* env, jclass, jlong r, jlong a, int n) { if (!twoValidHandles(env, r, a)) return; if (n >= 0) { BN_lshift(toBigNum(r), toBigNum(a), n); } else { BN_rshift(toBigNum(r), toBigNum(a), -n); } throwExceptionIfNecessary(env); }
extern "C" void Java_java_math_NativeBN_BN_1bin2bn(JNIEnv* env, jclass, jbyteArray arr, int len, jboolean neg, jlong ret) { if (!oneValidHandle(env, ret)) return; ScopedByteArrayRO bytes(env, arr); if (bytes.get() == NULL) { return; } BN_bin2bn(reinterpret_cast<const unsigned char*>(bytes.get()), len, toBigNum(ret)); if (!throwExceptionIfNecessary(env) && neg) { BN_set_negative(toBigNum(ret), true); } }
/** * Note: * This procedure directly writes the internal representation of BIGNUMs. * We do so as there is no direct interface based on Little Endian Integer Arrays. * Also note that the same representation is used in the Cordoba Java Implementation of BigIntegers, * whereof certain functionality is still being used. */ extern "C" void Java_java_math_NativeBN_litEndInts2bn(JNIEnv* env, jclass, jintArray arr, int len, jboolean neg, jlong ret0) { if (!oneValidHandle(env, ret0)) return; BIGNUM* ret = toBigNum(ret0); bn_check_top(ret); if (len > 0) { ScopedIntArrayRO scopedArray(env, arr); if (scopedArray.get() == NULL) { return; } STATIC_ASSERT(sizeof(BN_ULONG) == sizeof(jint), BN_ULONG_not_32_bit); const BN_ULONG* tmpInts = reinterpret_cast<const BN_ULONG*>(scopedArray.get()); if ((tmpInts != NULL) && (bn_wexpand(ret, len) != NULL)) { int i = len; do { i--; ret->d[i] = tmpInts[i]; } while (i > 0); ret->top = len; ret->neg = neg; // need to call this due to clear byte at top if avoiding // having the top bit set (-ve number) // Basically get rid of top zero ints: bn_correct_top(ret); } else { throwExceptionIfNecessary(env); } } else { // (len = 0) means value = 0 and sign will be 0, too. ret->top = 0; } }
extern "C" jstring Java_java_math_NativeBN_BN_1bn2hex(JNIEnv* env, jclass, jlong a) { if (!oneValidHandle(env, a)) return NULL; char* tmpStr = BN_bn2hex(toBigNum(a)); if (tmpStr == NULL) { return NULL; } char* retStr = leadingZerosTrimmed(tmpStr); jstring returnJString = env->NewStringUTF(retStr); OPENSSL_free(tmpStr); return returnJString; }
extern "C" int Java_java_math_NativeBN_BN_1hex2bn(JNIEnv* env, jclass, jlong a0, jstring str) { if (!oneValidHandle(env, a0)) return -1; ScopedUtfChars chars(env, str); if (chars.c_str() == NULL) { return -1; } BIGNUM* a = toBigNum(a0); int result = BN_hex2bn(&a, chars.c_str()); throwExceptionIfNecessary(env); return result; }
static void negBigEndianBytes2bn(JNIEnv*, jclass, const unsigned char* bytes, int bytesLen, jlong ret0) { BIGNUM* ret = toBigNum(ret0); // We rely on: (BN_BITS2 == 32), i.e. BN_ULONG is unsigned int and has 4 bytes: bn_check_top(ret); // FIXME: assert bytesLen > 0 int intLen = (bytesLen + 3) / 4; int firstNonzeroDigit = -2; if (bn_wexpand(ret, intLen) != NULL) { BN_ULONG* d = ret->d; BN_ULONG di; ret->top = intLen; int highBytes = bytesLen % 4; int k = bytesLen; // Put bytes to the int array starting from the end of the byte array int i = 0; while (k > highBytes) { k -= 4; di = BYTES2INT(bytes, k); if (di != 0) { d[i] = -di; firstNonzeroDigit = i; i++; while (k > highBytes) { k -= 4; d[i] = ~BYTES2INT(bytes, k); i++; } break; } else { d[i] = 0; i++; } } if (highBytes != 0) { di = -1; // Put the first bytes in the highest element of the int array if (firstNonzeroDigit != -2) { for (k = 0; k < highBytes; k++) { di = (di << 8) | (bytes[k] & 0xFF); } d[i] = ~di; } else { for (k = 0; k < highBytes; k++) { di = (di << 8) | (bytes[k] & 0xFF); } d[i] = -di; } } } }
extern "C" jbyteArray Java_java_math_NativeBN_BN_1bn2bin(JNIEnv* env, jclass, jlong a0) { if (!oneValidHandle(env, a0)) return NULL; BIGNUM* a = toBigNum(a0); jbyteArray result = env->NewByteArray(BN_num_bytes(a)); if (result == NULL) { return NULL; } ScopedByteArrayRW bytes(env, result); if (bytes.get() == NULL) { return NULL; } BN_bn2bin(a, reinterpret_cast<unsigned char*>(bytes.get())); return result; }
extern "C" void Java_java_math_NativeBN_putULongInt(JNIEnv* env, jclass, jlong a0, unsigned long long dw, jboolean neg) { if (!oneValidHandle(env, a0)) return; unsigned int hi = dw >> 32; // This shifts without sign extension. int lo = (int)dw; // This truncates implicitly. // cf. litEndInts2bn: BIGNUM* a = toBigNum(a0); bn_check_top(a); if (bn_wexpand(a, 2) != NULL) { a->d[0] = lo; a->d[1] = hi; a->top = 2; a->neg = neg; bn_correct_top(a); } else { throwExceptionIfNecessary(env); } }
extern "C" int Java_java_math_NativeBN_bitLength(JNIEnv* env, jclass, jlong a0) { // We rely on: (BN_BITS2 == 32), i.e. BN_ULONG is unsigned int and has 4 bytes: // if (!oneValidHandle(env, a0)) return JNI_FALSE; BIGNUM* a = toBigNum(a0); bn_check_top(a); int intLen = a->top; if (intLen == 0) return 0; BN_ULONG* d = a->d; int i = intLen - 1; BN_ULONG msd = d[i]; // most significant digit if (a->neg) { // Handle negative values correctly: // i.e. decrement the msd if all other digits are 0: // while ((i > 0) && (d[i] != 0)) { i--; } do { i--; } while (!((i < 0) || (d[i] != 0))); if (i < 0) msd--; // Only if all lower significant digits are 0 we decrement the most significant one. } return (intLen - 1) * 32 + BN_num_bits_word(msd); }
static void NativeBN_putULongInt(JNIEnv* env, jclass, jlong a0, jlong java_dw, jboolean neg) { if (!oneValidHandle(env, a0)) return; uint64_t dw = java_dw; // cf. litEndInts2bn: BIGNUM* a = toBigNum(a0); bn_check_top(a); if (bn_wexpand(a, 8/BN_BYTES) != NULL) { #ifdef __LP64__ a->d[0] = dw; #else unsigned int hi = dw >> 32; // This shifts without sign extension. int lo = (int)dw; // This truncates implicitly. a->d[0] = lo; a->d[1] = hi; #endif a->top = 8 / BN_BYTES; a->neg = neg; bn_correct_top(a); } else {
extern "C" long long Java_java_math_NativeBN_longInt(JNIEnv* env, jclass, jlong a0) { if (!oneValidHandle(env, a0)) return -1; BIGNUM* a = toBigNum(a0); bn_check_top(a); int intLen = a->top; BN_ULONG* d = a->d; switch (intLen) { case 0: return 0; case 1: if (!a->neg) { return d[0] & 0X00000000FFFFFFFFLL; } else { return -(d[0] & 0X00000000FFFFFFFFLL); } default: if (!a->neg) { return ((long long)d[1] << 32) | (d[0] & 0XFFFFFFFFLL); } else { return -(((long long)d[1] << 32) | (d[0] & 0XFFFFFFFFLL)); } } }
extern "C" jintArray Java_java_math_NativeBN_bn2litEndInts(JNIEnv* env, jclass, jlong a0) { if (!oneValidHandle(env, a0)) return NULL; BIGNUM* a = toBigNum(a0); bn_check_top(a); int len = a->top; if (len == 0) { return NULL; } jintArray result = env->NewIntArray(len); if (result == NULL) { return NULL; } ScopedIntArrayRW ints(env, result); if (ints.get() == NULL) { return NULL; } BN_ULONG* ulongs = reinterpret_cast<BN_ULONG*>(ints.get()); if (ulongs == NULL) { return NULL; } int i = len; do { i--; ulongs[i] = a->d[i]; } while (i > 0); return result; }
extern "C" void Java_java_math_NativeBN_twosComp2bn(JNIEnv* env, jclass cls, jbyteArray arr, int bytesLen, jlong ret0) { if (!oneValidHandle(env, ret0)) return; BIGNUM* ret = toBigNum(ret0); ScopedByteArrayRO bytes(env, arr); if (bytes.get() == NULL) { return; } const unsigned char* s = reinterpret_cast<const unsigned char*>(bytes.get()); if ((bytes[0] & 0X80) == 0) { // Positive value! // // We can use the existing BN implementation for unsigned big endian bytes: // BN_bin2bn(s, bytesLen, ret); BN_set_negative(ret, false); } else { // Negative value! // // We need to apply two's complement: // negBigEndianBytes2bn(env, cls, s, bytesLen, ret0); BN_set_negative(ret, true); } throwExceptionIfNecessary(env); }
extern "C" jboolean Java_java_math_NativeBN_BN_1is_1bit_1set(JNIEnv* env, jclass, jlong a, int n) { if (!oneValidHandle(env, a)) return JNI_FALSE; return BN_is_bit_set(toBigNum(a), n); }
static void NativeBN_BN_copy(JNIEnv* env, jclass, jlong to, jlong from) { if (!twoValidHandles(env, to, from)) return; BN_copy(toBigNum(to), toBigNum(from)); throwExceptionIfNecessary(env); }
extern "C" void Java_java_math_NativeBN_BN_1free(JNIEnv* env, jclass, jlong a) { if (!oneValidHandle(env, a)) return; BN_free(toBigNum(a)); }
extern "C" jboolean Java_java_math_NativeBN_BN_1is_1prime_1ex(JNIEnv* env, jclass, jlong p, int nchecks, jlong cb) { if (!oneValidHandle(env, p)) return JNI_FALSE; Unique_BN_CTX ctx(BN_CTX_new()); return BN_is_prime_ex(toBigNum(p), nchecks, ctx.get(), reinterpret_cast<BN_GENCB*>(cb)); }
extern "C" void Java_java_math_NativeBN_BN_1mod_1inverse(JNIEnv* env, jclass, jlong ret, jlong a, jlong n) { if (!threeValidHandles(env, ret, a, n)) return; Unique_BN_CTX ctx(BN_CTX_new()); BN_mod_inverse(toBigNum(ret), toBigNum(a), toBigNum(n), ctx.get()); throwExceptionIfNecessary(env); }
extern "C" void Java_java_math_NativeBN_BN_1mod_1exp(JNIEnv* env, jclass, jlong r, jlong a, jlong p, jlong m) { if (!fourValidHandles(env, r, a, p, m)) return; Unique_BN_CTX ctx(BN_CTX_new()); BN_mod_exp(toBigNum(r), toBigNum(a), toBigNum(p), toBigNum(m), ctx.get()); throwExceptionIfNecessary(env); }
extern "C" void Java_java_math_NativeBN_BN_1div(JNIEnv* env, jclass, jlong dv, jlong rem, jlong m, jlong d) { if (!fourValidHandles(env, (rem ? rem : dv), (dv ? dv : rem), m, d)) return; Unique_BN_CTX ctx(BN_CTX_new()); BN_div(toBigNum(dv), toBigNum(rem), toBigNum(m), toBigNum(d), ctx.get()); throwExceptionIfNecessary(env); }
extern "C" void Java_java_math_NativeBN_BN_1mul(JNIEnv* env, jclass, jlong r, jlong a, jlong b) { if (!threeValidHandles(env, r, a, b)) return; Unique_BN_CTX ctx(BN_CTX_new()); BN_mul(toBigNum(r), toBigNum(a), toBigNum(b), ctx.get()); throwExceptionIfNecessary(env); }
extern "C" void Java_java_math_NativeBN_BN_1sub(JNIEnv* env, jclass, jlong r, jlong a, jlong b) { if (!threeValidHandles(env, r, a, b)) return; BN_sub(toBigNum(r), toBigNum(a), toBigNum(b)); throwExceptionIfNecessary(env); }
extern "C" BN_ULONG Java_java_math_NativeBN_BN_1mod_1word(JNIEnv* env, jclass, jlong a, BN_ULONG w) { if (!oneValidHandle(env, a)) return 0; int result = BN_mod_word(toBigNum(a), w); throwExceptionIfNecessary(env); return result; }
extern "C" void Java_java_math_NativeBN_BN_1mul_1word(JNIEnv* env, jclass, jlong a, BN_ULONG w) { if (!oneValidHandle(env, a)) return; BN_mul_word(toBigNum(a), w); throwExceptionIfNecessary(env); }
static void NativeBN_BN_free(JNIEnv* env, jclass, jlong a) { if (!oneValidHandle(env, a)) return; BN_free(toBigNum(a)); }
extern "C" void Java_java_math_NativeBN_BN_1set_1negative(JNIEnv* env, jclass, jlong b, int n) { if (!oneValidHandle(env, b)) return; BN_set_negative(toBigNum(b), n); }
static int NativeBN_BN_cmp(JNIEnv* env, jclass, jlong a, jlong b) { if (!twoValidHandles(env, a, b)) return 1; return BN_cmp(toBigNum(a), toBigNum(b)); }
extern "C" void Java_java_math_NativeBN_BN_1copy(JNIEnv* env, jclass, jlong to, jlong from) { if (!twoValidHandles(env, to, from)) return; BN_copy(toBigNum(to), toBigNum(from)); throwExceptionIfNecessary(env); }