blob: 50c08fa6bea8b626d0502229578b99140608a8bd [file] [log] [blame]
gabor-mezei-armdb9a38c2021-09-27 11:28:54 +02001/**
2 * Constant-time functions
3 *
4 * Copyright The Mbed TLS Contributors
5 * SPDX-License-Identifier: Apache-2.0
6 *
7 * Licensed under the Apache License, Version 2.0 (the "License"); you may
8 * not use this file except in compliance with the License.
9 * You may obtain a copy of the License at
10 *
11 * http://www.apache.org/licenses/LICENSE-2.0
12 *
13 * Unless required by applicable law or agreed to in writing, software
14 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
15 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 * See the License for the specific language governing permissions and
17 * limitations under the License.
18 */
19
Gabor Mezei291df7b2021-10-19 11:27:17 +020020#ifndef MBEDTLS_CONSTANT_TIME_INTERNAL_H
21#define MBEDTLS_CONSTANT_TIME_INTERNAL_H
22
Dave Rodgman40a41d02023-05-17 11:59:56 +010023#include <stdint.h>
24#include <stddef.h>
25
gabor-mezei-armdb9a38c2021-09-27 11:28:54 +020026#include "common.h"
27
gabor-mezei-arm3f90fd52021-09-27 12:55:33 +020028#if defined(MBEDTLS_BIGNUM_C)
29#include "mbedtls/bignum.h"
30#endif
31
Dave Rodgman40a41d02023-05-17 11:59:56 +010032/* The constant-time interface provides various operations that are likely
33 * to result in constant-time code that does not branch or use conditional
34 * instructions for secret data (for secret pointers, this also applies to
35 * the data pointed to).
36 *
37 * It has three main parts:
38 *
Dave Rodgmanf27727b2023-05-13 12:12:02 +010039 * - boolean operations
Dave Rodgman38b227c2023-08-10 12:18:27 +010040 * These are all named mbedtls_ct_<type>_<operation>.
41 * They operate over <type> and return mbedtls_ct_condition_t.
Dave Rodgmanf27727b2023-05-13 12:12:02 +010042 * All arguments are considered secret.
Dave Rodgman40a41d02023-05-17 11:59:56 +010043 * example: bool x = y | z => x = mbedtls_ct_bool_or(y, z)
Dave Rodgmanb7825ce2023-08-10 11:58:18 +010044 * example: bool x = y == z => x = mbedtls_ct_uint_eq(y, z)
Dave Rodgman40a41d02023-05-17 11:59:56 +010045 *
46 * - conditional data selection
Dave Rodgman48fb8a32023-08-10 14:01:51 +010047 * These are all named mbedtls_ct_<type>_if and mbedtls_ct_<type>_if_else_0
Dave Rodgman40a41d02023-05-17 11:59:56 +010048 * All arguments are considered secret.
49 * example: size_t a = x ? b : c => a = mbedtls_ct_size_if(x, b, c)
Dave Rodgman48fb8a32023-08-10 14:01:51 +010050 * example: unsigned a = x ? b : 0 => a = mbedtls_ct_uint__if_else_0(x, b)
Dave Rodgman40a41d02023-05-17 11:59:56 +010051 *
52 * - block memory operations
53 * Only some arguments are considered secret, as documented for each
54 * function.
55 * example: if (x) memcpy(...) => mbedtls_ct_memcpy_if(x, ...)
56 *
Dave Rodgman93cec452023-07-31 12:30:26 +010057 * mbedtls_ct_condition_t must be treated as opaque and only created and
58 * manipulated via the functions in this header. The compiler should never
59 * be able to prove anything about its value at compile-time.
Dave Rodgman40a41d02023-05-17 11:59:56 +010060 *
61 * mbedtls_ct_uint_t is an unsigned integer type over which constant time
62 * operations may be performed via the functions in this header. It is as big
63 * as the larger of size_t and mbedtls_mpi_uint, i.e. it is safe to cast
64 * to/from "unsigned int", "size_t", and "mbedtls_mpi_uint" (and any other
65 * not-larger integer types).
66 *
Dave Rodgmanf27727b2023-05-13 12:12:02 +010067 * For Arm (32-bit, 64-bit and Thumb), x86 and x86-64, assembly implementations
68 * are used to ensure that the generated code is constant time. For other
Dave Rodgman0172de82023-07-31 12:32:23 +010069 * architectures, it uses a plain C fallback designed to yield constant-time code
70 * (this has been observed to be constant-time on latest gcc, clang and MSVC
71 * as of May 2023).
Dave Rodgman205295c2023-08-01 14:10:56 +010072 *
73 * For readability, the static inline definitions are separated out into
74 * constant_time_impl.h.
Dave Rodgman40a41d02023-05-17 11:59:56 +010075 */
76
77#if (SIZE_MAX > 0xffffffffffffffffULL)
78/* Pointer size > 64-bit */
79typedef size_t mbedtls_ct_condition_t;
80typedef size_t mbedtls_ct_uint_t;
81typedef ptrdiff_t mbedtls_ct_int_t;
Dave Rodgmanfba55982023-07-14 13:44:22 +010082#define MBEDTLS_CT_TRUE ((mbedtls_ct_condition_t) mbedtls_ct_compiler_opaque(SIZE_MAX))
Dave Rodgman40a41d02023-05-17 11:59:56 +010083#elif (SIZE_MAX > 0xffffffff) || defined(MBEDTLS_HAVE_INT64)
Dave Rodgmanc882adf2023-06-21 07:37:56 +010084/* 32-bit < pointer size <= 64-bit, or 64-bit MPI */
Dave Rodgman40a41d02023-05-17 11:59:56 +010085typedef uint64_t mbedtls_ct_condition_t;
86typedef uint64_t mbedtls_ct_uint_t;
87typedef int64_t mbedtls_ct_int_t;
Dave Rodgmanc9ed5de2023-05-13 12:47:02 +010088#define MBEDTLS_CT_SIZE_64
Dave Rodgmanfba55982023-07-14 13:44:22 +010089#define MBEDTLS_CT_TRUE ((mbedtls_ct_condition_t) mbedtls_ct_compiler_opaque(UINT64_MAX))
Dave Rodgman40a41d02023-05-17 11:59:56 +010090#else
Dave Rodgmanc882adf2023-06-21 07:37:56 +010091/* Pointer size <= 32-bit, and no 64-bit MPIs */
Dave Rodgman40a41d02023-05-17 11:59:56 +010092typedef uint32_t mbedtls_ct_condition_t;
93typedef uint32_t mbedtls_ct_uint_t;
94typedef int32_t mbedtls_ct_int_t;
Dave Rodgmanc9ed5de2023-05-13 12:47:02 +010095#define MBEDTLS_CT_SIZE_32
Dave Rodgmanfba55982023-07-14 13:44:22 +010096#define MBEDTLS_CT_TRUE ((mbedtls_ct_condition_t) mbedtls_ct_compiler_opaque(UINT32_MAX))
Dave Rodgman40a41d02023-05-17 11:59:56 +010097#endif
Dave Rodgmanfba55982023-07-14 13:44:22 +010098#define MBEDTLS_CT_FALSE ((mbedtls_ct_condition_t) mbedtls_ct_compiler_opaque(0))
Dave Rodgman40a41d02023-05-17 11:59:56 +010099
Dave Rodgman40a41d02023-05-17 11:59:56 +0100100/* ============================================================================
101 * Boolean operations
102 */
103
104/** Convert a number into a mbedtls_ct_condition_t.
105 *
106 * \param x Number to convert.
107 *
108 * \return MBEDTLS_CT_TRUE if \p x != 0, or MBEDTLS_CT_FALSE if \p x == 0
109 *
110 */
111static inline mbedtls_ct_condition_t mbedtls_ct_bool(mbedtls_ct_uint_t x);
112
113/** Boolean "not equal" operation.
114 *
115 * Functionally equivalent to:
116 *
117 * \p x != \p y
118 *
119 * \param x The first value to analyze.
120 * \param y The second value to analyze.
121 *
122 * \return MBEDTLS_CT_TRUE if \p x != \p y, otherwise MBEDTLS_CT_FALSE.
123 */
Dave Rodgmanb7825ce2023-08-10 11:58:18 +0100124static inline mbedtls_ct_condition_t mbedtls_ct_uint_ne(mbedtls_ct_uint_t x, mbedtls_ct_uint_t y);
Dave Rodgman40a41d02023-05-17 11:59:56 +0100125
126/** Boolean "equals" operation.
127 *
128 * Functionally equivalent to:
129 *
130 * \p x == \p y
131 *
132 * \param x The first value to analyze.
133 * \param y The second value to analyze.
134 *
135 * \return MBEDTLS_CT_TRUE if \p x == \p y, otherwise MBEDTLS_CT_FALSE.
136 */
Dave Rodgmanb7825ce2023-08-10 11:58:18 +0100137static inline mbedtls_ct_condition_t mbedtls_ct_uint_eq(mbedtls_ct_uint_t x,
Dave Rodgman40a41d02023-05-17 11:59:56 +0100138 mbedtls_ct_uint_t y);
139
140/** Boolean "less than" operation.
141 *
142 * Functionally equivalent to:
143 *
144 * \p x < \p y
145 *
146 * \param x The first value to analyze.
147 * \param y The second value to analyze.
148 *
149 * \return MBEDTLS_CT_TRUE if \p x < \p y, otherwise MBEDTLS_CT_FALSE.
150 */
Dave Rodgmanb7825ce2023-08-10 11:58:18 +0100151static inline mbedtls_ct_condition_t mbedtls_ct_uint_lt(mbedtls_ct_uint_t x, mbedtls_ct_uint_t y);
Dave Rodgman40a41d02023-05-17 11:59:56 +0100152
153/** Boolean "greater than" operation.
154 *
155 * Functionally equivalent to:
156 *
157 * \p x > \p y
158 *
159 * \param x The first value to analyze.
160 * \param y The second value to analyze.
161 *
162 * \return MBEDTLS_CT_TRUE if \p x > \p y, otherwise MBEDTLS_CT_FALSE.
163 */
Dave Rodgmanb7825ce2023-08-10 11:58:18 +0100164static inline mbedtls_ct_condition_t mbedtls_ct_uint_gt(mbedtls_ct_uint_t x,
Dave Rodgman40a41d02023-05-17 11:59:56 +0100165 mbedtls_ct_uint_t y);
166
167/** Boolean "greater or equal" operation.
168 *
169 * Functionally equivalent to:
170 *
171 * \p x >= \p y
172 *
173 * \param x The first value to analyze.
174 * \param y The second value to analyze.
175 *
176 * \return MBEDTLS_CT_TRUE if \p x >= \p y,
177 * otherwise MBEDTLS_CT_FALSE.
178 */
Dave Rodgmanb7825ce2023-08-10 11:58:18 +0100179static inline mbedtls_ct_condition_t mbedtls_ct_uint_ge(mbedtls_ct_uint_t x,
Dave Rodgman40a41d02023-05-17 11:59:56 +0100180 mbedtls_ct_uint_t y);
181
182/** Boolean "less than or equal" operation.
183 *
184 * Functionally equivalent to:
185 *
186 * \p x <= \p y
187 *
188 * \param x The first value to analyze.
189 * \param y The second value to analyze.
190 *
191 * \return MBEDTLS_CT_TRUE if \p x <= \p y,
192 * otherwise MBEDTLS_CT_FALSE.
193 */
Dave Rodgmanb7825ce2023-08-10 11:58:18 +0100194static inline mbedtls_ct_condition_t mbedtls_ct_uint_le(mbedtls_ct_uint_t x,
Dave Rodgman40a41d02023-05-17 11:59:56 +0100195 mbedtls_ct_uint_t y);
196
Dave Rodgman1cfc43c2023-09-19 16:18:59 +0100197/** Boolean not-equals operation.
Dave Rodgman40a41d02023-05-17 11:59:56 +0100198 *
199 * Functionally equivalent to:
200 *
Dave Rodgman1cfc43c2023-09-19 16:18:59 +0100201 * \p x != \p y
Dave Rodgman40a41d02023-05-17 11:59:56 +0100202 *
203 * \param x The first value to analyze.
204 * \param y The second value to analyze.
205 *
Dave Rodgman48fb8a32023-08-10 14:01:51 +0100206 * \note This is more efficient than mbedtls_ct_uint_ne if both arguments are
Dave Rodgman40a41d02023-05-17 11:59:56 +0100207 * mbedtls_ct_condition_t.
208 *
Dave Rodgman1cfc43c2023-09-19 16:18:59 +0100209 * \return MBEDTLS_CT_TRUE if \p x != \p y,
Dave Rodgman40a41d02023-05-17 11:59:56 +0100210 * otherwise MBEDTLS_CT_FALSE.
211 */
Dave Rodgman1cfc43c2023-09-19 16:18:59 +0100212static inline mbedtls_ct_condition_t mbedtls_ct_bool_ne(mbedtls_ct_condition_t x,
213 mbedtls_ct_condition_t y);
Dave Rodgman40a41d02023-05-17 11:59:56 +0100214
215/** Boolean "and" operation.
216 *
217 * Functionally equivalent to:
218 *
219 * \p x && \p y
220 *
221 * \param x The first value to analyze.
222 * \param y The second value to analyze.
223 *
224 * \return MBEDTLS_CT_TRUE if \p x && \p y,
225 * otherwise MBEDTLS_CT_FALSE.
226 */
227static inline mbedtls_ct_condition_t mbedtls_ct_bool_and(mbedtls_ct_condition_t x,
228 mbedtls_ct_condition_t y);
229
230/** Boolean "or" operation.
231 *
232 * Functionally equivalent to:
233 *
234 * \p x || \p y
235 *
236 * \param x The first value to analyze.
237 * \param y The second value to analyze.
238 *
239 * \return MBEDTLS_CT_TRUE if \p x || \p y,
240 * otherwise MBEDTLS_CT_FALSE.
241 */
242static inline mbedtls_ct_condition_t mbedtls_ct_bool_or(mbedtls_ct_condition_t x,
243 mbedtls_ct_condition_t y);
244
245/** Boolean "not" operation.
246 *
247 * Functionally equivalent to:
248 *
249 * ! \p x
250 *
251 * \param x The value to invert
252 *
253 * \return MBEDTLS_CT_FALSE if \p x, otherwise MBEDTLS_CT_TRUE.
254 */
255static inline mbedtls_ct_condition_t mbedtls_ct_bool_not(mbedtls_ct_condition_t x);
256
257
258/* ============================================================================
259 * Data selection operations
260 */
261
262/** Choose between two size_t values.
263 *
264 * Functionally equivalent to:
265 *
266 * condition ? if1 : if0.
267 *
268 * \param condition Condition to test.
269 * \param if1 Value to use if \p condition == MBEDTLS_CT_TRUE.
270 * \param if0 Value to use if \p condition == MBEDTLS_CT_FALSE.
271 *
272 * \return \c if1 if \p condition == MBEDTLS_CT_TRUE, otherwise \c if0.
273 */
274static inline size_t mbedtls_ct_size_if(mbedtls_ct_condition_t condition,
275 size_t if1,
276 size_t if0);
277
278/** Choose between two unsigned values.
279 *
280 * Functionally equivalent to:
281 *
282 * condition ? if1 : if0.
283 *
284 * \param condition Condition to test.
285 * \param if1 Value to use if \p condition == MBEDTLS_CT_TRUE.
286 * \param if0 Value to use if \p condition == MBEDTLS_CT_FALSE.
287 *
288 * \return \c if1 if \p condition == MBEDTLS_CT_TRUE, otherwise \c if0.
289 */
Dave Rodgman2b4486a2023-05-17 15:51:59 +0100290static inline unsigned mbedtls_ct_uint_if(mbedtls_ct_condition_t condition,
Dave Rodgman40a41d02023-05-17 11:59:56 +0100291 unsigned if1,
292 unsigned if0);
293
294#if defined(MBEDTLS_BIGNUM_C)
295
296/** Choose between two mbedtls_mpi_uint values.
297 *
298 * Functionally equivalent to:
299 *
300 * condition ? if1 : if0.
301 *
302 * \param condition Condition to test.
303 * \param if1 Value to use if \p condition == MBEDTLS_CT_TRUE.
304 * \param if0 Value to use if \p condition == MBEDTLS_CT_FALSE.
305 *
306 * \return \c if1 if \p condition == MBEDTLS_CT_TRUE, otherwise \c if0.
307 */
308static inline mbedtls_mpi_uint mbedtls_ct_mpi_uint_if(mbedtls_ct_condition_t condition, \
309 mbedtls_mpi_uint if1, \
310 mbedtls_mpi_uint if0);
311
312#endif
313
314/** Choose between an unsigned value and 0.
315 *
316 * Functionally equivalent to:
317 *
318 * condition ? if1 : 0.
319 *
Dave Rodgman065f9122023-08-10 12:11:58 +0100320 * Functionally equivalent to mbedtls_ct_uint_if(condition, if1, 0) but
Dave Rodgman40a41d02023-05-17 11:59:56 +0100321 * results in smaller code size.
322 *
323 * \param condition Condition to test.
324 * \param if1 Value to use if \p condition == MBEDTLS_CT_TRUE.
325 *
326 * \return \c if1 if \p condition == MBEDTLS_CT_TRUE, otherwise 0.
327 */
Dave Rodgman98ddc012023-08-10 12:11:31 +0100328static inline unsigned mbedtls_ct_uint_if_else_0(mbedtls_ct_condition_t condition, unsigned if1);
Dave Rodgman40a41d02023-05-17 11:59:56 +0100329
Dave Rodgmanb364a222023-08-10 12:25:25 +0100330/** Choose between a size_t value and 0.
Dave Rodgmanac69b452023-08-10 12:13:27 +0100331 *
332 * Functionally equivalent to:
333 *
334 * condition ? if1 : 0.
335 *
336 * Functionally equivalent to mbedtls_ct_size_if(condition, if1, 0) but
337 * results in smaller code size.
338 *
339 * \param condition Condition to test.
340 * \param if1 Value to use if \p condition == MBEDTLS_CT_TRUE.
341 *
342 * \return \c if1 if \p condition == MBEDTLS_CT_TRUE, otherwise 0.
343 */
344static inline size_t mbedtls_ct_size_if_else_0(mbedtls_ct_condition_t condition, size_t if1);
345
Dave Rodgman40a41d02023-05-17 11:59:56 +0100346#if defined(MBEDTLS_BIGNUM_C)
347
348/** Choose between an mbedtls_mpi_uint value and 0.
349 *
350 * Functionally equivalent to:
351 *
352 * condition ? if1 : 0.
353 *
Dave Rodgman065f9122023-08-10 12:11:58 +0100354 * Functionally equivalent to mbedtls_ct_mpi_uint_if(condition, if1, 0) but
Dave Rodgman40a41d02023-05-17 11:59:56 +0100355 * results in smaller code size.
356 *
357 * \param condition Condition to test.
358 * \param if1 Value to use if \p condition == MBEDTLS_CT_TRUE.
359 *
360 * \return \c if1 if \p condition == MBEDTLS_CT_TRUE, otherwise 0.
361 */
Dave Rodgman98ddc012023-08-10 12:11:31 +0100362static inline mbedtls_mpi_uint mbedtls_ct_mpi_uint_if_else_0(mbedtls_ct_condition_t condition,
363 mbedtls_mpi_uint if1);
Dave Rodgman40a41d02023-05-17 11:59:56 +0100364
365#endif
366
367/** Constant-flow char selection
368 *
369 * \param low Secret. Bottom of range
370 * \param high Secret. Top of range
371 * \param c Secret. Value to compare to range
372 * \param t Secret. Value to return, if in range
373 *
374 * \return \p t if \p low <= \p c <= \p high, 0 otherwise.
375 */
376static inline unsigned char mbedtls_ct_uchar_in_range_if(unsigned char low,
377 unsigned char high,
378 unsigned char c,
379 unsigned char t);
380
381
382/* ============================================================================
383 * Block memory operations
384 */
385
386#if defined(MBEDTLS_PKCS1_V15) && defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_RSA_ALT)
387
388/** Conditionally set a block of memory to zero.
389 *
390 * Regardless of the condition, every byte will be read once and written to
391 * once.
392 *
393 * \param condition Secret. Condition to test.
394 * \param buf Secret. Pointer to the start of the buffer.
395 * \param len Number of bytes to set to zero.
396 *
397 * \warning Unlike mbedtls_platform_zeroize, this does not have the same guarantees
398 * about not being optimised away if the memory is never read again.
399 */
400void mbedtls_ct_zeroize_if(mbedtls_ct_condition_t condition, void *buf, size_t len);
401
402/** Shift some data towards the left inside a buffer.
403 *
404 * Functionally equivalent to:
405 *
406 * memmove(start, start + offset, total - offset);
407 * memset(start + (total - offset), 0, offset);
408 *
409 * Timing independence comes at the expense of performance.
410 *
411 * \param start Secret. Pointer to the start of the buffer.
412 * \param total Total size of the buffer.
413 * \param offset Secret. Offset from which to copy \p total - \p offset bytes.
414 */
415void mbedtls_ct_memmove_left(void *start,
416 size_t total,
417 size_t offset);
418
419#endif /* defined(MBEDTLS_PKCS1_V15) && defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_RSA_ALT) */
420
421/** Conditional memcpy.
422 *
423 * Functionally equivalent to:
424 *
425 * if (condition) {
426 * memcpy(dest, src1, len);
427 * } else {
428 * if (src2 != NULL)
429 * memcpy(dest, src2, len);
430 * }
431 *
432 * It will always read len bytes from src1.
433 * If src2 != NULL, it will always read len bytes from src2.
434 * If src2 == NULL, it will instead read len bytes from dest (as if src2 == dest).
435 *
436 * \param condition The condition
437 * \param dest Secret. Destination pointer.
Dave Rodgman31086452023-05-18 13:47:13 +0100438 * \param src1 Secret. Pointer to copy from (if \p condition == MBEDTLS_CT_TRUE).
439 * This may be equal to \p dest, but may not overlap in other ways.
Dave Rodgman741d4232023-07-31 12:31:01 +0100440 * \param src2 Secret (contents only - may branch to determine if this parameter is NULL).
Dave Rodgman31086452023-05-18 13:47:13 +0100441 * Pointer to copy from (if \p condition == MBEDTLS_CT_FALSE and \p src2 is not NULL). May be NULL.
442 * This may be equal to \p dest, but may not overlap it in other ways. It may overlap with \p src1.
Dave Rodgman40a41d02023-05-17 11:59:56 +0100443 * \param len Number of bytes to copy.
444 */
445void mbedtls_ct_memcpy_if(mbedtls_ct_condition_t condition,
446 unsigned char *dest,
447 const unsigned char *src1,
448 const unsigned char *src2,
449 size_t len
450 );
451
452/** Copy data from a secret position.
453 *
454 * Functionally equivalent to:
455 *
456 * memcpy(dst, src + offset, len)
457 *
458 * This function copies \p len bytes from \p src_base + \p offset to \p
459 * dst, with a code flow and memory access pattern that does not depend on
460 * \p offset, but only on \p offset_min, \p offset_max and \p len.
461 *
462 * \note This function reads from \p dest, but the value that
463 * is read does not influence the result and this
464 * function's behavior is well-defined regardless of the
465 * contents of the buffers. This may result in false
466 * positives from static or dynamic analyzers, especially
467 * if \p dest is not initialized.
468 *
469 * \param dest Secret. The destination buffer. This must point to a writable
470 * buffer of at least \p len bytes.
471 * \param src Secret. The base of the source buffer. This must point to a
472 * readable buffer of at least \p offset_max + \p len
Dave Rodgman31086452023-05-18 13:47:13 +0100473 * bytes. Shouldn't overlap with \p dest
Dave Rodgman40a41d02023-05-17 11:59:56 +0100474 * \param offset Secret. The offset in the source buffer from which to copy.
475 * This must be no less than \p offset_min and no greater
476 * than \p offset_max.
477 * \param offset_min The minimal value of \p offset.
478 * \param offset_max The maximal value of \p offset.
479 * \param len The number of bytes to copy.
480 */
481void mbedtls_ct_memcpy_offset(unsigned char *dest,
482 const unsigned char *src,
483 size_t offset,
484 size_t offset_min,
485 size_t offset_max,
486 size_t len);
487
Dave Rodgman9ee0e1f2023-07-31 12:33:36 +0100488/* Documented in include/mbedtls/constant_time.h. a and b are secret.
489
490 int mbedtls_ct_memcmp(const void *a,
491 const void *b,
492 size_t n);
493 */
Dave Rodgman40a41d02023-05-17 11:59:56 +0100494
Dave Rodgman9c140072023-09-18 18:20:27 +0100495#if defined(MBEDTLS_NIST_KW_C)
496
497/** Constant-time buffer comparison without branches.
498 *
499 * Similar to mbedtls_ct_memcmp, except that the result only depends on part of
500 * the input data - differences in the head or tail are ignored. Functionally equivalent to:
501 *
502 * memcmp(a + skip_head, b + skip_head, size - skip_head - skip_tail)
503 *
504 * Time taken depends on \p n, but not on \p skip_head or \p skip_tail .
505 *
506 * Behaviour is undefined if ( \p skip_head + \p skip_tail) > \p n.
507 *
508 * \param a Secret. Pointer to the first buffer, containing at least \p n bytes. May not be NULL.
509 * \param b Secret. Pointer to the second buffer, containing at least \p n bytes. May not be NULL.
510 * \param n The number of bytes to examine (total size of the buffers).
511 * \param skip_head Secret. The number of bytes to treat as non-significant at the start of the buffer.
512 * These bytes will still be read.
513 * \param skip_tail Secret. The number of bytes to treat as non-significant at the end of the buffer.
514 * These bytes will still be read.
515 *
516 * \return Zero if the contents of the two buffers are the same, otherwise non-zero.
517 */
518int mbedtls_ct_memcmp_partial(const void *a,
519 const void *b,
520 size_t n,
521 size_t skip_head,
522 size_t skip_tail);
523
524#endif
525
Dave Rodgman205295c2023-08-01 14:10:56 +0100526/* Include the implementation of static inline functions above. */
527#include "constant_time_impl.h"
Dave Rodgmana02b3682023-07-14 13:43:39 +0100528
Gabor Mezei291df7b2021-10-19 11:27:17 +0200529#endif /* MBEDTLS_CONSTANT_TIME_INTERNAL_H */