Based on Nekogram. Key additions: - Rebrand to FoxiGram (app name, APK name, applicationId com.foxigram.app) - Embedded Xray (VLESS+Reality) proxy client via JNI libxray.so - Bundled hidden one-tap proxies (LTE + WiFi), read-only in UI - Auto-restore proxy on restart, rebind to active network (LTE/WiFi) - Server credentials externalized to git-ignored XrayServers.java (+ template) - libxray Go source included; compiled .so, keystore, google-services.json ignored
184 lines
4.3 KiB
C++
184 lines
4.3 KiB
C++
// Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
|
|
//
|
|
// 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
|
|
//
|
|
// https://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.
|
|
|
|
#include <openssl/bn.h>
|
|
|
|
#include <assert.h>
|
|
|
|
#include <openssl/err.h>
|
|
|
|
#include "../fipsmodule/bn/internal.h"
|
|
|
|
|
|
int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) {
|
|
bssl::BN_CTXScope scope(ctx);
|
|
BIGNUM *rr;
|
|
if (r == a || r == p) {
|
|
rr = BN_CTX_get(ctx);
|
|
} else {
|
|
rr = r;
|
|
}
|
|
|
|
BIGNUM *v = BN_CTX_get(ctx);
|
|
if (rr == NULL || v == NULL) {
|
|
return 0;
|
|
}
|
|
|
|
if (BN_copy(v, a) == NULL) {
|
|
return 0;
|
|
}
|
|
int bits = BN_num_bits(p);
|
|
|
|
if (BN_is_odd(p)) {
|
|
if (BN_copy(rr, a) == NULL) {
|
|
return 0;
|
|
}
|
|
} else {
|
|
if (!BN_one(rr)) {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
for (int i = 1; i < bits; i++) {
|
|
if (!BN_sqr(v, v, ctx)) {
|
|
return 0;
|
|
}
|
|
if (BN_is_bit_set(p, i)) {
|
|
if (!BN_mul(rr, rr, v, ctx)) {
|
|
return 0;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (r != rr && !BN_copy(r, rr)) {
|
|
return 0;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
static int mod_exp_even(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
|
|
const BIGNUM *m, BN_CTX *ctx) {
|
|
// No cryptographic operations require modular exponentiation with an even
|
|
// modulus. We support it for backwards compatibility with any applications
|
|
// that may have relied on the operation, but optimize for simplicity over
|
|
// performance with straightforward square-and-multiply routine.
|
|
int bits = BN_num_bits(p);
|
|
if (bits == 0) {
|
|
return BN_one(r);
|
|
}
|
|
|
|
// Make a copy of |a|, in case it aliases |r|.
|
|
bssl::BN_CTXScope scope(ctx);
|
|
BIGNUM *tmp = BN_CTX_get(ctx);
|
|
if (tmp == nullptr || !BN_copy(tmp, a)) {
|
|
return 0;
|
|
}
|
|
|
|
assert(BN_is_bit_set(p, bits - 1));
|
|
if (!BN_copy(r, tmp)) {
|
|
return 0;
|
|
}
|
|
|
|
for (int i = bits - 2; i >= 0; i--) {
|
|
if (!BN_mod_sqr(r, r, m, ctx) ||
|
|
(BN_is_bit_set(p, i) && !BN_mod_mul(r, r, tmp, m, ctx))) {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
|
|
BN_CTX *ctx) {
|
|
if (m->neg) {
|
|
OPENSSL_PUT_ERROR(BN, BN_R_NEGATIVE_NUMBER);
|
|
return 0;
|
|
}
|
|
if (a->neg || BN_ucmp(a, m) >= 0) {
|
|
if (!BN_nnmod(r, a, m, ctx)) {
|
|
return 0;
|
|
}
|
|
a = r;
|
|
}
|
|
|
|
if (BN_is_odd(m)) {
|
|
return BN_mod_exp_mont(r, a, p, m, ctx, NULL);
|
|
}
|
|
|
|
return mod_exp_even(r, a, p, m, ctx);
|
|
}
|
|
|
|
int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
|
|
const BIGNUM *m, BN_CTX *ctx,
|
|
const BN_MONT_CTX *mont) {
|
|
BIGNUM a_bignum;
|
|
BN_init(&a_bignum);
|
|
|
|
int ret = 0;
|
|
|
|
// BN_mod_exp_mont requires reduced inputs.
|
|
if (bn_minimal_width(m) == 1) {
|
|
a %= m->d[0];
|
|
}
|
|
|
|
if (!BN_set_word(&a_bignum, a)) {
|
|
OPENSSL_PUT_ERROR(BN, ERR_R_INTERNAL_ERROR);
|
|
goto err;
|
|
}
|
|
|
|
ret = BN_mod_exp_mont(rr, &a_bignum, p, m, ctx, mont);
|
|
|
|
err:
|
|
BN_free(&a_bignum);
|
|
|
|
return ret;
|
|
}
|
|
|
|
int BN_mod_exp2_mont(BIGNUM *rr, const BIGNUM *a1, const BIGNUM *p1,
|
|
const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
|
|
BN_CTX *ctx, const BN_MONT_CTX *mont) {
|
|
BIGNUM tmp;
|
|
BN_init(&tmp);
|
|
|
|
int ret = 0;
|
|
BN_MONT_CTX *new_mont = NULL;
|
|
|
|
// Allocate a montgomery context if it was not supplied by the caller.
|
|
if (mont == NULL) {
|
|
new_mont = BN_MONT_CTX_new_for_modulus(m, ctx);
|
|
if (new_mont == NULL) {
|
|
goto err;
|
|
}
|
|
mont = new_mont;
|
|
}
|
|
|
|
// BN_mod_mul_montgomery removes one Montgomery factor, so passing one
|
|
// Montgomery-encoded and one non-Montgomery-encoded value gives a
|
|
// non-Montgomery-encoded result.
|
|
if (!BN_mod_exp_mont(rr, a1, p1, m, ctx, mont) ||
|
|
!BN_mod_exp_mont(&tmp, a2, p2, m, ctx, mont) ||
|
|
!BN_to_montgomery(rr, rr, mont, ctx) ||
|
|
!BN_mod_mul_montgomery(rr, rr, &tmp, mont, ctx)) {
|
|
goto err;
|
|
}
|
|
|
|
ret = 1;
|
|
|
|
err:
|
|
BN_MONT_CTX_free(new_mont);
|
|
BN_free(&tmp);
|
|
|
|
return ret;
|
|
}
|