33 #if !defined(POLARSSL_CONFIG_FILE) 36 #include POLARSSL_CONFIG_FILE 39 #if defined(POLARSSL_HAVEGE_C) 47 static void polarssl_zeroize(
void *v,
size_t n ) {
48 volatile unsigned char *p = v;
while( n-- ) *p++ = 0;
65 #define SWAP(X,Y) { int *T = X; X = Y; Y = T; } 67 #define TST1_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1; 68 #define TST2_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1; 70 #define TST1_LEAVE U1++; } 71 #define TST2_LEAVE U2++; } 73 #define ONE_ITERATION \ 77 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \ 78 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \ 79 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \ 81 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \ 82 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \ 83 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \ 85 PTX = (PT1 >> 18) & 7; \ 88 CLK = (int) hardclock(); \ 91 A = &WALK[PT1 ]; RES[i++] ^= *A; \ 92 B = &WALK[PT2 ]; RES[i++] ^= *B; \ 93 C = &WALK[PT1 ^ 1]; RES[i++] ^= *C; \ 94 D = &WALK[PT2 ^ 4]; RES[i++] ^= *D; \ 96 IN = (*A >> (1)) ^ (*A << (31)) ^ CLK; \ 97 *A = (*B >> (2)) ^ (*B << (30)) ^ CLK; \ 99 *C = (*C >> (3)) ^ (*C << (29)) ^ CLK; \ 100 *D = (*D >> (4)) ^ (*D << (28)) ^ CLK; \ 102 A = &WALK[PT1 ^ 2]; RES[i++] ^= *A; \ 103 B = &WALK[PT2 ^ 2]; RES[i++] ^= *B; \ 104 C = &WALK[PT1 ^ 3]; RES[i++] ^= *C; \ 105 D = &WALK[PT2 ^ 6]; RES[i++] ^= *D; \ 107 if( PTEST & 1 ) SWAP( A, C ); \ 109 IN = (*A >> (5)) ^ (*A << (27)) ^ CLK; \ 110 *A = (*B >> (6)) ^ (*B << (26)) ^ CLK; \ 111 *B = IN; CLK = (int) hardclock(); \ 112 *C = (*C >> (7)) ^ (*C << (25)) ^ CLK; \ 113 *D = (*D >> (8)) ^ (*D << (24)) ^ CLK; \ 115 A = &WALK[PT1 ^ 4]; \ 116 B = &WALK[PT2 ^ 1]; \ 120 PT2 = (RES[(i - 8) ^ PTY] ^ WALK[PT2 ^ PTY ^ 7]); \ 121 PT2 = ((PT2 & 0x1FFF) & (~8)) ^ ((PT1 ^ 8) & 0x8); \ 122 PTY = (PT2 >> 10) & 7; \ 124 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \ 125 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \ 126 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \ 128 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \ 129 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \ 130 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \ 132 C = &WALK[PT1 ^ 5]; \ 133 D = &WALK[PT2 ^ 5]; \ 140 IN = (*A >> ( 9)) ^ (*A << (23)) ^ CLK; \ 141 *A = (*B >> (10)) ^ (*B << (22)) ^ CLK; \ 143 *C = (*C >> (11)) ^ (*C << (21)) ^ CLK; \ 144 *D = (*D >> (12)) ^ (*D << (20)) ^ CLK; \ 146 A = &WALK[PT1 ^ 6]; RES[i++] ^= *A; \ 147 B = &WALK[PT2 ^ 3]; RES[i++] ^= *B; \ 148 C = &WALK[PT1 ^ 7]; RES[i++] ^= *C; \ 149 D = &WALK[PT2 ^ 7]; RES[i++] ^= *D; \ 151 IN = (*A >> (13)) ^ (*A << (19)) ^ CLK; \ 152 *A = (*B >> (14)) ^ (*B << (18)) ^ CLK; \ 154 *C = (*C >> (15)) ^ (*C << (17)) ^ CLK; \ 155 *D = (*D >> (16)) ^ (*D << (16)) ^ CLK; \ 157 PT1 = ( RES[( i - 8 ) ^ PTX] ^ \ 158 WALK[PT1 ^ PTX ^ 7] ) & (~1); \ 159 PT1 ^= (PT2 ^ 0x10) & 0x10; \ 161 for( n++, i = 0; i < 16; i++ ) \ 162 hs->pool[n % COLLECT_SIZE] ^= RES[i]; 170 int U1, U2, *A, *B, *C, *D;
171 int PT1, PT2, *WALK, RES[16];
172 int PTX, PTY, CLK, PTEST, IN;
181 memset( RES, 0,
sizeof( RES ) );
219 int havege_random(
void *p_rng,
unsigned char *buf,
size_t len )
224 unsigned char *p = buf;
229 if( use_len >
sizeof(
int) )
230 use_len =
sizeof(
int);
238 memcpy( p, &val, use_len );
void havege_free(havege_state *hs)
Clear HAVEGE state.
Configuration options (set of defines)
HAVEGE: HArdware Volatile Entropy Gathering and Expansion.
int havege_random(void *p_rng, unsigned char *output, size_t len)
HAVEGE rand function.
void havege_init(havege_state *hs)
HAVEGE initialization.
Portable interface to the CPU cycle counter.