| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| D | 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,
28 struct bignum *c);
[all …]
|
| D | bignum.c | 36 struct bignum * bignum_init(void) in bignum_init()
38 struct bignum *n = os_zalloc(sizeof(mp_int)); in bignum_init()
53 void bignum_deinit(struct bignum *n) in bignum_deinit()
67 size_t bignum_get_unsigned_bin_len(struct bignum *n) in bignum_get_unsigned_bin_len()
81 int bignum_get_unsigned_bin(const struct bignum *n, u8 *buf, size_t *len) in bignum_get_unsigned_bin()
105 int bignum_set_unsigned_bin(struct bignum *n, const u8 *buf, size_t len) in bignum_set_unsigned_bin()
121 int bignum_cmp(const struct bignum *a, const struct bignum *b) in bignum_cmp()
133 int bignum_cmp_d(const struct bignum *a, unsigned long b) in bignum_cmp_d()
146 int bignum_add(const struct bignum *a, const struct bignum *b, in bignum_add()
147 struct bignum *c) in bignum_add()
[all …]
|
| D | rsa.c | 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) in crypto_rsa_parse_integer()
137 struct bignum *zero; in crypto_rsa_import_private_key()
[all …]
|
| /external/wpa_supplicant/ |
| D | 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,
28 struct bignum *c);
[all …]
|
| D | bignum.c | 36 struct bignum * bignum_init(void) in bignum_init()
38 struct bignum *n = os_zalloc(sizeof(mp_int)); in bignum_init()
53 void bignum_deinit(struct bignum *n) in bignum_deinit()
67 size_t bignum_get_unsigned_bin_len(struct bignum *n) in bignum_get_unsigned_bin_len()
81 int bignum_get_unsigned_bin(const struct bignum *n, u8 *buf, size_t *len) in bignum_get_unsigned_bin()
105 int bignum_set_unsigned_bin(struct bignum *n, const u8 *buf, size_t len) in bignum_set_unsigned_bin()
121 int bignum_cmp(const struct bignum *a, const struct bignum *b) in bignum_cmp()
133 int bignum_cmp_d(const struct bignum *a, unsigned long b) in bignum_cmp_d()
146 int bignum_add(const struct bignum *a, const struct bignum *b, in bignum_add()
147 struct bignum *c) in bignum_add()
[all …]
|
| D | rsa.c | 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) in crypto_rsa_parse_integer()
136 struct bignum *zero; in crypto_rsa_import_private_key()
[all …]
|
| D | 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
|
| D | Android.mk | 500 OBJS += crypto_internal.c rsa.c bignum.c
501 OBJS_p += crypto_internal.c rsa.c bignum.c
|
| D | crypto_internal.c | 635 struct bignum *bn_base, *bn_exp, *bn_modulus, *bn_result; in crypto_mod_exp()
|
| D | README | 118 - bignum
120 TLSv1/X.509/ASN.1/RSA/bignum parts are about 25 kB on x86)
|
| D | ChangeLog | 102 needed X.509/ASN.1/RSA/bignum processing (this can be enabled by
|
| /external/v8/test/mjsunit/ |
| D | toint32.js | 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/ |
| D | filelist.txt | 106 bignum.c Some bignum helper functions
|
| D | Makefile.in | 20 dss.o bignum.o \
46 dss.h bignum.h signkey.h rsa.h random.h service.h auth.h \
|
| D | Android.mk | 8 dss.c bignum.c \
|
| D | CHANGES | 135 - Rearranged bignum reading/random generation code
401 - Avoid including bignum functions which don't give much speed benefit but
539 - Various cleanups to bignum code
|
| /external/dropbear/libtomcrypt/notes/ |
| D | tech0002.txt | 14 uses the MPI bignum library to perform the operation. The time it takes to compute y is controlled…
|
| /external/wpa_supplicant_6/wpa_supplicant/src/crypto/ |
| D | crypto_internal.c | 444 struct bignum *zero; in crypto_pkcs8_key_import()
803 struct bignum *bn_base, *bn_exp, *bn_modulus, *bn_result; in crypto_mod_exp()
|
| /external/wpa_supplicant_6/wpa_supplicant/ |
| D | 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
|
| D | 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
|
| D | README | 119 - bignum
121 TLSv1/X.509/ASN.1/RSA/bignum parts are about 25 kB on x86)
|
| /external/openssl/crypto/engine/ |
| D | README | 197 What else? The bignum callbacks and associated ENGINE functions have been
201 application code to automatically hook and use ENGINE supplied bignum functions
|
| /external/dropbear/libtomcrypt/ |
| D | changes | 204 …l *_make_key() and *_import() which will help catch newbs who don't register their bignum first :-)
297 …T_INTEGER so users can easily store DER encoded INTEGER types without using the bignum math library
458 -- Added DER for bignum support
880 …so they export as "unsigned" types saving 1 byte per bignum outputted. Not a lot but heck why not.
903 …step and the "rand_prime" function uses a modified sieve that avoids alot of un-needed bignum work.
1334 … -- Memory leaks found and correct in all three PK routines. The leaks would occur when a bignum
1341 … -- ***HUGE*** changes in the PK code. I check all return values in the bignum code so if there
1454 v0.12 -- Imported a new version of MPI [the bignum library] that should
1455 be a bit more stable [if you want to write your own bignum
|
| D | crypt.tex | 146 With this library all core functions (ciphers, hashes, prngs, and bignum) have the same prototype d…
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 throu…
3292 This will load the bignum from \textit{in} as a big endian integer in the format PKCS \#1 specifies…
4443 These will encode or decode a signed INTEGER data type using the bignum data type to store the larg…
4444 a bignum to store the value, the \textit{short} INTEGER functions were made available.
4949 need a PRNG can instantly take advantage of it. The same applies for ciphers, hashes, and bignum m…
5346 …nd at the low level. That is you can swap out any cipher, hash, PRNG or bignum library and the de…
5356 …required work. For a given class of operation (e.g. cipher, hash, prng, bignum) the functions of …
5965 The library also makes use of the math descriptors to access math functions. While bignum math lib…
[all …]
|
| /external/dropbear/libtommath/ |
| D | bn.tex | 80 to implement ``bignum'' math. However, the resulting code has proven to be very useful. It has be…
1090 While AND, OR and XOR operations are not typical ``bignum functions'' they can be useful in several…
|