Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 1 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
| 2 | * All rights reserved. |
| 3 | * |
| 4 | * This package is an SSL implementation written |
| 5 | * by Eric Young (eay@cryptsoft.com). |
| 6 | * The implementation was written so as to conform with Netscapes SSL. |
| 7 | * |
| 8 | * This library is free for commercial and non-commercial use as long as |
| 9 | * the following conditions are aheared to. The following conditions |
| 10 | * apply to all code found in this distribution, be it the RC4, RSA, |
| 11 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation |
| 12 | * included with this distribution is covered by the same copyright terms |
| 13 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). |
| 14 | * |
| 15 | * Copyright remains Eric Young's, and as such any Copyright notices in |
| 16 | * the code are not to be removed. |
| 17 | * If this package is used in a product, Eric Young should be given attribution |
| 18 | * as the author of the parts of the library used. |
| 19 | * This can be in the form of a textual message at program startup or |
| 20 | * in documentation (online or textual) provided with the package. |
| 21 | * |
| 22 | * Redistribution and use in source and binary forms, with or without |
| 23 | * modification, are permitted provided that the following conditions |
| 24 | * are met: |
| 25 | * 1. Redistributions of source code must retain the copyright |
| 26 | * notice, this list of conditions and the following disclaimer. |
| 27 | * 2. Redistributions in binary form must reproduce the above copyright |
| 28 | * notice, this list of conditions and the following disclaimer in the |
| 29 | * documentation and/or other materials provided with the distribution. |
| 30 | * 3. All advertising materials mentioning features or use of this software |
| 31 | * must display the following acknowledgement: |
| 32 | * "This product includes cryptographic software written by |
| 33 | * Eric Young (eay@cryptsoft.com)" |
| 34 | * The word 'cryptographic' can be left out if the rouines from the library |
| 35 | * being used are not cryptographic related :-). |
| 36 | * 4. If you include any Windows specific code (or a derivative thereof) from |
| 37 | * the apps directory (application code) you must include an acknowledgement: |
| 38 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" |
| 39 | * |
| 40 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
| 41 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 43 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 44 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 45 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 46 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 48 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 49 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 50 | * SUCH DAMAGE. |
| 51 | * |
| 52 | * The licence and distribution terms for any publically available version or |
| 53 | * derivative of this code cannot be changed. i.e. this code cannot simply be |
| 54 | * copied and put under another distribution licence |
| 55 | * [including the GNU Public Licence.] |
| 56 | */ |
| 57 | /* ==================================================================== |
| 58 | * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved. |
| 59 | * |
| 60 | * Redistribution and use in source and binary forms, with or without |
| 61 | * modification, are permitted provided that the following conditions |
| 62 | * are met: |
| 63 | * |
| 64 | * 1. Redistributions of source code must retain the above copyright |
| 65 | * notice, this list of conditions and the following disclaimer. |
| 66 | * |
| 67 | * 2. Redistributions in binary form must reproduce the above copyright |
| 68 | * notice, this list of conditions and the following disclaimer in |
| 69 | * the documentation and/or other materials provided with the |
| 70 | * distribution. |
| 71 | * |
| 72 | * 3. All advertising materials mentioning features or use of this |
| 73 | * software must display the following acknowledgment: |
| 74 | * "This product includes software developed by the OpenSSL Project |
| 75 | * for use in the OpenSSL Toolkit. (http://www.openssl.org/)" |
| 76 | * |
| 77 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to |
| 78 | * endorse or promote products derived from this software without |
| 79 | * prior written permission. For written permission, please contact |
| 80 | * openssl-core@openssl.org. |
| 81 | * |
| 82 | * 5. Products derived from this software may not be called "OpenSSL" |
| 83 | * nor may "OpenSSL" appear in their names without prior written |
| 84 | * permission of the OpenSSL Project. |
| 85 | * |
| 86 | * 6. Redistributions of any form whatsoever must retain the following |
| 87 | * acknowledgment: |
| 88 | * "This product includes software developed by the OpenSSL Project |
| 89 | * for use in the OpenSSL Toolkit (http://www.openssl.org/)" |
| 90 | * |
| 91 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY |
| 92 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 93 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 94 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR |
| 95 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 96 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| 97 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 98 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 99 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
| 100 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 101 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
| 102 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
| 103 | * ==================================================================== |
| 104 | * |
| 105 | * This product includes cryptographic software written by Eric Young |
| 106 | * (eay@cryptsoft.com). This product includes software written by Tim |
| 107 | * Hudson (tjh@cryptsoft.com). */ |
| 108 | |
| 109 | #ifndef OPENSSL_HEADER_CRYPTO_INTERNAL_H |
| 110 | #define OPENSSL_HEADER_CRYPTO_INTERNAL_H |
| 111 | |
Adam Langley | 98ad22e | 2014-08-26 13:38:19 -0700 | [diff] [blame] | 112 | #include <openssl/ex_data.h> |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 113 | |
Adam Langley | b2cb0ec | 2014-09-02 14:28:49 -0700 | [diff] [blame] | 114 | #if defined(__cplusplus) |
| 115 | extern "C" { |
| 116 | #endif |
| 117 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 118 | |
| 119 | /* st_CRYPTO_EX_DATA_IMPL contains an ex_data implementation. See the comments |
| 120 | * in ex_data.h for details of the behaviour of each of the functions. */ |
| 121 | struct st_CRYPTO_EX_DATA_IMPL { |
| 122 | int (*new_class)(void); |
| 123 | void (*cleanup)(void); |
| 124 | |
| 125 | int (*get_new_index)(int class_value, long argl, void *argp, |
| 126 | CRYPTO_EX_new *new_func, CRYPTO_EX_dup *dup_func, |
| 127 | CRYPTO_EX_free *free_func); |
| 128 | int (*new_ex_data)(int class_value, void *obj, CRYPTO_EX_DATA *ad); |
| 129 | int (*dup_ex_data)(int class_value, CRYPTO_EX_DATA *to, |
| 130 | const CRYPTO_EX_DATA *from); |
| 131 | void (*free_ex_data)(int class_value, void *obj, CRYPTO_EX_DATA *ad); |
| 132 | }; |
| 133 | |
| 134 | |
Adam Langley | 46a7ca0 | 2015-01-05 16:29:28 -0800 | [diff] [blame] | 135 | #if defined(_MSC_VER) |
Adam Langley | 98ad22e | 2014-08-26 13:38:19 -0700 | [diff] [blame] | 136 | #define OPENSSL_U64(x) x##UI64 |
| 137 | #else |
| 138 | |
| 139 | #if defined(OPENSSL_64_BIT) |
| 140 | #define OPENSSL_U64(x) x##UL |
| 141 | #else |
| 142 | #define OPENSSL_U64(x) x##ULL |
| 143 | #endif |
| 144 | |
Adam Langley | 46a7ca0 | 2015-01-05 16:29:28 -0800 | [diff] [blame] | 145 | #endif /* defined(_MSC_VER) */ |
Adam Langley | 98ad22e | 2014-08-26 13:38:19 -0700 | [diff] [blame] | 146 | |
Adam Langley | 3e65265 | 2015-01-09 15:44:37 -0800 | [diff] [blame] | 147 | #if defined(OPENSSL_X86) || defined(OPENSSL_X86_64) || defined(OPENSSL_ARM) || \ |
| 148 | defined(OPENSSL_AARCH64) |
David Benjamin | a70c75c | 2014-09-11 19:11:15 -0400 | [diff] [blame] | 149 | /* OPENSSL_cpuid_setup initializes OPENSSL_ia32cap_P. */ |
| 150 | void OPENSSL_cpuid_setup(void); |
| 151 | #endif |
Adam Langley | 98ad22e | 2014-08-26 13:38:19 -0700 | [diff] [blame] | 152 | |
Adam Langley | b15d813 | 2014-11-03 18:51:20 -0800 | [diff] [blame] | 153 | #if !defined(inline) |
| 154 | #define inline __inline |
| 155 | #endif |
| 156 | |
| 157 | |
| 158 | /* Constant-time utility functions. |
| 159 | * |
| 160 | * The following methods return a bitmask of all ones (0xff...f) for true and 0 |
| 161 | * for false. This is useful for choosing a value based on the result of a |
| 162 | * conditional in constant time. For example, |
| 163 | * |
| 164 | * if (a < b) { |
| 165 | * c = a; |
| 166 | * } else { |
| 167 | * c = b; |
| 168 | * } |
| 169 | * |
| 170 | * can be written as |
| 171 | * |
| 172 | * unsigned int lt = constant_time_lt(a, b); |
Adam Langley | a952d96 | 2014-11-03 19:15:40 -0800 | [diff] [blame] | 173 | * c = constant_time_select(lt, a, b); */ |
Adam Langley | b15d813 | 2014-11-03 18:51:20 -0800 | [diff] [blame] | 174 | |
| 175 | /* constant_time_msb returns the given value with the MSB copied to all the |
Adam Langley | 9ed9dae | 2014-11-04 11:22:01 -0800 | [diff] [blame] | 176 | * other bits. */ |
Adam Langley | b15d813 | 2014-11-03 18:51:20 -0800 | [diff] [blame] | 177 | static inline unsigned int constant_time_msb(unsigned int a) { |
| 178 | return (unsigned int)((int)(a) >> (sizeof(int) * 8 - 1)); |
| 179 | } |
| 180 | |
| 181 | /* constant_time_lt returns 0xff..f if a < b and 0 otherwise. */ |
| 182 | static inline unsigned int constant_time_lt(unsigned int a, unsigned int b) { |
Adam Langley | 9ed9dae | 2014-11-04 11:22:01 -0800 | [diff] [blame] | 183 | /* Consider the two cases of the problem: |
| 184 | * msb(a) == msb(b): a < b iff the MSB of a - b is set. |
| 185 | * msb(a) != msb(b): a < b iff the MSB of b is set. |
| 186 | * |
| 187 | * If msb(a) == msb(b) then the following evaluates as: |
| 188 | * msb(a^((a^b)|((a-b)^a))) == |
| 189 | * msb(a^((a-b) ^ a)) == (because msb(a^b) == 0) |
| 190 | * msb(a^a^(a-b)) == (rearranging) |
| 191 | * msb(a-b) (because ∀x. x^x == 0) |
| 192 | * |
| 193 | * Else, if msb(a) != msb(b) then the following evaluates as: |
| 194 | * msb(a^((a^b)|((a-b)^a))) == |
| 195 | * msb(a^(𝟙 | ((a-b)^a))) == (because msb(a^b) == 1 and 𝟙 |
| 196 | * represents a value s.t. msb(𝟙) = 1) |
| 197 | * msb(a^𝟙) == (because ORing with 1 results in 1) |
| 198 | * msb(b) |
| 199 | * |
| 200 | * |
| 201 | * Here is an SMT-LIB verification of this formula: |
| 202 | * |
| 203 | * (define-fun lt ((a (_ BitVec 32)) (b (_ BitVec 32))) (_ BitVec 32) |
| 204 | * (bvxor a (bvor (bvxor a b) (bvxor (bvsub a b) a))) |
| 205 | * ) |
| 206 | * |
| 207 | * (declare-fun a () (_ BitVec 32)) |
| 208 | * (declare-fun b () (_ BitVec 32)) |
| 209 | * |
| 210 | * (assert (not (= (= #x00000001 (bvlshr (lt a b) #x0000001f)) (bvult a b)))) |
| 211 | * (check-sat) |
| 212 | * (get-model) |
| 213 | */ |
| 214 | return constant_time_msb(a^((a^b)|((a-b)^a))); |
Adam Langley | b15d813 | 2014-11-03 18:51:20 -0800 | [diff] [blame] | 215 | } |
| 216 | |
| 217 | /* constant_time_lt_8 acts like |constant_time_lt| but returns an 8-bit mask. */ |
| 218 | static inline uint8_t constant_time_lt_8(unsigned int a, unsigned int b) { |
| 219 | return (uint8_t)(constant_time_lt(a, b)); |
| 220 | } |
| 221 | |
| 222 | /* constant_time_gt returns 0xff..f if a >= b and 0 otherwise. */ |
| 223 | static inline unsigned int constant_time_ge(unsigned int a, unsigned int b) { |
Adam Langley | 9ed9dae | 2014-11-04 11:22:01 -0800 | [diff] [blame] | 224 | return ~constant_time_lt(a, b); |
Adam Langley | b15d813 | 2014-11-03 18:51:20 -0800 | [diff] [blame] | 225 | } |
| 226 | |
| 227 | /* constant_time_ge_8 acts like |constant_time_ge| but returns an 8-bit mask. */ |
| 228 | static inline uint8_t constant_time_ge_8(unsigned int a, unsigned int b) { |
| 229 | return (uint8_t)(constant_time_ge(a, b)); |
| 230 | } |
| 231 | |
| 232 | /* constant_time_is_zero returns 0xff..f if a == 0 and 0 otherwise. */ |
| 233 | static inline unsigned int constant_time_is_zero(unsigned int a) { |
Adam Langley | 9ed9dae | 2014-11-04 11:22:01 -0800 | [diff] [blame] | 234 | /* Here is an SMT-LIB verification of this formula: |
| 235 | * |
| 236 | * (define-fun is_zero ((a (_ BitVec 32))) (_ BitVec 32) |
| 237 | * (bvand (bvnot a) (bvsub a #x00000001)) |
| 238 | * ) |
| 239 | * |
| 240 | * (declare-fun a () (_ BitVec 32)) |
| 241 | * |
| 242 | * (assert (not (= (= #x00000001 (bvlshr (is_zero a) #x0000001f)) (= a #x00000000)))) |
| 243 | * (check-sat) |
| 244 | * (get-model) |
| 245 | */ |
Adam Langley | b15d813 | 2014-11-03 18:51:20 -0800 | [diff] [blame] | 246 | return constant_time_msb(~a & (a - 1)); |
| 247 | } |
| 248 | |
| 249 | /* constant_time_is_zero_8 acts like constant_time_is_zero but returns an 8-bit |
| 250 | * mask. */ |
| 251 | static inline uint8_t constant_time_is_zero_8(unsigned int a) { |
| 252 | return (uint8_t)(constant_time_is_zero(a)); |
| 253 | } |
| 254 | |
| 255 | /* constant_time_eq returns 0xff..f if a == b and 0 otherwise. */ |
| 256 | static inline unsigned int constant_time_eq(unsigned int a, unsigned int b) { |
| 257 | return constant_time_is_zero(a ^ b); |
| 258 | } |
| 259 | |
Adam Langley | af6e45b | 2014-11-03 19:34:49 -0800 | [diff] [blame] | 260 | /* constant_time_eq_8 acts like |constant_time_eq| but returns an 8-bit mask. */ |
Adam Langley | b15d813 | 2014-11-03 18:51:20 -0800 | [diff] [blame] | 261 | static inline uint8_t constant_time_eq_8(unsigned int a, unsigned int b) { |
| 262 | return (uint8_t)(constant_time_eq(a, b)); |
| 263 | } |
| 264 | |
Adam Langley | af6e45b | 2014-11-03 19:34:49 -0800 | [diff] [blame] | 265 | /* constant_time_eq_int acts like |constant_time_eq| but works on int values. */ |
| 266 | static inline unsigned int constant_time_eq_int(int a, int b) { |
| 267 | return constant_time_eq((unsigned)(a), (unsigned)(b)); |
| 268 | } |
| 269 | |
| 270 | /* constant_time_eq_int_8 acts like |constant_time_eq_int| but returns an 8-bit |
| 271 | * mask. */ |
| 272 | static inline uint8_t constant_time_eq_int_8(int a, int b) { |
| 273 | return constant_time_eq_8((unsigned)(a), (unsigned)(b)); |
| 274 | } |
| 275 | |
Adam Langley | a952d96 | 2014-11-03 19:15:40 -0800 | [diff] [blame] | 276 | /* constant_time_select returns (mask & a) | (~mask & b). When |mask| is all 1s |
| 277 | * or all 0s (as returned by the methods above), the select methods return |
| 278 | * either |a| (if |mask| is nonzero) or |b| (if |mask| is zero). */ |
| 279 | static inline unsigned int constant_time_select(unsigned int mask, |
| 280 | unsigned int a, unsigned int b) { |
| 281 | return (mask & a) | (~mask & b); |
| 282 | } |
| 283 | |
| 284 | /* constant_time_select_8 acts like |constant_time_select| but operates on |
| 285 | * 8-bit values. */ |
| 286 | static inline uint8_t constant_time_select_8(uint8_t mask, uint8_t a, |
| 287 | uint8_t b) { |
| 288 | return (uint8_t)(constant_time_select(mask, a, b)); |
| 289 | } |
| 290 | |
| 291 | /* constant_time_select_int acts like |constant_time_select| but operates on |
| 292 | * ints. */ |
| 293 | static inline int constant_time_select_int(unsigned int mask, int a, int b) { |
| 294 | return (int)(constant_time_select(mask, (unsigned)(a), (unsigned)(b))); |
| 295 | } |
| 296 | |
Adam Langley | b15d813 | 2014-11-03 18:51:20 -0800 | [diff] [blame] | 297 | |
Adam Langley | 95c29f3 | 2014-06-20 12:00:00 -0700 | [diff] [blame] | 298 | #if defined(__cplusplus) |
| 299 | } /* extern C */ |
| 300 | #endif |
| 301 | |
| 302 | #endif /* OPENSSL_HEADER_CRYPTO_INTERNAL_H */ |