Home
last modified time | relevance | path

Searched refs:mod (Results 1 – 19 of 19) sorted by relevance

/mbedtls-latest/tests/suites/
Dtest_suite_bignum_mod_raw.generated.data3 mbedtls_mpi_mod_raw_add #1 0 + 0 mod 53
6 mbedtls_mpi_mod_raw_add #2 0 + 1 mod 53
9 mbedtls_mpi_mod_raw_add #3 0 + 2 mod 53
12 mbedtls_mpi_mod_raw_add #4 0 + 3 mod 53
15 mbedtls_mpi_mod_raw_add #5 0 + 4 mod 53
18 mbedtls_mpi_mod_raw_add #6 0 + 38 mod 53
21 mbedtls_mpi_mod_raw_add #14 1 + 0 mod 53
24 mbedtls_mpi_mod_raw_add #15 1 + 1 mod 53
27 mbedtls_mpi_mod_raw_add #16 1 + 2 mod 53
30 mbedtls_mpi_mod_raw_add #17 1 + 3 mod 53
[all …]
Dtest_suite_bignum_mod.generated.data3 mbedtls_mpi_mod_add #1 0 + 0 mod 53
6 mbedtls_mpi_mod_add #2 0 + 1 mod 53
9 mbedtls_mpi_mod_add #3 0 + 2 mod 53
12 mbedtls_mpi_mod_add #4 0 + 3 mod 53
15 mbedtls_mpi_mod_add #5 0 + 4 mod 53
18 mbedtls_mpi_mod_add #6 0 + 38 mod 53
21 mbedtls_mpi_mod_add #14 1 + 0 mod 53
24 mbedtls_mpi_mod_add #15 1 + 1 mod 53
27 mbedtls_mpi_mod_add #16 1 + 2 mod 53
30 mbedtls_mpi_mod_add #17 1 + 3 mod 53
[all …]
Dtest_suite_ecp.generated.data3 ecp_mod_p192k1_raw #1 - 0 mod fffffffffffffffffffffffffffffffffffffffeffffee37
7 ecp_mod_p192k1_raw #2 - 1 mod fffffffffffffffffffffffffffffffffffffffeffffee37
11 ecp_mod_p192k1_raw #3 - fffffffffffffffffffffffffffffffffffffffeffffee36 mod ffffffffffffffffffffff…
15 ecp_mod_p192k1_raw #4 - fffffffffffffffffffffffffffffffffffffffeffffee38 mod ffffffffffffffffffffff…
19 ecp_mod_p192k1_raw #5 - ffffffffffffffffffffffffffffffffffffffffffffffff mod ffffffffffffffffffffff…
23 …fffffffffffffffffdffffdc6c0000000000000000000000000000000100002394013c7364 mod fffffffffffffffffff…
27 …d832cfd5e04d9d2dbb9f8da2170000000000000000000000000000000000000000520834f0 mod fffffffffffffffffff…
31 …44d5e341245c6e433715ba2bdd177219d30e7a269fd95bafc8f2a4d27bdcf4bb99f4bea973 mod fffffffffffffffffff…
35 …7594c9c9500925e4749b575bd13653f8dd9b1f282e4067c3584ee207f8da94e3e8ab73738f mod fffffffffffffffffff…
39 …ebf30b94fa82523e86feac7eb7dc38f519b91751dacdbd47d364be8049a372db8f6e405d93 mod fffffffffffffffffff…
[all …]
Dtest_suite_bignum_random.data28 MPI random mod=core: 2^28-1..2^28+1 (NOT_ACCEPTABLE) (Mont)
31 MPI random mod=core: 2^28-1..2^28+1 (NOT_ACCEPTABLE) (canon)
40 MPI random mod=core: 2^29-1..2^29+1 (NOT_ACCEPTABLE) (Mont)
43 MPI random mod=core: 2^29-1..2^29+1 (NOT_ACCEPTABLE) (canon)
52 MPI random mod=core: 2^30-1..2^30+1 (NOT_ACCEPTABLE) (Mont)
55 MPI random mod=core: 2^30-1..2^30+1 (NOT_ACCEPTABLE) (canon)
64 MPI random mod=core: 2^31-1..2^31+1 (NOT_ACCEPTABLE) (Mont)
67 MPI random mod=core: 2^31-1..2^31+1 (NOT_ACCEPTABLE) (canon)
261 MPI random mod=core: 0..1 (Mont)
264 MPI random mod=core: 0..1 (canon)
[all …]
Dtest_suite_bignum_core.generated.data9356 Core modular exponentiation (Mongtomery form only) #1 0 ^ 0 mod 53
9359 Core modular exponentiation (Mongtomery form only) #2 0 ^ 1 mod 53
9362 Core modular exponentiation (Mongtomery form only) #3 0 ^ 2 mod 53
9365 Core modular exponentiation (Mongtomery form only) #4 0 ^ 3 mod 53
9368 Core modular exponentiation (Mongtomery form only) #5 0 ^ 4 mod 53
9371 Core modular exponentiation (Mongtomery form only) #6 0 ^ 38 mod 53
9374 …xponentiation (Mongtomery form only) #7 0 ^ d1c127a667786703830500038ebaef20e5a3e2dc378fb75b mod 53
9377 …xponentiation (Mongtomery form only) #8 0 ^ 177219d30e7a269fd95bafc8f2a4d27bdcf4bb99f4bea973 mod 53
9380 …xponentiation (Mongtomery form only) #9 0 ^ cf1822ffbc6887782b491044d5e341245c6e433715ba2bdd mod 53
9383 …9ab2f51244bf295eff9f6aaba1302efc449b128be75eeaca04bc3c1a155d11d14e8be32a2c8287b3996cf6ad5223 mod 53
[all …]
Dtest_suite_pkcs1_v21.function11 void pkcs1_rsaes_oaep_encrypt(int mod, data_t *input_N, data_t *input_E,
39 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
62 void pkcs1_rsaes_oaep_decrypt(int mod, data_t *input_P, data_t *input_Q,
95 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
126 void pkcs1_rsassa_pss_sign(int mod, data_t *input_P, data_t *input_Q,
161 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
194 void pkcs1_rsassa_pss_verify(int mod, data_t *input_N, data_t *input_E,
216 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
231 void pkcs1_rsassa_pss_verify_ext(int mod, data_t *input_N, data_t *input_E,
255 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
Dtest_suite_rsa.function162 int digest, int mod, char *input_P,
186 TEST_EQUAL(mbedtls_rsa_get_len(&ctx), (size_t) ((mod + 7) / 8));
187 TEST_EQUAL(mbedtls_rsa_get_bitlen(&ctx), (size_t) mod);
210 int digest, int mod,
225 TEST_EQUAL(mbedtls_rsa_get_len(&ctx), (size_t) ((mod + 7) / 8));
226 TEST_EQUAL(mbedtls_rsa_get_bitlen(&ctx), (size_t) mod);
241 int padding_mode, int mod,
267 TEST_EQUAL(mbedtls_rsa_get_len(&ctx), (size_t) ((mod + 7) / 8));
268 TEST_EQUAL(mbedtls_rsa_get_bitlen(&ctx), (size_t) mod);
292 int padding_mode, int mod,
[all …]
Dtest_suite_pkcs1_v15.function12 void pkcs1_rsaes_v15_encrypt(int mod, char *input_N,
43 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
67 void pkcs1_rsaes_v15_decrypt(int mod, char *input_P, char *input_Q,
97 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
268 void pkcs1_rsassa_v15_sign(int mod, char *input_P,
301 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
323 void pkcs1_rsassa_v15_verify(int mod, char *input_N, char *input_E,
342 TEST_ASSERT(mbedtls_rsa_get_len(&ctx) == (size_t) ((mod + 7) / 8));
Dtest_suite_bignum.misc.data1323 Test mbedtls_mpi_exp_mod: 0 (null) ^ 0 (null) mod 9
1326 Test mbedtls_mpi_exp_mod: 0 (null) ^ 0 (1 limb) mod 9
1329 Test mbedtls_mpi_exp_mod: 0 (null) ^ 1 mod 9
1332 Test mbedtls_mpi_exp_mod: 0 (null) ^ 2 mod 9
1335 Test mbedtls_mpi_exp_mod: 0 (1 limb) ^ 0 (null) mod 9
1338 Test mbedtls_mpi_exp_mod: 0 (1 limb) ^ 0 (1 limb) mod 9
1341 Test mbedtls_mpi_exp_mod: 0 (1 limb) ^ 1 mod 9
1344 Test mbedtls_mpi_exp_mod: 0 (1 limb) ^ 2 mod 9
1347 Test mbedtls_mpi_exp_mod: 1 ^ 0 (null) mod 9
1350 Test mbedtls_mpi_exp_mod: 4 ^ 0 (null) mod 9
[all …]
Dtest_suite_ecp.data320 ECP read binary #17 (non-zero, compressed format, p != 3 mod 4, secp224r1)
324 ECP read binary #17a (non-zero, compressed format, p != 3 mod 4, secp224k1)
994 ECP mod p192 small (more than 192 bits, less limbs than 2 * 192 bits)
998 ECP mod p192 readable
1002 ECP mod p192 readable with carry
1006 ECP mod p192 random
1010 ECP mod p192 (from a past failure case)
1014 ECP mod p224 readable without carry
1018 ECP mod p224 readable with negative carry
1022 ECP mod p224 readable with positive carry
[all …]
Dtest_suite_pk.function1068 int mod, char *input_N, char *input_E,
1089 rsa->len = (mod + 7) / 8;
1137 int mod, char *input_N,
1155 rsa->len = (mod + 7) / 8;
1418 void pk_rsa_encrypt_decrypt_test(data_t *message, int mod, int padding,
1446 rsa->len = (mod + 7) / 8;
1473 TEST_EQUAL(mbedtls_rsa_get_len(rsa), (mod + 7) / 8);
1476 TEST_EQUAL(mbedtls_pk_get_len(&pk), (mod + 7) / 8);
1477 TEST_EQUAL(mbedtls_pk_get_bitlen(&pk), mod);
1498 void pk_rsa_decrypt_test_vec(data_t *cipher, int mod, int padding, int md_alg,
[all …]
Dtest_suite_ecp.function576 * Use mod rather than addition/subtraction in case previous test fails
664 * Short Weierstrass curves with prime p where p = 3 mod 4) */
1854 /* Write source mod residue to a buffer, then read it back to
1855 * the destination mod residue, compare the two mod residues.
Dtest_suite_bignum_random.function219 /* Call the core and mod random() functions with the same random stream. */
Dtest_suite_psa_crypto.function115 * exponent1 INTEGER, -- d mod (p-1)
116 * exponent2 INTEGER, -- d mod (q-1)
117 * coefficient INTEGER, -- (inverse of q) mod p
/mbedtls-latest/3rdparty/p256-m/p256-m/
Dp256-m.c513 const m256_mod *mod) in m256_add() argument
517 uint32_t carry_sub = u256_sub(r, z, mod->m); in m256_add()
550 const m256_mod *mod) in m256_sub() argument
554 (void) u256_add(r, z, mod->m); in m256_sub()
586 const m256_mod *mod) in m256_mul() argument
592 uint32_t m_prime = mod->ni; in m256_mul()
605 c += u288_muladd(a, u, mod->m); in m256_mul()
611 uint32_t carry_sub = u256_sub(z, a, mod->m); in m256_mul()
637 static void m256_prep(uint32_t z[8], const m256_mod *mod) in m256_prep() argument
639 m256_mul(z, z, mod->R2, mod); in m256_prep()
[all …]
DREADME.md345 represented by `x * 2^256 mod m`; integers need to be converted to that domain
389 negating both the scalar (mod n) and the input point if necessary.
469 only keep the functions that already accept a `mod` parameter (that is, remove
473 in this layer: the existing `mod` parameter can include the number of limbs as
/mbedtls-latest/scripts/
Dcode_size_compare.py373 for mod, st_lib in MBEDTLS_STATIC_LIB.items():
379 res[mod] = result
508 def _set_size_record(self, git_rev: str, mod: str, size_text: str) -> None:
517 data[5] = mod + self.mod_total_suffix
521 self.code_size.setdefault(git_rev, {}).update({mod: size_record})
528 mod = ""
535 mod = data[0]
538 if mod:
547 self.code_size[git_rev].update({mod: size_record})
549 self.code_size[git_rev] = {mod: size_record}
[all …]
/mbedtls-latest/tests/scripts/
Dgen_pkcs1_v21_sign_verify.pl40 my $mod = 0;
46 ( $mod ) = ($line =~ /A (\d+)/);
59 …print("pkcs1_rsassa_pss_sign:$mod:16:\"$val_p\":16:\"$val_q\":16:\"$val_n\":16:\"$val_e\":SIG_RSA_…
66 … print("pkcs1_rsassa_pss_verify:$mod:16:\"$val_n\":16:\"$val_e\":SIG_RSA_SHA1:MBEDTLS_MD_SHA1");
/mbedtls-latest/
DChangeLog819 (and callers) for Short Weierstrass curves with prime p where p = 3 mod 4
2323 invertible (mod N), instead of returning MBEDTLS_ERR_RSA_RNG_FAILED. This
5246 * Fix ECDSA corner case: missing reduction mod N (found by DualTachyon)