Home
last modified time | relevance | path

Searched refs:nbits (Results 1 – 18 of 18) sorted by relevance

/optee_os/lib/libutils/ext/include/
H A Dbitstring.h52 #define bitstr_size(nbits) \ argument
53 (((nbits) + 7) >> 3)
56 #define bit_alloc(nbits) \ argument
57 (bitstr_t *)calloc((size_t)bitstr_size(nbits), sizeof(bitstr_t))
60 #define bit_decl(name, nbits) \ argument
61 ((name)[bitstr_size(nbits)])
110 #define bit_ffc(name, nbits, value) do { \ argument
112 register int _byte, _nbits = (nbits); \
123 if (_value >= nbits) \
129 #define bit_ffs_from(name, nbits, startbit, value) do { \ argument
[all …]
/optee_os/core/lib/libtomcrypt/src/pk/asn1/der/bit/
H A Dder_length_bit_string.c17 int der_length_bit_string(unsigned long nbits, unsigned long *outlen) in der_length_bit_string() argument
25 nbytes = (nbits >> 3) + ((nbits & 7) ? 1 : 0) + 1; in der_length_bit_string()
/optee_os/core/tee/
H A Dfs_dirfile.c17 int nbits; member
58 if (idx < dirh->nbits) in maybe_grow_files()
66 bit_nclear(dirh->files, dirh->nbits, idx); in maybe_grow_files()
67 dirh->nbits = idx + 1; in maybe_grow_files()
84 if (idx < dirh->nbits) in clear_file()
90 if (idx < dirh->nbits) in test_file()
198 if (dirh->nbits) { in tee_fs_dirfile_get_tmp()
199 bit_ffc(dirh->files, dirh->nbits, &i); in tee_fs_dirfile_get_tmp()
201 i = dirh->nbits; in tee_fs_dirfile_get_tmp()
H A Dtadb.c33 int nbits; member
147 if (idx < db->nbits) in maybe_grow_files()
155 bit_nclear(db->files, db->nbits, idx); in maybe_grow_files()
156 db->nbits = idx + 1; in maybe_grow_files()
177 if (idx < db->nbits) in clear_file()
187 if (idx < db->nbits) in test_file()
322 if (db->nbits) in populate_files()
367 db->nbits = 0; in populate_files()
401 bit_ffc(ta->db->files, ta->db->nbits, &i); in tee_tadb_ta_create()
403 i = ta->db->nbits; in tee_tadb_ta_create()
/optee_os/lib/libmbedtls/mbedtls/library/
H A Dbignum.c2305 int mbedtls_mpi_gen_prime(mbedtls_mpi *X, size_t nbits, int flags, in mbedtls_mpi_gen_prime() argument
2322 if (nbits < 3 || nbits > MBEDTLS_MPI_MAX_BITS) { in mbedtls_mpi_gen_prime()
2328 n = BITS_TO_LIMBS(nbits); in mbedtls_mpi_gen_prime()
2334 rounds = ((nbits >= 1300) ? 2 : (nbits >= 850) ? 3 : in mbedtls_mpi_gen_prime()
2335 (nbits >= 650) ? 4 : (nbits >= 350) ? 8 : in mbedtls_mpi_gen_prime()
2336 (nbits >= 250) ? 12 : (nbits >= 150) ? 18 : 27); in mbedtls_mpi_gen_prime()
2342 rounds = ((nbits >= 1450) ? 4 : (nbits >= 1150) ? 5 : in mbedtls_mpi_gen_prime()
2343 (nbits >= 1000) ? 6 : (nbits >= 850) ? 7 : in mbedtls_mpi_gen_prime()
2344 (nbits >= 750) ? 8 : (nbits >= 500) ? 13 : in mbedtls_mpi_gen_prime()
2345 (nbits >= 250) ? 28 : (nbits >= 150) ? 40 : 51); in mbedtls_mpi_gen_prime()
[all …]
H A Decdsa.c207 size_t n_size = (grp->nbits + 7) / 8; in derive_mpi()
211 if (use_size * 8 > grp->nbits) { in derive_mpi()
212 MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(x, use_size * 8 - grp->nbits)); in derive_mpi()
409 size_t grp_len = (grp->nbits + 7) / 8; in mbedtls_ecdsa_sign_det_restartable()
H A Decp.c525 grp->nbits = 0; in mbedtls_ecp_group_init()
2248 w = grp->nbits >= 384 ? 5 : 4; in ecp_pick_window_size()
2273 if (w >= grp->nbits) { in ecp_pick_window_size()
2318 d = (grp->nbits + w - 1) / w; in ecp_mul_comb()
2584 i = grp->nbits + 1; /* one past the (zero-based) required msb for private keys */ in ecp_mul_mxz()
3013 if (mbedtls_mpi_size(&pt->X) > (grp->nbits + 7) / 8) { in ecp_check_pubkey_mx()
3063 mbedtls_mpi_bitlen(d) != grp->nbits + 1) { /* mbedtls_mpi_bitlen is one-based! */ in mbedtls_ecp_check_privkey()
3068 if (grp->nbits == 254 && mbedtls_mpi_get_bit(d, 2) != 0) { in mbedtls_ecp_check_privkey()
3148 return mbedtls_ecp_gen_privkey_mx(grp->nbits, d, f_rng, p_rng); in mbedtls_ecp_gen_privkey()
3345 size_t len = (key->grp.nbits + 7) / 8; in mbedtls_ecp_write_key_ext()
[all …]
H A Dpsa_crypto_ecp.c230 *bits = ecp->grp.nbits + 1; in mbedtls_psa_ecp_import_key()
232 *bits = ecp->grp.nbits; in mbedtls_psa_ecp_import_key()
H A Drsa.c1049 unsigned int nbits, int exponent) in mbedtls_rsa_gen_key() argument
1060 if (nbits > 1024) { in mbedtls_rsa_gen_key()
1068 if (exponent < 3 || nbits % 2 != 0) { in mbedtls_rsa_gen_key()
1073 if (nbits < MBEDTLS_RSA_GEN_KEY_MIN_BITS) { in mbedtls_rsa_gen_key()
1087 MBEDTLS_MPI_CHK(mbedtls_mpi_gen_prime(&ctx->P, nbits >> 1, in mbedtls_rsa_gen_key()
1090 MBEDTLS_MPI_CHK(mbedtls_mpi_gen_prime(&ctx->Q, nbits >> 1, in mbedtls_rsa_gen_key()
1095 if (mbedtls_mpi_bitlen(&H) <= ((nbits >= 200) ? ((nbits >> 1) - 99) : 0)) { in mbedtls_rsa_gen_key()
1120 … if (mbedtls_mpi_bitlen(&ctx->D) <= ((nbits + 1) / 2)) { // (FIPS 186-4 §B.3.1 criterion 3(a)) in mbedtls_rsa_gen_key()
H A Dpkparse.c247 grp->nbits = mbedtls_mpi_bitlen(&grp->N); in pk_group_from_specified()
274 if (grp->pbits == ref.pbits && grp->nbits == ref.nbits && in pk_group_id_from_group()
H A Decp_curves.c4577 grp->nbits = mbedtls_mpi_bitlen(&grp->N); in ecp_group_load()
4689 grp->nbits = 254; in ecp_use_curve25519()
4744 grp->nbits = 447; in ecp_use_curve448()
H A Decp_curves_new.c4545 grp->nbits = mbedtls_mpi_bitlen(&grp->N); in ecp_group_load()
4684 grp->nbits = 254; in ecp_use_curve25519()
4745 grp->nbits = 447; in ecp_use_curve448()
H A Dpsa_crypto.c4035 operation->ctx->grp.nbits); in mbedtls_psa_sign_hash_start()
4256 coordinate_bytes = PSA_BITS_TO_BYTES(operation->ctx->grp.nbits); in mbedtls_psa_verify_hash_start()
6413 m = ecp_group.nbits; in psa_generate_derived_ecc_key_weierstrass_helper()
/optee_os/lib/libmbedtls/mbedtls/include/mbedtls/
H A Drsa.h470 unsigned int nbits, int exponent);
H A Dbignum.h1072 int mbedtls_mpi_gen_prime(mbedtls_mpi *X, size_t nbits, int flags,
H A Decp.h248 size_t nbits; /*!< For Short Weierstrass: The number of bits in \p P. member
/optee_os/core/lib/libtomcrypt/src/headers/
H A Dtomcrypt_pk.h693 int der_length_bit_string(unsigned long nbits, unsigned long *outlen);
/optee_os/lib/libmbedtls/mbedtls/
H A DChangeLog6385 * Updated rsa_gen_key() so that ctx->N is always nbits in size