HomeSort by relevance Sort by last modified time
    Searched refs:bignum (Results 1 - 18 of 18) sorted by null

  /external/wpa_supplicant/
bignum.h 18 struct bignum;
20 struct bignum * bignum_init(void);
21 void bignum_deinit(struct bignum *n);
22 size_t bignum_get_unsigned_bin_len(struct bignum *n);
23 int bignum_get_unsigned_bin(const struct bignum *n, u8 *buf, size_t *len);
24 int bignum_set_unsigned_bin(struct bignum *n, const u8 *buf, size_t len);
25 int bignum_cmp(const struct bignum *a, const struct bignum *b);
26 int bignum_cmp_d(const struct bignum *a, unsigned long b);
27 int bignum_add(const struct bignum *a, const struct bignum *b
    [all...]
bignum.c 18 #include "bignum.h"
29 * struct bignum is just typecast to mp_int.
33 * bignum_init - Allocate memory for bignum
34 * Returns: Pointer to allocated bignum or %NULL on failure
36 struct bignum * bignum_init(void)
38 struct bignum *n = os_zalloc(sizeof(mp_int));
50 * bignum_deinit - Free bignum
51 * @n: Bignum from bignum_init()
53 void bignum_deinit(struct bignum *n)
63 * bignum_get_unsigned_bin - Get length of bignum as an unsigned binary buffe
    [all...]
rsa.c 20 #include "bignum.h"
26 struct bignum *n; /* modulus (p * q) */
27 struct bignum *e; /* public exponent */
29 struct bignum *d; /* private exponent */
30 struct bignum *p; /* prime p (factor of n) */
31 struct bignum *q; /* prime q (factor of n) */
32 struct bignum *dmp1; /* d mod (p - 1); CRT exponent */
33 struct bignum *dmq1; /* d mod (q - 1); CRT exponent */
34 struct bignum *iqmp; /* 1 / q mod p; CRT coefficient */
39 struct bignum *num
    [all...]
Makefile 580 OBJS += crypto_internal.o rsa.o bignum.o
581 OBJS_p += crypto_internal.o rsa.o bignum.o
791 bignum.o rsa.o
800 bignum.o rsa.o
Android.mk 500 OBJS += crypto_internal.c rsa.c bignum.c
501 OBJS_p += crypto_internal.c rsa.c bignum.c
crypto_internal.c 24 #include "bignum.h"
635 struct bignum *bn_base, *bn_exp, *bn_modulus, *bn_result;
  /external/wpa_supplicant_6/wpa_supplicant/src/tls/
bignum.h 18 struct bignum;
20 struct bignum * bignum_init(void);
21 void bignum_deinit(struct bignum *n);
22 size_t bignum_get_unsigned_bin_len(struct bignum *n);
23 int bignum_get_unsigned_bin(const struct bignum *n, u8 *buf, size_t *len);
24 int bignum_set_unsigned_bin(struct bignum *n, const u8 *buf, size_t len);
25 int bignum_cmp(const struct bignum *a, const struct bignum *b);
26 int bignum_cmp_d(const struct bignum *a, unsigned long b);
27 int bignum_add(const struct bignum *a, const struct bignum *b
    [all...]
bignum.c 18 #include "bignum.h"
29 * struct bignum is just typecast to mp_int.
33 * bignum_init - Allocate memory for bignum
34 * Returns: Pointer to allocated bignum or %NULL on failure
36 struct bignum * bignum_init(void)
38 struct bignum *n = os_zalloc(sizeof(mp_int));
50 * bignum_deinit - Free bignum
51 * @n: Bignum from bignum_init()
53 void bignum_deinit(struct bignum *n)
63 * bignum_get_unsigned_bin - Get length of bignum as an unsigned binary buffe
    [all...]
rsa.c 20 #include "bignum.h"
26 struct bignum *n; /* modulus (p * q) */
27 struct bignum *e; /* public exponent */
29 struct bignum *d; /* private exponent */
30 struct bignum *p; /* prime p (factor of n) */
31 struct bignum *q; /* prime q (factor of n) */
32 struct bignum *dmp1; /* d mod (p - 1); CRT exponent */
33 struct bignum *dmq1; /* d mod (q - 1); CRT exponent */
34 struct bignum *iqmp; /* 1 / q mod p; CRT coefficient */
40 struct bignum *num
    [all...]
  /dalvik/libcore/math/src/main/java/java/math/
BigInt.java 58 transient int bignum = 0; field in class:BigInt
62 if (this.bignum != 0) {
63 NativeBN.BN_free(this.bignum);
64 this.bignum = 0;
79 return this.bignum;
117 if (this.bignum == 0) {
118 this.bignum = NativeBN.BN_new();
119 Check(this.bignum != 0);
125 bi.bignum = NativeBN.BN_new();
126 Check(bi.bignum != 0)
    [all...]
  /external/v8/test/mjsunit/
toint32.js 117 // bignum is (2^53 - 1) * 2^31 - highest number with bit 31 set.
118 var bignum = Math.pow(2, 84) - Math.pow(2, 31); variable
119 assertEquals(-Math.pow(2,31), toInt32(bignum));
120 assertEquals(-Math.pow(2,31), toInt32(-bignum));
121 assertEquals(0, toInt32(2 * bignum));
122 assertEquals(0, toInt32(-(2 * bignum)));
123 assertEquals(0, toInt32(bignum - Math.pow(2,31)));
124 assertEquals(0, toInt32(-(bignum - Math.pow(2,31))));
  /external/dropbear/
Android.mk 8 dss.c bignum.c \
  /external/wpa_supplicant_6/wpa_supplicant/
Makefile 791 OBJS += ../src/crypto/crypto_internal.o ../src/tls/bignum.o
792 OBJS_p += ../src/crypto/crypto_internal.o ../src/tls/bignum.o
1114 ../src/crypto/aes.o ../src/tls/bignum.o ../src/tls/rsa.o
1124 ../src/tls/bignum.o ../src/tls/rsa.o
Android.mk 814 OBJS += src/crypto/crypto_internal.c src/tls/bignum.c
815 OBJS_p += src/crypto/crypto_internal.c src/tls/bignum.c
  /external/wpa_supplicant_6/wpa_supplicant/src/crypto/
crypto_internal.c 24 #include "tls/bignum.h"
444 struct bignum *zero;
803 struct bignum *bn_base, *bn_exp, *bn_modulus, *bn_result;
  /dalvik/libcore/x-net/src/main/native/
org_apache_harmony_xnet_provider_jsse_NativeCrypto.cpp 83 * Converts a Java byte[] to an OpenSSL BIGNUM, allocating the BIGNUM on the
86 static BIGNUM* arrayToBignum(JNIEnv* env, jbyteArray source) {
91 BIGNUM* bignum = BN_bin2bn((unsigned char*) sourceBytes, sourceLength, NULL); local
93 return bignum;
115 jniThrowRuntimeException(env, "Unable to convert BigInteger to BIGNUM");
153 jniThrowRuntimeException(env, "Unable to convert BigInteger to BIGNUM");
    [all...]
  /external/dropbear/libtomcrypt/
crypt.tex 146 With this library all core functions (ciphers, hashes, prngs, and bignum) have the same prototype definition. They all load
151 application can support all ciphers/hashes/prngs/bignum without changing the source code.
166 pseudo--random number generators (PRNG), and bignum math routines are all used within the API through \textit{descriptor} tables which
    [all...]
  /external/dropbear/libtommath/
bn.tex 80 to implement ``bignum'' math. However, the resulting code has proven to be very useful. It has been used by numerous
248 source code is also accessible for computer science students attempting to learn ``BigNum'' or multiple precision
    [all...]

Completed in 631 milliseconds