33 #if !defined(POLARSSL_CONFIG_FILE)
36 #include POLARSSL_CONFIG_FILE
39 #if defined(POLARSSL_HAVEGE_C)
60 #define SWAP(X,Y) { int *T = X; X = Y; Y = T; }
62 #define TST1_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1;
63 #define TST2_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1;
65 #define TST1_LEAVE U1++; }
66 #define TST2_LEAVE U2++; }
68 #define ONE_ITERATION \
72 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
73 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
74 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
76 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
77 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
78 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
80 PTX = (PT1 >> 18) & 7; \
83 CLK = (int) hardclock(); \
86 A = &WALK[PT1 ]; RES[i++] ^= *A; \
87 B = &WALK[PT2 ]; RES[i++] ^= *B; \
88 C = &WALK[PT1 ^ 1]; RES[i++] ^= *C; \
89 D = &WALK[PT2 ^ 4]; RES[i++] ^= *D; \
91 IN = (*A >> (1)) ^ (*A << (31)) ^ CLK; \
92 *A = (*B >> (2)) ^ (*B << (30)) ^ CLK; \
94 *C = (*C >> (3)) ^ (*C << (29)) ^ CLK; \
95 *D = (*D >> (4)) ^ (*D << (28)) ^ CLK; \
97 A = &WALK[PT1 ^ 2]; RES[i++] ^= *A; \
98 B = &WALK[PT2 ^ 2]; RES[i++] ^= *B; \
99 C = &WALK[PT1 ^ 3]; RES[i++] ^= *C; \
100 D = &WALK[PT2 ^ 6]; RES[i++] ^= *D; \
102 if( PTEST & 1 ) SWAP( A, C ); \
104 IN = (*A >> (5)) ^ (*A << (27)) ^ CLK; \
105 *A = (*B >> (6)) ^ (*B << (26)) ^ CLK; \
106 *B = IN; CLK = (int) hardclock(); \
107 *C = (*C >> (7)) ^ (*C << (25)) ^ CLK; \
108 *D = (*D >> (8)) ^ (*D << (24)) ^ CLK; \
110 A = &WALK[PT1 ^ 4]; \
111 B = &WALK[PT2 ^ 1]; \
115 PT2 = (RES[(i - 8) ^ PTY] ^ WALK[PT2 ^ PTY ^ 7]); \
116 PT2 = ((PT2 & 0x1FFF) & (~8)) ^ ((PT1 ^ 8) & 0x8); \
117 PTY = (PT2 >> 10) & 7; \
119 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
120 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
121 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
123 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
124 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
125 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
127 C = &WALK[PT1 ^ 5]; \
128 D = &WALK[PT2 ^ 5]; \
135 IN = (*A >> ( 9)) ^ (*A << (23)) ^ CLK; \
136 *A = (*B >> (10)) ^ (*B << (22)) ^ CLK; \
138 *C = (*C >> (11)) ^ (*C << (21)) ^ CLK; \
139 *D = (*D >> (12)) ^ (*D << (20)) ^ CLK; \
141 A = &WALK[PT1 ^ 6]; RES[i++] ^= *A; \
142 B = &WALK[PT2 ^ 3]; RES[i++] ^= *B; \
143 C = &WALK[PT1 ^ 7]; RES[i++] ^= *C; \
144 D = &WALK[PT2 ^ 7]; RES[i++] ^= *D; \
146 IN = (*A >> (13)) ^ (*A << (19)) ^ CLK; \
147 *A = (*B >> (14)) ^ (*B << (18)) ^ CLK; \
149 *C = (*C >> (15)) ^ (*C << (17)) ^ CLK; \
150 *D = (*D >> (16)) ^ (*D << (16)) ^ CLK; \
152 PT1 = ( RES[(i - 8) ^ PTX] ^ \
153 WALK[PT1 ^ PTX ^ 7] ) & (~1); \
154 PT1 ^= (PT2 ^ 0x10) & 0x10; \
156 for( n++, i = 0; i < 16; i++ ) \
157 hs->pool[n % COLLECT_SIZE] ^= RES[i];
165 int U1, U2, *A, *B, *C, *D;
166 int PT1, PT2, *WALK, RES[16];
167 int PTX, PTY, CLK, PTEST, IN;
176 memset( RES, 0,
sizeof( RES ) );
206 int havege_random(
void *p_rng,
unsigned char *buf,
size_t len )
211 unsigned char *p = buf;
216 if( use_len >
sizeof(
int) )
217 use_len =
sizeof(
int);
225 memcpy( p, &val, use_len );
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.