blob: bfeb8c55ec5e297f5022ad234ab6eb72cd7e7bc3 [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
gabor-mezei-armdb9a38c2021-09-27 11:28:54 +020023#include "common.h"
24
gabor-mezei-arm3f90fd52021-09-27 12:55:33 +020025#if defined(MBEDTLS_BIGNUM_C)
26#include "mbedtls/bignum.h"
27#endif
28
gabor-mezei-arm1349ffd2021-09-27 14:28:31 +020029#if defined(MBEDTLS_SSL_TLS_C)
30#include "ssl_misc.h"
31#endif
32
gabor-mezei-armdb9a38c2021-09-27 11:28:54 +020033#include <stddef.h>
34
gabor-mezei-armdb9a38c2021-09-27 11:28:54 +020035
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020036/** Turn a value into a mask:
37 * - if \p value == 0, return the all-bits 0 mask, aka 0
Gabor Mezeia316fc82021-10-18 16:28:27 +020038 * - otherwise, return the all-bits 1 mask, aka (unsigned) -1
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020039 *
40 * This function can be used to write constant-time code by replacing branches
41 * with bit operations using masks.
42 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020043 * \param value The value to analyze.
44 *
45 * \return Zero if \p value is zero, otherwise all-bits-one.
46 */
Gilles Peskine449bd832023-01-11 14:50:10 +010047unsigned mbedtls_ct_uint_mask(unsigned value);
gabor-mezei-arm3733bf82021-09-27 11:49:42 +020048
Andrzej Kurek084334c2022-09-27 14:19:50 -040049#if defined(MBEDTLS_SSL_SOME_SUITES_USE_MAC)
Gabor Mezei6a426c92021-10-20 11:17:43 +020050
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020051/** Turn a value into a mask:
52 * - if \p value == 0, return the all-bits 0 mask, aka 0
53 * - otherwise, return the all-bits 1 mask, aka (size_t) -1
54 *
55 * This function can be used to write constant-time code by replacing branches
56 * with bit operations using masks.
57 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020058 * \param value The value to analyze.
59 *
60 * \return Zero if \p value is zero, otherwise all-bits-one.
61 */
Gilles Peskine449bd832023-01-11 14:50:10 +010062size_t mbedtls_ct_size_mask(size_t value);
gabor-mezei-armc76227d2021-09-27 11:53:54 +020063
Andrzej Kurek084334c2022-09-27 14:19:50 -040064#endif /* MBEDTLS_SSL_SOME_SUITES_USE_MAC */
Gabor Mezei6a426c92021-10-20 11:17:43 +020065
gabor-mezei-arm9cb55692021-08-11 15:07:02 +020066#if defined(MBEDTLS_BIGNUM_C)
67
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020068/** Turn a value into a mask:
69 * - if \p value == 0, return the all-bits 0 mask, aka 0
Gabor Mezeia316fc82021-10-18 16:28:27 +020070 * - otherwise, return the all-bits 1 mask, aka (mbedtls_mpi_uint) -1
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020071 *
72 * This function can be used to write constant-time code by replacing branches
73 * with bit operations using masks.
74 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020075 * \param value The value to analyze.
76 *
77 * \return Zero if \p value is zero, otherwise all-bits-one.
78 */
Gilles Peskine449bd832023-01-11 14:50:10 +010079mbedtls_mpi_uint mbedtls_ct_mpi_uint_mask(mbedtls_mpi_uint value);
gabor-mezei-arm9cb55692021-08-11 15:07:02 +020080
81#endif /* MBEDTLS_BIGNUM_C */
82
Gabor Mezeie2123792021-10-18 17:05:06 +020083#if defined(MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC)
84
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020085/** Constant-flow mask generation for "greater or equal" comparison:
86 * - if \p x >= \p y, return all-bits 1, that is (size_t) -1
87 * - otherwise, return all bits 0, that is 0
88 *
89 * This function can be used to write constant-time code by replacing branches
90 * with bit operations using masks.
91 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +020092 * \param x The first value to analyze.
93 * \param y The second value to analyze.
94 *
95 * \return All-bits-one if \p x is greater or equal than \p y,
96 * otherwise zero.
97 */
Gilles Peskine449bd832023-01-11 14:50:10 +010098size_t mbedtls_ct_size_mask_ge(size_t x,
99 size_t y);
gabor-mezei-arm8d1d5fd2021-09-27 12:15:19 +0200100
Gabor Mezeie2123792021-10-18 17:05:06 +0200101#endif /* MBEDTLS_SSL_SOME_SUITES_USE_TLS_CBC */
102
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200103/** Constant-flow boolean "equal" comparison:
104 * return x == y
105 *
106 * This is equivalent to \p x == \p y, but is likely to be compiled
107 * to code using bitwise operation rather than a branch.
108 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200109 * \param x The first value to analyze.
110 * \param y The second value to analyze.
111 *
112 * \return 1 if \p x equals to \p y, otherwise 0.
113 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100114unsigned mbedtls_ct_size_bool_eq(size_t x,
115 size_t y);
gabor-mezei-arm5a854422021-09-27 12:25:07 +0200116
gabor-mezei-arm3f90fd52021-09-27 12:55:33 +0200117#if defined(MBEDTLS_BIGNUM_C)
118
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200119/** Decide if an integer is less than the other, without branches.
120 *
121 * This is equivalent to \p x < \p y, but is likely to be compiled
122 * to code using bitwise operation rather than a branch.
123 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200124 * \param x The first value to analyze.
125 * \param y The second value to analyze.
126 *
127 * \return 1 if \p x is less than \p y, otherwise 0.
128 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100129unsigned mbedtls_ct_mpi_uint_lt(const mbedtls_mpi_uint x,
130 const mbedtls_mpi_uint y);
gabor-mezei-arm3f90fd52021-09-27 12:55:33 +0200131
Janos Follath23bdeca2022-07-22 18:24:06 +0100132/**
Janos Follath63184682022-08-11 17:42:59 +0100133 * \brief Check if one unsigned MPI is less than another in constant
134 * time.
Janos Follath23bdeca2022-07-22 18:24:06 +0100135 *
Janos Follathb7a88ec2022-08-19 12:24:40 +0100136 * \param A The left-hand MPI. This must point to an array of limbs
137 * with the same allocated length as \p B.
138 * \param B The right-hand MPI. This must point to an array of limbs
139 * with the same allocated length as \p A.
Janos Follathaf3f39c2022-08-22 09:06:32 +0100140 * \param limbs The number of limbs in \p A and \p B.
Gilles Peskine95b5add2022-11-09 11:18:38 +0100141 * This must not be 0.
Janos Follath23bdeca2022-07-22 18:24:06 +0100142 *
143 * \return The result of the comparison:
Janos Follathb7a88ec2022-08-19 12:24:40 +0100144 * \c 1 if \p A is less than \p B.
145 * \c 0 if \p A is greater than or equal to \p B.
Janos Follath23bdeca2022-07-22 18:24:06 +0100146 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100147unsigned mbedtls_mpi_core_lt_ct(const mbedtls_mpi_uint *A,
148 const mbedtls_mpi_uint *B,
149 size_t limbs);
gabor-mezei-arm3f90fd52021-09-27 12:55:33 +0200150#endif /* MBEDTLS_BIGNUM_C */
gabor-mezei-armb2dbf2c2021-09-27 12:59:30 +0200151
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200152/** Choose between two integer values without branches.
153 *
154 * This is equivalent to `condition ? if1 : if0`, but is likely to be compiled
155 * to code using bitwise operation rather than a branch.
156 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200157 * \param condition Condition to test.
158 * \param if1 Value to use if \p condition is nonzero.
159 * \param if0 Value to use if \p condition is zero.
160 *
161 * \return \c if1 if \p condition is nonzero, otherwise \c if0.
162 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100163unsigned mbedtls_ct_uint_if(unsigned condition,
164 unsigned if1,
165 unsigned if0);
gabor-mezei-armb2dbf2c2021-09-27 12:59:30 +0200166
gabor-mezei-armbe8d98b2021-09-27 13:17:15 +0200167#if defined(MBEDTLS_BIGNUM_C)
168
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200169/** Conditionally assign a value without branches.
170 *
171 * This is equivalent to `if ( condition ) dest = src`, but is likely
172 * to be compiled to code using bitwise operation rather than a branch.
173 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200174 * \param n \p dest and \p src must be arrays of limbs of size n.
175 * \param dest The MPI to conditionally assign to. This must point
176 * to an initialized MPI.
177 * \param src The MPI to be assigned from. This must point to an
178 * initialized MPI.
179 * \param condition Condition to test, must be 0 or 1.
180 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100181void mbedtls_ct_mpi_uint_cond_assign(size_t n,
182 mbedtls_mpi_uint *dest,
183 const mbedtls_mpi_uint *src,
184 unsigned char condition);
gabor-mezei-armbe8d98b2021-09-27 13:17:15 +0200185
186#endif /* MBEDTLS_BIGNUM_C */
gabor-mezei-arm394aeaa2021-09-27 13:31:06 +0200187
Przemek Stekiel89ad6232022-09-27 13:36:12 +0200188#if defined(MBEDTLS_SSL_SOME_SUITES_USE_MAC)
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200189
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200190/** Conditional memcpy without branches.
191 *
Gabor Mezei642eeb22021-11-03 16:13:32 +0100192 * This is equivalent to `if ( c1 == c2 ) memcpy(dest, src, len)`, but is likely
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200193 * to be compiled to code using bitwise operation rather than a branch.
194 *
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200195 * \param dest The pointer to conditionally copy to.
Gabor Mezeia316fc82021-10-18 16:28:27 +0200196 * \param src The pointer to copy from. Shouldn't overlap with \p dest.
gabor-mezei-arm90d96cc2021-08-11 16:40:35 +0200197 * \param len The number of bytes to copy.
198 * \param c1 The first value to analyze in the condition.
199 * \param c2 The second value to analyze in the condition.
200 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100201void mbedtls_ct_memcpy_if_eq(unsigned char *dest,
202 const unsigned char *src,
203 size_t len,
204 size_t c1, size_t c2);
gabor-mezei-arm0e7f71e2021-09-27 13:57:45 +0200205
206/** Copy data from a secret position with constant flow.
207 *
208 * This function copies \p len bytes from \p src_base + \p offset_secret to \p
209 * dst, with a code flow and memory access pattern that does not depend on \p
210 * offset_secret, but only on \p offset_min, \p offset_max and \p len.
Gabor Mezeia316fc82021-10-18 16:28:27 +0200211 * Functionally equivalent to `memcpy(dst, src + offset_secret, len)`.
gabor-mezei-arm0e7f71e2021-09-27 13:57:45 +0200212 *
Paul Elliott5260ce22022-05-09 18:15:54 +0100213 * \note This function reads from \p dest, but the value that
214 * is read does not influence the result and this
215 * function's behavior is well-defined regardless of the
216 * contents of the buffers. This may result in false
217 * positives from static or dynamic analyzers, especially
218 * if \p dest is not initialized.
219 *
Gabor Mezei63bbba52021-10-18 16:17:57 +0200220 * \param dest The destination buffer. This must point to a writable
gabor-mezei-arm0e7f71e2021-09-27 13:57:45 +0200221 * buffer of at least \p len bytes.
Gabor Mezei63bbba52021-10-18 16:17:57 +0200222 * \param src The base of the source buffer. This must point to a
gabor-mezei-arm0e7f71e2021-09-27 13:57:45 +0200223 * readable buffer of at least \p offset_max + \p len
Gabor Mezei63bbba52021-10-18 16:17:57 +0200224 * bytes. Shouldn't overlap with \p dest.
225 * \param offset The offset in the source buffer from which to copy.
gabor-mezei-arm0e7f71e2021-09-27 13:57:45 +0200226 * This must be no less than \p offset_min and no greater
227 * than \p offset_max.
Gabor Mezei63bbba52021-10-18 16:17:57 +0200228 * \param offset_min The minimal value of \p offset.
229 * \param offset_max The maximal value of \p offset.
gabor-mezei-arm0e7f71e2021-09-27 13:57:45 +0200230 * \param len The number of bytes to copy.
231 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100232void mbedtls_ct_memcpy_offset(unsigned char *dest,
233 const unsigned char *src,
234 size_t offset,
235 size_t offset_min,
236 size_t offset_max,
237 size_t len);
gabor-mezei-arm1349ffd2021-09-27 14:28:31 +0200238
Przemek Stekiel89ad6232022-09-27 13:36:12 +0200239#endif /* MBEDTLS_SSL_SOME_SUITES_USE_MAC */
gabor-mezei-armfdb71182021-09-27 16:11:12 +0200240
Dave Rodgman0ee96832023-05-09 09:49:01 +0100241#if defined(MBEDTLS_BASE64_C)
242
Dave Rodgman8c94e212023-05-09 10:39:03 +0100243/** Constant-flow char selection
Dave Rodgman0ee96832023-05-09 09:49:01 +0100244 *
Dave Rodgman8c94e212023-05-09 10:39:03 +0100245 * \param low Bottom of range
246 * \param high Top of range
247 * \param c Value to compare to range
248 * \param t Value to return, if in range
249 *
250 * \return \p t if \p low <= \p c <= \p high, 0 otherwise.
Dave Rodgman0ee96832023-05-09 09:49:01 +0100251 */
Dave Rodgman8c94e212023-05-09 10:39:03 +0100252static inline unsigned char mbedtls_ct_uchar_in_range_if(unsigned char low,
253 unsigned char high,
254 unsigned char c,
255 unsigned char t)
256{
257 /* low_mask is: 0 if low <= c, 0x...ff if low > c */
258 unsigned low_mask = ((unsigned) c - low) >> 8;
259 /* high_mask is: 0 if c <= high, 0x...ff if c > high */
260 unsigned high_mask = ((unsigned) high - c) >> 8;
261 return (unsigned char)
262 mbedtls_ct_uint_if(~mbedtls_ct_mpi_uint_mask(low_mask | high_mask), t, 0);
263}
Dave Rodgman0ee96832023-05-09 09:49:01 +0100264
265#endif /* MBEDTLS_BASE64_C */
266
Dave Rodgman0afe0012023-05-09 11:09:52 +0100267
268#if defined(MBEDTLS_PKCS1_V15) && defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_RSA_ALT)
269
270/** Constant-flow "greater than" comparison:
271 * return x > y
272 *
273 * This is equivalent to \p x > \p y, but is likely to be compiled
274 * to code using bitwise operation rather than a branch.
275 *
276 * \param x The first value to analyze.
277 * \param y The second value to analyze.
278 *
279 * \return 1 if \p x greater than \p y, otherwise 0.
280 */
281unsigned mbedtls_ct_size_gt(size_t x, size_t y);
282
283/** Shift some data towards the left inside a buffer.
284 *
285 * `mbedtls_ct_mem_move_to_left(start, total, offset)` is functionally
286 * equivalent to
287 * ```
288 * memmove(start, start + offset, total - offset);
289 * memset(start + offset, 0, total - offset);
290 * ```
291 * but it strives to use a memory access pattern (and thus total timing)
292 * that does not depend on \p offset. This timing independence comes at
293 * the expense of performance.
294 *
295 * \param start Pointer to the start of the buffer.
296 * \param total Total size of the buffer.
297 * \param offset Offset from which to copy \p total - \p offset bytes.
298 */
299void mbedtls_ct_mem_move_to_left(void *start,
Dave Rodgman19e8cd02023-05-09 11:10:21 +0100300 size_t total,
301 size_t offset);
Dave Rodgman0afe0012023-05-09 11:09:52 +0100302
303#endif /* defined(MBEDTLS_PKCS1_V15) && defined(MBEDTLS_RSA_C) && !defined(MBEDTLS_RSA_ALT) */
304
Gabor Mezei291df7b2021-10-19 11:27:17 +0200305#endif /* MBEDTLS_CONSTANT_TIME_INTERNAL_H */