blob: ecb5f151f8b1a022a70d3516d6d703f18c94bdbb [file] [log] [blame] [raw]
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02001#if defined(MBEDTLS_PLATFORM_C)
Manuel Pégourié-Gonnard7f809972015-03-09 17:05:11 +00002#include "mbedtls/platform.h"
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +02003#else
Rich Evans00ab4702015-02-06 13:43:58 +00004#include <stdio.h>
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02005#define mbedtls_printf printf
6#define mbedtls_fprintf fprintf
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +02007#define mbedtls_calloc calloc
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02008#define mbedtls_free free
9#define mbedtls_exit exit
10#define mbedtls_fprintf fprintf
11#define mbedtls_printf printf
12#define mbedtls_snprintf snprintf
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +020013#endif
14
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000015#ifdef _MSC_VER
16#include <basetsd.h>
17typedef UINT32 uint32_t;
18#else
Manuel Pégourié-Gonnard93866642015-06-22 19:21:23 +020019#include <stdint.h>
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000020#endif
21
Rich Evans3d62e722015-02-03 11:48:59 +000022#include <stdio.h>
Paul Bakker19343182013-08-16 13:31:10 +020023#include <stdlib.h>
24#include <string.h>
Rich Evans4c091142015-02-02 12:04:10 +000025
26#define assert(a) if( !( a ) ) \
27{ \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020028 mbedtls_fprintf( stderr, "Assertion Failed at %s:%d - %s\n", \
Rich Evans4c091142015-02-02 12:04:10 +000029 __FILE__, __LINE__, #a ); \
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020030 mbedtls_exit( 1 ); \
Rich Evans4c091142015-02-02 12:04:10 +000031}
Paul Bakker19343182013-08-16 13:31:10 +020032
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000033/*
34 * 32-bit integer manipulation macros (big endian)
35 */
Paul Bakker5c2364c2012-10-01 14:41:15 +000036#ifndef GET_UINT32_BE
37#define GET_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000038{ \
Paul Bakker5c2364c2012-10-01 14:41:15 +000039 (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
40 | ( (uint32_t) (b)[(i) + 1] << 16 ) \
41 | ( (uint32_t) (b)[(i) + 2] << 8 ) \
42 | ( (uint32_t) (b)[(i) + 3] ); \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000043}
44#endif
45
Paul Bakker5c2364c2012-10-01 14:41:15 +000046#ifndef PUT_UINT32_BE
47#define PUT_UINT32_BE(n,b,i) \
Paul Bakkerb3dcbc12011-03-13 16:57:25 +000048{ \
49 (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
50 (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
51 (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
52 (b)[(i) + 3] = (unsigned char) ( (n) ); \
53}
54#endif
55
Rich Evans4c091142015-02-02 12:04:10 +000056static int unhexify( unsigned char *obuf, const char *ibuf )
Paul Bakker367dae42009-06-28 21:50:27 +000057{
58 unsigned char c, c2;
Rich Evans4c091142015-02-02 12:04:10 +000059 int len = strlen( ibuf ) / 2;
60 assert( strlen( ibuf ) % 2 == 0 ); // must be even number of bytes
Paul Bakker367dae42009-06-28 21:50:27 +000061
Rich Evans4c091142015-02-02 12:04:10 +000062 while( *ibuf != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +000063 {
64 c = *ibuf++;
65 if( c >= '0' && c <= '9' )
66 c -= '0';
67 else if( c >= 'a' && c <= 'f' )
68 c -= 'a' - 10;
69 else if( c >= 'A' && c <= 'F' )
70 c -= 'A' - 10;
71 else
72 assert( 0 );
73
74 c2 = *ibuf++;
75 if( c2 >= '0' && c2 <= '9' )
76 c2 -= '0';
77 else if( c2 >= 'a' && c2 <= 'f' )
78 c2 -= 'a' - 10;
79 else if( c2 >= 'A' && c2 <= 'F' )
80 c2 -= 'A' - 10;
81 else
82 assert( 0 );
83
84 *obuf++ = ( c << 4 ) | c2;
85 }
86
87 return len;
88}
89
Rich Evans42914452015-02-02 12:09:25 +000090static void hexify( unsigned char *obuf, const unsigned char *ibuf, int len )
Paul Bakker367dae42009-06-28 21:50:27 +000091{
92 unsigned char l, h;
93
Rich Evans42914452015-02-02 12:09:25 +000094 while( len != 0 )
Paul Bakker367dae42009-06-28 21:50:27 +000095 {
Rich Evans42914452015-02-02 12:09:25 +000096 h = *ibuf / 16;
97 l = *ibuf % 16;
Paul Bakker367dae42009-06-28 21:50:27 +000098
99 if( h < 10 )
100 *obuf++ = '0' + h;
101 else
102 *obuf++ = 'a' + h - 10;
103
104 if( l < 10 )
105 *obuf++ = '0' + l;
106 else
107 *obuf++ = 'a' + l - 10;
108
109 ++ibuf;
110 len--;
111 }
112}
Paul Bakker9dcc3222011-03-08 14:16:06 +0000113
114/**
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200115 * Allocate and zeroize a buffer.
116 *
117 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
118 *
119 * For convenience, dies if allocation fails.
120 */
121static unsigned char *zero_alloc( size_t len )
122{
123 void *p;
Rich Evans42914452015-02-02 12:09:25 +0000124 size_t actual_len = ( len != 0 ) ? len : 1;
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200125
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200126 p = mbedtls_calloc( 1, actual_len );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200127 assert( p != NULL );
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200128
129 memset( p, 0x00, actual_len );
130
131 return( p );
132}
133
134/**
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200135 * Allocate and fill a buffer from hex data.
136 *
137 * The buffer is sized exactly as needed. This allows to detect buffer
138 * overruns (including overreads) when running the test suite under valgrind.
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200139 *
140 * If the size if zero, a pointer to a zeroized 1-byte buffer is returned.
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200141 *
142 * For convenience, dies if allocation fails.
143 */
144static unsigned char *unhexify_alloc( const char *ibuf, size_t *olen )
145{
146 unsigned char *obuf;
147
Rich Evans42914452015-02-02 12:09:25 +0000148 *olen = strlen( ibuf ) / 2;
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200149
Manuel Pégourié-Gonnard0dc5e0d2014-06-13 21:09:26 +0200150 if( *olen == 0 )
151 return( zero_alloc( *olen ) );
152
Manuel Pégourié-Gonnard7551cb92015-05-26 16:04:06 +0200153 obuf = mbedtls_calloc( 1, *olen );
Paul Bakker4d0cfe82014-07-10 14:37:36 +0200154 assert( obuf != NULL );
Manuel Pégourié-Gonnard3d49b9d2014-06-06 14:48:09 +0200155
156 (void) unhexify( obuf, ibuf );
157
158 return( obuf );
159}
160
161/**
Paul Bakker9dcc3222011-03-08 14:16:06 +0000162 * This function just returns data from rand().
Paul Bakker997bbd12011-03-13 15:45:42 +0000163 * Although predictable and often similar on multiple
164 * runs, this does not result in identical random on
165 * each run. So do not use this if the results of a
166 * test depend on the random data that is generated.
Paul Bakker9dcc3222011-03-08 14:16:06 +0000167 *
168 * rng_state shall be NULL.
169 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000170static int rnd_std_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000171{
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200172#if !defined(__OpenBSD__)
Paul Bakkera3d195c2011-11-27 21:07:34 +0000173 size_t i;
174
Paul Bakker9dcc3222011-03-08 14:16:06 +0000175 if( rng_state != NULL )
176 rng_state = NULL;
177
Paul Bakkera3d195c2011-11-27 21:07:34 +0000178 for( i = 0; i < len; ++i )
179 output[i] = rand();
Paul Bakkerf96f7b62014-04-30 16:02:38 +0200180#else
181 if( rng_state != NULL )
182 rng_state = NULL;
183
184 arc4random_buf( output, len );
185#endif /* !OpenBSD */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000186
187 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000188}
189
190/**
191 * This function only returns zeros
192 *
193 * rng_state shall be NULL.
194 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000195static int rnd_zero_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000196{
197 if( rng_state != NULL )
198 rng_state = NULL;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000199
200 memset( output, 0, len );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000201
202 return( 0 );
203}
204
205typedef struct
206{
207 unsigned char *buf;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000208 size_t length;
Paul Bakker997bbd12011-03-13 15:45:42 +0000209} rnd_buf_info;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000210
211/**
212 * This function returns random based on a buffer it receives.
213 *
Paul Bakker997bbd12011-03-13 15:45:42 +0000214 * rng_state shall be a pointer to a rnd_buf_info structure.
215 *
216 * The number of bytes released from the buffer on each call to
217 * the random function is specified by per_call. (Can be between
218 * 1 and 4)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000219 *
220 * After the buffer is empty it will return rand();
221 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000222static int rnd_buffer_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000223{
Paul Bakker997bbd12011-03-13 15:45:42 +0000224 rnd_buf_info *info = (rnd_buf_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000225 size_t use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000226
227 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000228 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000229
Paul Bakkera3d195c2011-11-27 21:07:34 +0000230 use_len = len;
231 if( len > info->length )
232 use_len = info->length;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000233
Paul Bakkera3d195c2011-11-27 21:07:34 +0000234 if( use_len )
Paul Bakker9dcc3222011-03-08 14:16:06 +0000235 {
Paul Bakkera3d195c2011-11-27 21:07:34 +0000236 memcpy( output, info->buf, use_len );
237 info->buf += use_len;
238 info->length -= use_len;
Paul Bakker9dcc3222011-03-08 14:16:06 +0000239 }
240
Paul Bakkera3d195c2011-11-27 21:07:34 +0000241 if( len - use_len > 0 )
242 return( rnd_std_rand( NULL, output + use_len, len - use_len ) );
243
244 return( 0 );
Paul Bakker9dcc3222011-03-08 14:16:06 +0000245}
Paul Bakker997bbd12011-03-13 15:45:42 +0000246
247/**
248 * Info structure for the pseudo random function
249 *
250 * Key should be set at the start to a test-unique value.
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000251 * Do not forget endianness!
Paul Bakker997bbd12011-03-13 15:45:42 +0000252 * State( v0, v1 ) should be set to zero.
253 */
254typedef struct
255{
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000256 uint32_t key[16];
Paul Bakker997bbd12011-03-13 15:45:42 +0000257 uint32_t v0, v1;
258} rnd_pseudo_info;
259
260/**
261 * This function returns random based on a pseudo random function.
262 * This means the results should be identical on all systems.
263 * Pseudo random is based on the XTEA encryption algorithm to
264 * generate pseudorandom.
265 *
266 * rng_state shall be a pointer to a rnd_pseudo_info structure.
267 */
Paul Bakkera3d195c2011-11-27 21:07:34 +0000268static int rnd_pseudo_rand( void *rng_state, unsigned char *output, size_t len )
Paul Bakker997bbd12011-03-13 15:45:42 +0000269{
270 rnd_pseudo_info *info = (rnd_pseudo_info *) rng_state;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000271 uint32_t i, *k, sum, delta=0x9E3779B9;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100272 unsigned char result[4], *out = output;
Paul Bakker997bbd12011-03-13 15:45:42 +0000273
274 if( rng_state == NULL )
Paul Bakkera3d195c2011-11-27 21:07:34 +0000275 return( rnd_std_rand( NULL, output, len ) );
Paul Bakker997bbd12011-03-13 15:45:42 +0000276
Paul Bakkerb3dcbc12011-03-13 16:57:25 +0000277 k = info->key;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000278
279 while( len > 0 )
Paul Bakker997bbd12011-03-13 15:45:42 +0000280 {
Paul Bakker40dd5302012-05-15 15:02:38 +0000281 size_t use_len = ( len > 4 ) ? 4 : len;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000282 sum = 0;
Paul Bakkera3d195c2011-11-27 21:07:34 +0000283
284 for( i = 0; i < 32; i++ )
285 {
Rich Evans42914452015-02-02 12:09:25 +0000286 info->v0 += ( ( ( info->v1 << 4 ) ^ ( info->v1 >> 5 ) )
287 + info->v1 ) ^ ( sum + k[sum & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000288 sum += delta;
Rich Evans42914452015-02-02 12:09:25 +0000289 info->v1 += ( ( ( info->v0 << 4 ) ^ ( info->v0 >> 5 ) )
290 + info->v0 ) ^ ( sum + k[( sum>>11 ) & 3] );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000291 }
292
Paul Bakker5c2364c2012-10-01 14:41:15 +0000293 PUT_UINT32_BE( info->v0, result, 0 );
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100294 memcpy( out, result, use_len );
Paul Bakkera3d195c2011-11-27 21:07:34 +0000295 len -= use_len;
Manuel Pégourié-Gonnard217a29c2014-01-03 11:59:09 +0100296 out += 4;
Paul Bakker997bbd12011-03-13 15:45:42 +0000297 }
298
Paul Bakkera3d195c2011-11-27 21:07:34 +0000299 return( 0 );
Paul Bakker997bbd12011-03-13 15:45:42 +0000300}