Manuel Pégourié-Gonnard | 3d49b9d | 2014-06-06 14:48:09 +0200 | [diff] [blame] | 1 | #if defined(POLARSSL_PLATFORM_C) |
| 2 | #include "polarssl/platform.h" |
| 3 | #else |
Rich Evans | 00ab470 | 2015-02-06 13:43:58 +0000 | [diff] [blame^] | 4 | #include <stdio.h> |
| 5 | #define polarssl_printf printf |
| 6 | #define polarssl_fprintf fprintf |
Manuel Pégourié-Gonnard | 3d49b9d | 2014-06-06 14:48:09 +0200 | [diff] [blame] | 7 | #define polarssl_malloc malloc |
| 8 | #define polarssl_free free |
| 9 | #endif |
| 10 | |
Paul Bakker | b3dcbc1 | 2011-03-13 16:57:25 +0000 | [diff] [blame] | 11 | #ifdef _MSC_VER |
| 12 | #include <basetsd.h> |
| 13 | typedef UINT32 uint32_t; |
| 14 | #else |
| 15 | #include <inttypes.h> |
| 16 | #endif |
| 17 | |
Paul Bakker | 1934318 | 2013-08-16 13:31:10 +0200 | [diff] [blame] | 18 | #include <assert.h> |
| 19 | #include <stdlib.h> |
| 20 | #include <string.h> |
| 21 | |
Paul Bakker | b3dcbc1 | 2011-03-13 16:57:25 +0000 | [diff] [blame] | 22 | /* |
| 23 | * 32-bit integer manipulation macros (big endian) |
| 24 | */ |
Paul Bakker | 5c2364c | 2012-10-01 14:41:15 +0000 | [diff] [blame] | 25 | #ifndef GET_UINT32_BE |
| 26 | #define GET_UINT32_BE(n,b,i) \ |
Paul Bakker | b3dcbc1 | 2011-03-13 16:57:25 +0000 | [diff] [blame] | 27 | { \ |
Paul Bakker | 5c2364c | 2012-10-01 14:41:15 +0000 | [diff] [blame] | 28 | (n) = ( (uint32_t) (b)[(i) ] << 24 ) \ |
| 29 | | ( (uint32_t) (b)[(i) + 1] << 16 ) \ |
| 30 | | ( (uint32_t) (b)[(i) + 2] << 8 ) \ |
| 31 | | ( (uint32_t) (b)[(i) + 3] ); \ |
Paul Bakker | b3dcbc1 | 2011-03-13 16:57:25 +0000 | [diff] [blame] | 32 | } |
| 33 | #endif |
| 34 | |
Paul Bakker | 5c2364c | 2012-10-01 14:41:15 +0000 | [diff] [blame] | 35 | #ifndef PUT_UINT32_BE |
| 36 | #define PUT_UINT32_BE(n,b,i) \ |
Paul Bakker | b3dcbc1 | 2011-03-13 16:57:25 +0000 | [diff] [blame] | 37 | { \ |
| 38 | (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \ |
| 39 | (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \ |
| 40 | (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \ |
| 41 | (b)[(i) + 3] = (unsigned char) ( (n) ); \ |
| 42 | } |
| 43 | #endif |
| 44 | |
Paul Bakker | b6c5d2e | 2013-06-25 16:25:17 +0200 | [diff] [blame] | 45 | static int unhexify(unsigned char *obuf, const char *ibuf) |
Paul Bakker | 367dae4 | 2009-06-28 21:50:27 +0000 | [diff] [blame] | 46 | { |
| 47 | unsigned char c, c2; |
| 48 | int len = strlen(ibuf) / 2; |
Rich Evans | 1fef5ff | 2015-02-02 11:57:21 +0000 | [diff] [blame] | 49 | assert( strlen(ibuf) % 2 == 0 ); // must be even number of bytes |
Paul Bakker | 367dae4 | 2009-06-28 21:50:27 +0000 | [diff] [blame] | 50 | |
| 51 | while (*ibuf != 0) |
| 52 | { |
| 53 | c = *ibuf++; |
| 54 | if( c >= '0' && c <= '9' ) |
| 55 | c -= '0'; |
| 56 | else if( c >= 'a' && c <= 'f' ) |
| 57 | c -= 'a' - 10; |
| 58 | else if( c >= 'A' && c <= 'F' ) |
| 59 | c -= 'A' - 10; |
| 60 | else |
| 61 | assert( 0 ); |
| 62 | |
| 63 | c2 = *ibuf++; |
| 64 | if( c2 >= '0' && c2 <= '9' ) |
| 65 | c2 -= '0'; |
| 66 | else if( c2 >= 'a' && c2 <= 'f' ) |
| 67 | c2 -= 'a' - 10; |
| 68 | else if( c2 >= 'A' && c2 <= 'F' ) |
| 69 | c2 -= 'A' - 10; |
| 70 | else |
| 71 | assert( 0 ); |
| 72 | |
| 73 | *obuf++ = ( c << 4 ) | c2; |
| 74 | } |
| 75 | |
| 76 | return len; |
| 77 | } |
| 78 | |
Rich Evans | 4291445 | 2015-02-02 12:09:25 +0000 | [diff] [blame] | 79 | static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len ) |
Paul Bakker | 367dae4 | 2009-06-28 21:50:27 +0000 | [diff] [blame] | 80 | { |
| 81 | unsigned char l, h; |
| 82 | |
Rich Evans | 4291445 | 2015-02-02 12:09:25 +0000 | [diff] [blame] | 83 | while( len != 0 ) |
Paul Bakker | 367dae4 | 2009-06-28 21:50:27 +0000 | [diff] [blame] | 84 | { |
Rich Evans | 4291445 | 2015-02-02 12:09:25 +0000 | [diff] [blame] | 85 | h = *ibuf / 16; |
| 86 | l = *ibuf % 16; |
Paul Bakker | 367dae4 | 2009-06-28 21:50:27 +0000 | [diff] [blame] | 87 | |
| 88 | if( h < 10 ) |
| 89 | *obuf++ = '0' + h; |
| 90 | else |
| 91 | *obuf++ = 'a' + h - 10; |
| 92 | |
| 93 | if( l < 10 ) |
| 94 | *obuf++ = '0' + l; |
| 95 | else |
| 96 | *obuf++ = 'a' + l - 10; |
| 97 | |
| 98 | ++ibuf; |
| 99 | len--; |
| 100 | } |
| 101 | } |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 102 | |
| 103 | /** |
Manuel Pégourié-Gonnard | 0dc5e0d | 2014-06-13 21:09:26 +0200 | [diff] [blame] | 104 | * Allocate and zeroize a buffer. |
| 105 | * |
| 106 | * If the size if zero, a pointer to a zeroized 1-byte buffer is returned. |
| 107 | * |
| 108 | * For convenience, dies if allocation fails. |
| 109 | */ |
| 110 | static unsigned char *zero_alloc( size_t len ) |
| 111 | { |
| 112 | void *p; |
Rich Evans | 4291445 | 2015-02-02 12:09:25 +0000 | [diff] [blame] | 113 | size_t actual_len = ( len != 0 ) ? len : 1; |
Manuel Pégourié-Gonnard | 0dc5e0d | 2014-06-13 21:09:26 +0200 | [diff] [blame] | 114 | |
Paul Bakker | 4d0cfe8 | 2014-07-10 14:37:36 +0200 | [diff] [blame] | 115 | p = polarssl_malloc( actual_len ); |
| 116 | assert( p != NULL ); |
Manuel Pégourié-Gonnard | 0dc5e0d | 2014-06-13 21:09:26 +0200 | [diff] [blame] | 117 | |
| 118 | memset( p, 0x00, actual_len ); |
| 119 | |
| 120 | return( p ); |
| 121 | } |
| 122 | |
| 123 | /** |
Manuel Pégourié-Gonnard | 3d49b9d | 2014-06-06 14:48:09 +0200 | [diff] [blame] | 124 | * Allocate and fill a buffer from hex data. |
| 125 | * |
| 126 | * The buffer is sized exactly as needed. This allows to detect buffer |
| 127 | * overruns (including overreads) when running the test suite under valgrind. |
| 128 | * |
Manuel Pégourié-Gonnard | 0dc5e0d | 2014-06-13 21:09:26 +0200 | [diff] [blame] | 129 | * If the size if zero, a pointer to a zeroized 1-byte buffer is returned. |
| 130 | * |
Manuel Pégourié-Gonnard | 3d49b9d | 2014-06-06 14:48:09 +0200 | [diff] [blame] | 131 | * For convenience, dies if allocation fails. |
| 132 | */ |
| 133 | static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen ) |
| 134 | { |
| 135 | unsigned char *obuf; |
| 136 | |
Rich Evans | 4291445 | 2015-02-02 12:09:25 +0000 | [diff] [blame] | 137 | *olen = strlen( ibuf ) / 2; |
Manuel Pégourié-Gonnard | 3d49b9d | 2014-06-06 14:48:09 +0200 | [diff] [blame] | 138 | |
Manuel Pégourié-Gonnard | 0dc5e0d | 2014-06-13 21:09:26 +0200 | [diff] [blame] | 139 | if( *olen == 0 ) |
| 140 | return( zero_alloc( *olen ) ); |
| 141 | |
Paul Bakker | 4d0cfe8 | 2014-07-10 14:37:36 +0200 | [diff] [blame] | 142 | obuf = polarssl_malloc( *olen ); |
| 143 | assert( obuf != NULL ); |
Manuel Pégourié-Gonnard | 3d49b9d | 2014-06-06 14:48:09 +0200 | [diff] [blame] | 144 | |
| 145 | (void) unhexify( obuf, ibuf ); |
| 146 | |
| 147 | return( obuf ); |
| 148 | } |
| 149 | |
| 150 | /** |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 151 | * This function just returns data from rand(). |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 152 | * Although predictable and often similar on multiple |
| 153 | * runs, this does not result in identical random on |
| 154 | * each run. So do not use this if the results of a |
| 155 | * test depend on the random data that is generated. |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 156 | * |
| 157 | * rng_state shall be NULL. |
| 158 | */ |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 159 | static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len ) |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 160 | { |
Paul Bakker | f96f7b6 | 2014-04-30 16:02:38 +0200 | [diff] [blame] | 161 | #if !defined(__OpenBSD__) |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 162 | size_t i; |
| 163 | |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 164 | if( rng_state != NULL ) |
| 165 | rng_state = NULL; |
| 166 | |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 167 | for( i = 0; i < len; ++i ) |
| 168 | output[i] = rand(); |
Paul Bakker | f96f7b6 | 2014-04-30 16:02:38 +0200 | [diff] [blame] | 169 | #else |
| 170 | if( rng_state != NULL ) |
| 171 | rng_state = NULL; |
| 172 | |
| 173 | arc4random_buf( output, len ); |
| 174 | #endif /* !OpenBSD */ |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 175 | |
| 176 | return( 0 ); |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 177 | } |
| 178 | |
| 179 | /** |
| 180 | * This function only returns zeros |
| 181 | * |
| 182 | * rng_state shall be NULL. |
| 183 | */ |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 184 | static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len ) |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 185 | { |
| 186 | if( rng_state != NULL ) |
| 187 | rng_state = NULL; |
| 188 | |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 189 | memset( output, 0, len ); |
| 190 | |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 191 | return( 0 ); |
| 192 | } |
| 193 | |
| 194 | typedef struct |
| 195 | { |
| 196 | unsigned char *buf; |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 197 | size_t length; |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 198 | } rnd_buf_info; |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 199 | |
| 200 | /** |
| 201 | * This function returns random based on a buffer it receives. |
| 202 | * |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 203 | * rng_state shall be a pointer to a rnd_buf_info structure. |
| 204 | * |
| 205 | * The number of bytes released from the buffer on each call to |
| 206 | * the random function is specified by per_call. (Can be between |
| 207 | * 1 and 4) |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 208 | * |
| 209 | * After the buffer is empty it will return rand(); |
| 210 | */ |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 211 | static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len ) |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 212 | { |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 213 | rnd_buf_info *info = (rnd_buf_info *) rng_state; |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 214 | size_t use_len; |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 215 | |
| 216 | if( rng_state == NULL ) |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 217 | return( rnd_std_rand( NULL, output, len ) ); |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 218 | |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 219 | use_len = len; |
| 220 | if( len > info->length ) |
| 221 | use_len = info->length; |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 222 | |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 223 | if( use_len ) |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 224 | { |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 225 | memcpy( output, info->buf, use_len ); |
| 226 | info->buf += use_len; |
| 227 | info->length -= use_len; |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 228 | } |
| 229 | |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 230 | if( len - use_len > 0 ) |
| 231 | return( rnd_std_rand( NULL, output + use_len, len - use_len ) ); |
| 232 | |
| 233 | return( 0 ); |
Paul Bakker | 9dcc322 | 2011-03-08 14:16:06 +0000 | [diff] [blame] | 234 | } |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 235 | |
| 236 | /** |
| 237 | * Info structure for the pseudo random function |
| 238 | * |
| 239 | * Key should be set at the start to a test-unique value. |
Paul Bakker | b3dcbc1 | 2011-03-13 16:57:25 +0000 | [diff] [blame] | 240 | * Do not forget endianness! |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 241 | * State( v0, v1 ) should be set to zero. |
| 242 | */ |
| 243 | typedef struct |
| 244 | { |
Paul Bakker | b3dcbc1 | 2011-03-13 16:57:25 +0000 | [diff] [blame] | 245 | uint32_t key[16]; |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 246 | uint32_t v0, v1; |
| 247 | } rnd_pseudo_info; |
| 248 | |
| 249 | /** |
| 250 | * This function returns random based on a pseudo random function. |
| 251 | * This means the results should be identical on all systems. |
| 252 | * Pseudo random is based on the XTEA encryption algorithm to |
| 253 | * generate pseudorandom. |
| 254 | * |
| 255 | * rng_state shall be a pointer to a rnd_pseudo_info structure. |
| 256 | */ |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 257 | static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len ) |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 258 | { |
| 259 | rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state; |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 260 | uint32_t i, *k, sum, delta=0x9E3779B9; |
Manuel Pégourié-Gonnard | 217a29c | 2014-01-03 11:59:09 +0100 | [diff] [blame] | 261 | unsigned char result[4], *out = output; |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 262 | |
| 263 | if( rng_state == NULL ) |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 264 | return( rnd_std_rand( NULL, output, len ) ); |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 265 | |
Paul Bakker | b3dcbc1 | 2011-03-13 16:57:25 +0000 | [diff] [blame] | 266 | k = info->key; |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 267 | |
| 268 | while( len > 0 ) |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 269 | { |
Paul Bakker | 40dd530 | 2012-05-15 15:02:38 +0000 | [diff] [blame] | 270 | size_t use_len = ( len > 4 ) ? 4 : len; |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 271 | sum = 0; |
| 272 | |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 273 | for( i = 0; i < 32; i++ ) |
| 274 | { |
Rich Evans | 4291445 | 2015-02-02 12:09:25 +0000 | [diff] [blame] | 275 | info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) ) |
| 276 | + info->v1 ) ^ ( sum + k[sum & 3] ); |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 277 | sum += delta; |
Rich Evans | 4291445 | 2015-02-02 12:09:25 +0000 | [diff] [blame] | 278 | info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) ) |
| 279 | + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] ); |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 280 | } |
| 281 | |
Paul Bakker | 5c2364c | 2012-10-01 14:41:15 +0000 | [diff] [blame] | 282 | PUT_UINT32_BE( info->v0, result, 0 ); |
Manuel Pégourié-Gonnard | 217a29c | 2014-01-03 11:59:09 +0100 | [diff] [blame] | 283 | memcpy( out, result, use_len ); |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 284 | len -= use_len; |
Manuel Pégourié-Gonnard | 217a29c | 2014-01-03 11:59:09 +0100 | [diff] [blame] | 285 | out += 4; |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 286 | } |
| 287 | |
Paul Bakker | a3d195c | 2011-11-27 21:07:34 +0000 | [diff] [blame] | 288 | return( 0 ); |
Paul Bakker | 997bbd1 | 2011-03-13 15:45:42 +0000 | [diff] [blame] | 289 | } |