Home
last modified time | relevance | path

Searched refs:P521_WIDTH (Results 1 - 2 of 2) sorted by relevance

/third_party/mbedtls/library/
H A Decp_curves.c5137 #define P521_WIDTH (521 / 8 / sizeof(mbedtls_mpi_uint) + 1) macro
5151 mbedtls_mpi_uint Mp[P521_WIDTH + 1]; in ecp_mod_p521()
5154 * P521_WIDTH + 1. Otherwise P521_WIDTH is enough. */ in ecp_mod_p521()
5156 if (N->n < P521_WIDTH) { in ecp_mod_p521()
5162 M.n = N->n - (P521_WIDTH - 1); in ecp_mod_p521()
5163 if (M.n > P521_WIDTH + 1) { in ecp_mod_p521()
5164 M.n = P521_WIDTH + 1; in ecp_mod_p521()
5167 memcpy(Mp, N->p + P521_WIDTH - 1, M.n * sizeof(mbedtls_mpi_uint)); in ecp_mod_p521()
5171 N->p[P521_WIDTH in ecp_mod_p521()
5183 #undef P521_WIDTH global() macro
[all...]
H A Decp_curves_new.c5313 #define P521_WIDTH (521 / 8 / sizeof(mbedtls_mpi_uint) + 1) macro
5340 /* Step 1: Reduction to P521_WIDTH limbs */ in mbedtls_ecp_mod_p521_raw()
5343 size_t X0_limbs = P521_WIDTH; in mbedtls_ecp_mod_p521_raw()
5347 /* Split X as X0 + 2^P521_WIDTH X1 and compute X0 + 2^(biL - 9) X1. in mbedtls_ecp_mod_p521_raw()
5348 * (We are using that 2^P521_WIDTH = 2^(512 + biL) and that in mbedtls_ecp_mod_p521_raw()
5352 * 2^P521_WIDTH carry + X0). in mbedtls_ecp_mod_p521_raw()
5355 * X0 < 2^P521_WIDTH = 2^(512 + biL) and X1 < 2^(P521_WIDTH-biL) = 2^512 in mbedtls_ecp_mod_p521_raw()
5367 * At this point X is reduced to P521_WIDTH limbs. What remains is to add in mbedtls_ecp_mod_p521_raw()
5368 * the carry (that is 2^P521_WIDTH carr in mbedtls_ecp_mod_p521_raw()
5391 #undef P521_WIDTH global() macro
[all...]

Completed in 21 milliseconds