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