| /mbedtls-3.7.0/tests/suites/ |
| D | test_suite_bignum_mod.function | 14 const mbedtls_mpi_mod_modulus *m,
32 /* mbedtls_mpi_mod_residue_setup() checks limbs, and that value < m */
33 return mbedtls_mpi_mod_residue_setup(r, m, p, limbs);
47 mbedtls_mpi_mod_modulus m;
52 mbedtls_mpi_mod_modulus_init(&m);
56 ret = mbedtls_mpi_mod_modulus_setup(&m, mp, MLIMBS);
59 ret = mbedtls_mpi_mod_optred_modulus_setup(&m, mp, MLIMBS, NULL);
71 TEST_ASSERT(m.rep.mont.rr != NULL);
72 TEST_ASSERT(m.rep.mont.mm != 0);
77 mbedtls_mpi_mod_modulus_free(&m);
[all …]
|
| D | test_suite_bignum_mod_raw.function | 22 mbedtls_mpi_mod_modulus m;
23 mbedtls_mpi_mod_modulus_init(&m);
57 int ret = mbedtls_mpi_mod_modulus_setup(&m, init, nx);
64 ret = mbedtls_mpi_mod_raw_read(X, &m, input->x, input->len, endian);
72 ret = mbedtls_mpi_mod_raw_write(X, &m, buf, nb, endian);
107 mbedtls_mpi_mod_modulus_free(&m);
122 mbedtls_mpi_mod_modulus m;
123 mbedtls_mpi_mod_modulus_init(&m);
139 &m, buff_m, copy_limbs), 0);
145 mbedtls_mpi_mod_raw_cond_assign(X, Y, &m, 0);
[all …]
|
| D | test_suite_bignum_mod.misc.data | 105 Test mbedtls_mpi_residue_setup #1 m > r
108 Test mbedtls_mpi_residue_setup #2 r == m - 1
111 Test mbedtls_mpi_residue_setup #3 m->limbs = r-> limbs && m > r
114 Test mbedtls_mpi_residue_setup #4 m->limbs = r-> limbs && m > r
117 Test mbedtls_mpi_residue_setup #5 m->limbs > r-> limbs && m > r
120 Test mbedtls_mpi_residue_setup #6 m->limbs < r-> limbs && m > r
123 Test mbedtls_mpi_residue_setup #7 r == m
126 Test mbedtls_mpi_residue_setup #8 r > m
129 Test mbedtls_mpi_mod_io_neg #1 input_r < modulo m
132 Test mbedtls_mpi_mod_io_neg #2 input_r == modulo m
[all …]
|
| D | test_suite_ecp.function | 1572 mbedtls_mpi_mod_modulus m;
1573 mbedtls_mpi_mod_modulus_init(&m);
1660 &m, N, limbs_N), 0);
1664 mbedtls_mpi_mod_raw_fix_quasi_reduction(X, &m);
1672 mbedtls_mpi_mod_modulus_free(&m);
1681 mbedtls_mpi_mod_modulus m;
1682 mbedtls_mpi_mod_modulus_init(&m);
1689 ret = mbedtls_ecp_modulus_setup(&m, id, ctype);
1693 TEST_ASSERT(m.int_rep != MBEDTLS_MPI_MOD_REP_INVALID);
1695 TEST_EQUAL(m.limbs, p_limbs);
[all …]
|
| /mbedtls-3.7.0/scripts/mbedtls_dev/ |
| D | c_parsing_helper.py | 42 m = self._DECLARATION_RE.match(self.decl)
43 if not m:
45 self.type = self.normalize_type(m.group('type')) #type: str
46 self.name = m.group('name') #type: Optional[str]
47 self.suffix = m.group('suffix') if m.group('suffix') else '' #type: str
91 lambda m: re.sub(_NOT_NEWLINES_RE, "", m.group(0)),
117 m = _C_FUNCTION_DECLARATION_RE.match(line)
118 if not m:
120 qualifiers = m.group('qualifiers').split()
121 return_type = m.group('return_type')
[all …]
|
| D | crypto_knowledge.py | 90 m = re.match(r'(\w+)\s*\((.*)\)\Z', self.name)
91 assert m is not None
92 self.name = m.group(1)
93 params = m.group(2).split(',')
107 m = re.match(r'PSA_KEY_TYPE_(\w+)', self.name)
108 assert m
109 self.head = re.sub(r'_(?:PUBLIC_KEY|KEY_PAIR)\Z', r'', m.group(1))
308 m = re.match(r'PSA_ALG_(?:'
312 if m:
313 expr = m.group(1)
[all …]
|
| D | macro_collector.py | 288 m = re.match(self._define_directive_re, line)
289 if not m:
291 name, parameter, expansion = m.groups()
335 m = re.search(self._continued_line_re, line)
336 while m:
338 line = line[:m.start(0)] + cont
339 m = re.search(self._continued_line_re, line)
467 m = re.match(self._header_line_re, line)
468 if not m:
470 name = m.group(1)
[all …]
|
| /mbedtls-3.7.0/3rdparty/p256-m/ |
| D | README.md | 1 …m/` subdirectory originate from the [p256-m GitHub repository](https://github.com/mpg/p256-m). The…
3 The files `p256-m.c`, `p256-m.h` and `README.md` have been taken from the `p256-m` repository.
4 It should be noted that p256-m deliberately does not supply its own cryptographically secure RNG fu…
|
| D | CMakeLists.txt | 5 p256-m/p256-m.c)
9 $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/p256-m>
|
| /mbedtls-3.7.0/tests/scripts/ |
| D | check_files.py | 179 m = re.match(self._shebang_re, first_line)
180 if not m:
182 interpreter = m.group(1) or m.group(2)
424 m = self.COPYRIGHT_RE.match(line)
425 if m and m.group(1) != self.COPYRIGHT_HOLDER:
429 m = self.SPDX_RE.match(line)
430 if m:
431 if m.group(1) != self.SPDX_HEADER_KEY:
434 if not m.group(3):
437 if m.group(3) != self.LICENSE_IDENTIFIER:
[all …]
|
| D | audit-validity-dates.py | 149 m = re.search(X509Parser.PEM_TAG_REGEX, data)
150 if m is not None:
151 return m.group('type').decode('UTF-8')
295 for idx, m in enumerate(re.finditer(X509Parser.PEM_REGEX, data, flags=re.S), 1):
297 result = self.parse_bytes(data[m.start():m.end()])
|
| D | check_names.py | 520 m = re.search(r"\*/", line)
521 if m:
523 line = line[m.end(0):]
536 m = re.search(r"/\*", line)
537 if m:
539 line = line[:m.start(0)]
|
| D | generate_test_code.py | 485 m = ARGUMENT_DECLARATION_REGEX.search(arg)
486 if not m:
489 typ, _ = m.groups()
525 m = ARGUMENT_LIST_REGEX.search(line)
526 arg_list = m.group(1).strip()
744 lambda m: m.group(1) or '\n', inp_str,
|
| /mbedtls-3.7.0/programs/ |
| D | demo_common.sh | 94 m=
97 m="$m $x"
100 if [ -n "$m" ]; then
104 $m
|
| /mbedtls-3.7.0/library/ |
| D | ecp.c | 1785 unsigned char w, const mbedtls_mpi *m) in ecp_comb_recode_core() argument
1795 x[i] |= mbedtls_mpi_get_bit(m, i + d * j) << j; in ecp_comb_recode_core()
2122 const mbedtls_mpi *m, in ecp_comb_recode_scalar() argument
2140 *parity_trick = (mbedtls_mpi_get_bit(m, 0) == 0); in ecp_comb_recode_scalar()
2143 MBEDTLS_MPI_CHK(mbedtls_mpi_copy(&M, m)); in ecp_comb_recode_scalar()
2144 MBEDTLS_MPI_CHK(mbedtls_mpi_sub_mpi(&mm, &grp->N, m)); in ecp_comb_recode_scalar()
2166 const mbedtls_mpi *m, in ecp_mul_comb_after_precomp() argument
2190 MBEDTLS_MPI_CHK(ecp_comb_recode_scalar(grp, m, k, d, w, in ecp_mul_comb_after_precomp()
2290 const mbedtls_mpi *m, const mbedtls_ecp_point *P, in ecp_mul_comb() argument
2362 MBEDTLS_MPI_CHK(ecp_mul_comb_after_precomp(grp, R, m, in ecp_mul_comb()
[all …]
|
| D | aesce.c | 534 uint8x16_t h, m, l; /* retval high/middle/low */ in poly_mult_128() local
542 m = veorq_u8(d, e); /* :m2:m1:00 = d + e */ in poly_mult_128()
545 ret.val[1] = m; in poly_mult_128()
576 uint8x16_t h, m, l; /* input high/middle/low 128b */ in poly_mult_reduce() local
579 m = input.val[1]; /* :m2:m1:00 */ in poly_mult_reduce()
583 e = veorq_u8(c, m); /* :e2:e1:00 = m2:m1:00 + c2:c1:00 */ in poly_mult_reduce()
|
| /mbedtls-3.7.0/scripts/ |
| D | config.py | 423 m = re.match(self._config_line_regexp, line)
424 if m is None:
426 elif m.group('section'):
427 self.current_section = m.group('section')
430 active = not m.group('commented_out')
431 name = m.group('name')
432 value = m.group('value')
434 m.group('indentation'),
435 m.group('define') + name +
436 m.group('arguments') + m.group('separator'))
|
| D | assemble_changelog.py | 130 m = re.search(cls._top_version_re, changelog_file_content)
131 top_version_start = m.start(1)
132 top_version_end = m.end(2)
133 top_version_title = m.group(1)
134 top_version_body = m.group(2)
158 title_starts = [m.start(1) for m in title_matches]
159 body_starts = [m.end(0) for m in title_matches]
302 m = re.search('(.+)$', hashes.decode('ascii'))
303 if not m:
309 return m.group(0)
|
| D | min_requirements.py | 53 m = re.match(r'-r\s+', line)
54 if m:
56 line[m.end(0):])
|
| D | generate_ssl_debug_helpers.py | 259 for m in self._definitions:
260 name = m.groupdict()['name']
318 for m in self._definitions:
319 name = m.groupdict()['name']
|
| /mbedtls-3.7.0/3rdparty/p256-m/p256-m/ |
| D | p256-m.c | 466 uint32_t m[8]; member
517 uint32_t carry_sub = u256_sub(r, z, mod->m); in m256_add()
554 (void) u256_add(r, z, mod->m); in m256_sub()
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()
702 uint32_t limb = mod->m[i] - 2; in m256_inv()
716 limb = mod->m[i]; in m256_inv()
735 uint32_t lt_m = u256_sub(t, z, mod->m); in m256_from_bytes()
875 uint32_t m[8], s[8], u[8]; in point_double() local
879 m256_add_p(m, x, s); in point_double()
[all …]
|
| D | README.md | 1 *This is the original README for the p256-m repository. Please note that as
2 only a subset of p256-m's files are present in Mbed TLS, this README may refer
5 p256-m is a minimalistic implementation of ECDH and ECDSA on NIST P-256,
16 some might even risk weakening security for more speed. p256-m was written
45 - p256-m is validated against multiple test vectors from various RFCs and
81 In addition to the above correctness claims, p256-m has the following
91 p256-m also avoid instructions (or library functions) whose execution time
100 As a result, p256-m should be secure against the following classes of attackers:
107 However, p256-m makes no attempt to protect against:
113 (Note: p256-m should actually be secure against SPA, by virtue of being fully
[all …]
|
| /mbedtls-3.7.0/tests/ |
| D | compat.sh | 145 print_test_case m O "$O_CIPHERS"
146 print_test_case O m "$O_CIPHERS"
147 print_test_case m G "$G_CIPHERS"
148 print_test_case G m "$G_CIPHERS"
149 print_test_case m m "$M_CIPHERS"
1138 translate_ciphers m $M_CIPHERS
1167 translate_ciphers m $M_CIPHERS
1196 translate_ciphers m $M_CIPHERS
|
| /mbedtls-3.7.0/docs/ |
| D | psa-driver-example-and-guide.md | 141 …m](https://github.com/mpg/p256-m) is a minimalistic implementation of ECDH and ECDSA on the NIST P…
143 … build system includes the instructions needed to build p256-m. To build with and use p256-m, set …
149 …in implementation of ECC algorithms, which includes more features than p256-m. Refer to the docume…
151 The driver prefix for p256-m is `P256`/`p256`.
152 The p256-m driver implements the following entry points: `"import_key"`, `"export_public_key"`, `"g…
154 …m; converting between PSA and p256-m argument formats and performing sanity checks. If the driver'…
156 … call is placed within a check for `MBEDTLS_PSA_P256M_DRIVER_ENABLED`. p256-m only supports non-de…
180 …is, p256-m is now ready to use alongside Mbed TLS as a software accelerator. If `MBEDTLS_PSA_P256M…
|
| /mbedtls-3.7.0/include/mbedtls/ |
| D | ecp.h | 968 const mbedtls_mpi *m, const mbedtls_ecp_point *P,
1002 const mbedtls_mpi *m, const mbedtls_ecp_point *P,
1063 const mbedtls_mpi *m, const mbedtls_ecp_point *P,
1108 const mbedtls_mpi *m, const mbedtls_ecp_point *P,
|
