00001
00025
00026
00027
00028
00029
00030
00031
00032
00033 #include "polarssl/config.h"
00034
00035 #if defined(POLARSSL_HAVEGE_C)
00036
00037 #include "polarssl/havege.h"
00038 #include "polarssl/timing.h"
00039
00040 #include <string.h>
00041
00042
00043
00044
00045
00046
00047
00048
00049
00050
00051
00052
00053
00054
00055
00056 #define SWAP(X,Y) { int *T = X; X = Y; Y = T; }
00057
00058 #define TST1_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1;
00059 #define TST2_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1;
00060
00061 #define TST1_LEAVE U1++; }
00062 #define TST2_LEAVE U2++; }
00063
00064 #define ONE_ITERATION \
00065 \
00066 PTEST = PT1 >> 20; \
00067 \
00068 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
00069 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
00070 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
00071 \
00072 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
00073 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
00074 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
00075 \
00076 PTX = (PT1 >> 18) & 7; \
00077 PT1 &= 0x1FFF; \
00078 PT2 &= 0x1FFF; \
00079 CLK = (int) hardclock(); \
00080 \
00081 i = 0; \
00082 A = &WALK[PT1 ]; RES[i++] ^= *A; \
00083 B = &WALK[PT2 ]; RES[i++] ^= *B; \
00084 C = &WALK[PT1 ^ 1]; RES[i++] ^= *C; \
00085 D = &WALK[PT2 ^ 4]; RES[i++] ^= *D; \
00086 \
00087 IN = (*A >> (1)) ^ (*A << (31)) ^ CLK; \
00088 *A = (*B >> (2)) ^ (*B << (30)) ^ CLK; \
00089 *B = IN ^ U1; \
00090 *C = (*C >> (3)) ^ (*C << (29)) ^ CLK; \
00091 *D = (*D >> (4)) ^ (*D << (28)) ^ CLK; \
00092 \
00093 A = &WALK[PT1 ^ 2]; RES[i++] ^= *A; \
00094 B = &WALK[PT2 ^ 2]; RES[i++] ^= *B; \
00095 C = &WALK[PT1 ^ 3]; RES[i++] ^= *C; \
00096 D = &WALK[PT2 ^ 6]; RES[i++] ^= *D; \
00097 \
00098 if( PTEST & 1 ) SWAP( A, C ); \
00099 \
00100 IN = (*A >> (5)) ^ (*A << (27)) ^ CLK; \
00101 *A = (*B >> (6)) ^ (*B << (26)) ^ CLK; \
00102 *B = IN; CLK = (int) hardclock(); \
00103 *C = (*C >> (7)) ^ (*C << (25)) ^ CLK; \
00104 *D = (*D >> (8)) ^ (*D << (24)) ^ CLK; \
00105 \
00106 A = &WALK[PT1 ^ 4]; \
00107 B = &WALK[PT2 ^ 1]; \
00108 \
00109 PTEST = PT2 >> 1; \
00110 \
00111 PT2 = (RES[(i - 8) ^ PTY] ^ WALK[PT2 ^ PTY ^ 7]); \
00112 PT2 = ((PT2 & 0x1FFF) & (~8)) ^ ((PT1 ^ 8) & 0x8); \
00113 PTY = (PT2 >> 10) & 7; \
00114 \
00115 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
00116 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
00117 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
00118 \
00119 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
00120 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
00121 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
00122 \
00123 C = &WALK[PT1 ^ 5]; \
00124 D = &WALK[PT2 ^ 5]; \
00125 \
00126 RES[i++] ^= *A; \
00127 RES[i++] ^= *B; \
00128 RES[i++] ^= *C; \
00129 RES[i++] ^= *D; \
00130 \
00131 IN = (*A >> ( 9)) ^ (*A << (23)) ^ CLK; \
00132 *A = (*B >> (10)) ^ (*B << (22)) ^ CLK; \
00133 *B = IN ^ U2; \
00134 *C = (*C >> (11)) ^ (*C << (21)) ^ CLK; \
00135 *D = (*D >> (12)) ^ (*D << (20)) ^ CLK; \
00136 \
00137 A = &WALK[PT1 ^ 6]; RES[i++] ^= *A; \
00138 B = &WALK[PT2 ^ 3]; RES[i++] ^= *B; \
00139 C = &WALK[PT1 ^ 7]; RES[i++] ^= *C; \
00140 D = &WALK[PT2 ^ 7]; RES[i++] ^= *D; \
00141 \
00142 IN = (*A >> (13)) ^ (*A << (19)) ^ CLK; \
00143 *A = (*B >> (14)) ^ (*B << (18)) ^ CLK; \
00144 *B = IN; \
00145 *C = (*C >> (15)) ^ (*C << (17)) ^ CLK; \
00146 *D = (*D >> (16)) ^ (*D << (16)) ^ CLK; \
00147 \
00148 PT1 = ( RES[(i - 8) ^ PTX] ^ \
00149 WALK[PT1 ^ PTX ^ 7] ) & (~1); \
00150 PT1 ^= (PT2 ^ 0x10) & 0x10; \
00151 \
00152 for( n++, i = 0; i < 16; i++ ) \
00153 hs->pool[n % COLLECT_SIZE] ^= RES[i];
00154
00155
00156
00157
00158 static void havege_fill( havege_state *hs )
00159 {
00160 int i, n = 0;
00161 int U1, U2, *A, *B, *C, *D;
00162 int PT1, PT2, *WALK, RES[16];
00163 int PTX, PTY, CLK, PTEST, IN;
00164
00165 WALK = hs->WALK;
00166 PT1 = hs->PT1;
00167 PT2 = hs->PT2;
00168
00169 PTX = U1 = 0;
00170 PTY = U2 = 0;
00171
00172 memset( RES, 0, sizeof( RES ) );
00173
00174 while( n < COLLECT_SIZE * 4 )
00175 {
00176 ONE_ITERATION
00177 ONE_ITERATION
00178 ONE_ITERATION
00179 ONE_ITERATION
00180 }
00181
00182 hs->PT1 = PT1;
00183 hs->PT2 = PT2;
00184
00185 hs->offset[0] = 0;
00186 hs->offset[1] = COLLECT_SIZE / 2;
00187 }
00188
00189
00190
00191
00192 void havege_init( havege_state *hs )
00193 {
00194 memset( hs, 0, sizeof( havege_state ) );
00195
00196 havege_fill( hs );
00197 }
00198
00199
00200
00201
00202 int havege_random( void *p_rng, unsigned char *buf, size_t len )
00203 {
00204 int val;
00205 size_t use_len;
00206 havege_state *hs = (havege_state *) p_rng;
00207 unsigned char *p = buf;
00208
00209 while( len > 0 )
00210 {
00211 use_len = len;
00212 if( use_len > sizeof(int) )
00213 use_len = sizeof(int);
00214
00215 if( hs->offset[1] >= COLLECT_SIZE )
00216 havege_fill( hs );
00217
00218 val = hs->pool[hs->offset[0]++];
00219 val ^= hs->pool[hs->offset[1]++];
00220
00221 memcpy( p, &val, use_len );
00222
00223 len -= use_len;
00224 p += use_len;
00225 }
00226
00227 return( 0 );
00228 }
00229
00230 #endif