1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
#include "sha1.h"
#include "libfastmint.h"
#if defined( DEBUG )
#include <stdio.h>
#endif
int minter_library_test(void)
{
/* This minter runs on any hardware */
return 1;
}
unsigned long minter_library(int bits, int* best, unsigned char *block, const uInt32 IV[5], int tailIndex, unsigned long maxIter, MINTER_CALLBACK_ARGS)
{
MINTER_CALLBACK_VARS;
unsigned long iters = 0;
int t = 0, gotBits = 0, maxBits = (bits > 16) ? 16 : bits;
uInt32 bitMask1Low = 0 , bitMask1High = 0 , s = 0 ;
const char *p = encodeAlphabets[EncodeBase64];
uInt32 A = 0, B = 0;
int addressMask = 0 ;
static const int endTest = 3;
unsigned char *output = (unsigned char*) block;
unsigned char Xa[ SHA1_INPUT_BYTES*2 ]; /* worst case */
unsigned char* X = Xa;
uInt32 *W = (uInt32*)Xa;
uInt32 H[ SHA1_DIGEST_WORDS ];
int blocks = (tailIndex+1+8) > SHA1_INPUT_BYTES ? 2 : 1;
#if defined( DEBUG )
int i;
#endif
if ( *best > 0 ) { maxBits = *best+1; }
/* Work out whether we need to swap bytes during encoding */
addressMask = ( *(char*)&endTest );
for(t=0; t < 16*blocks; t++) { W[t] = GET_WORD(output + t*4); }
#if defined( DEBUG )
fprintf( stderr, "maxBits = %d\n", maxBits );
#endif
/* Work out which bits to mask out for test */
if(maxBits < 32) {
if ( bits == 0 ) { bitMask1Low = 0; } else {
bitMask1Low = ~((((uInt32) 1) << (32 - maxBits)) - 1);
}
bitMask1High = 0;
} else {
bitMask1Low = ~0;
bitMask1High = ~((((uInt32) 1) << (64 - maxBits)) - 1);
}
maxBits = 0;
#if defined( DEBUG )
fprintf( stderr, "mask0 = " );
for ( i = 0; i < 32; i++ ) {
fputc( (bitMask1High & (1UL << i) )? '1' : '0', stderr );
}
fputc( ' ', stderr );
for ( i = 0; i < 32; i++ ) {
fputc( (bitMask1Low & (1UL << i) )? '1' : '0', stderr );
}
fputc( '\n', stderr );
#endif
/* The Tight Loop - everything in here should be extra efficient */
for(iters=0; iters < maxIter; iters++) {
/* Encode iteration count into tail */
X[(tailIndex - 1) ^ addressMask] = p[(iters ) & 0x3f];
if(!(iters & 0x3f)) {
if ( iters >> 6 ) {
X[(tailIndex - 2) ^ addressMask] = p[(iters >> 6) & 0x3f];
}
if ( iters >> 12 ) {
X[(tailIndex - 3) ^ addressMask] = p[(iters >> 12) & 0x3f];
}
if ( iters >> 18 ) {
X[(tailIndex - 4) ^ addressMask] = p[(iters >> 18) & 0x3f];
}
if ( iters >> 24 ) {
X[(tailIndex - 5) ^ addressMask] = p[(iters >> 24) & 0x3f];
}
if ( iters >> 30 ) {
X[(tailIndex - 6) ^ addressMask] = p[(iters >> 30) & 0x3f];
}
}
memcpy( H, IV, SHA1_DIGEST_BYTES );
SHA1_Transform( H, X );
if ( blocks == 2 ) {
SHA1_Transform( H, X+SHA1_INPUT_BYTES );
}
A = H[0];
B = H[1];
#if defined( DEBUG )
#define P(n) (X[n] ? ( (X[n] == 0x80) ?'$' : ((X[n]<32)?'#':X[n]) ) : '@')
fprintf( stderr,
"H(%c%c%c%c%c%c%c%c%c%c%c%c%c%c%c%c"
"%c%c%c%c%c%c%c%c%c%c%c%c%c%c%c%c"
"%c%c%c%c%c%c%c%c%c%c%c%c%c%c%c%c"
"%c%c%c%c%c%c%c%c%c%c%c%c%c%c%02x%02x"
") = 0x%08x%08x\n",
P(0+3),P(0+2),P(0+1),P(0+0),
P(4+3),P(4+2),P(4+1),P(4+0),
P(8+3),P(8+2),P(8+1),P(8+0),
P(12+3),P(12+2),P(12+1),P(12+0),
P(16+3),P(16+2),P(16+1),P(16+0),
P(20+3),P(20+2),P(20+1),P(20+0),
P(24+3),P(24+2),P(24+1),P(24+0),
P(28+3),P(28+2),P(28+1),P(28+0),
P(32+3),P(32+2),P(32+1),P(32+0),
P(36+3),P(36+2),P(36+1),P(36+0),
P(40+3),P(40+2),P(40+1),P(40+0),
P(44+3),P(44+2),P(44+1),P(44+0),
P(48+3),P(48+2),P(48+1),P(48+0),
P(52+3),P(52+2),P(52+1),P(52+0),
P(56+3),P(56+2),P(56+1),P(56+0),
P(60+3),P(60+2),X[60+1],X[60+0],
A, B );
#endif
/* Is this the best bit count so far? */
if(!(A & bitMask1Low) && !(B & bitMask1High)) {
/* Count bits */
gotBits = 0;
if(A) {
s = A;
while(!(s & 0x80000000)) {
s <<= 1;
gotBits++;
}
} else {
gotBits = 32;
if(B) {
s = B;
while(!(s & 0x80000000)) {
s <<= 1;
gotBits++;
}
} else {
gotBits = 64;
}
}
if ( gotBits > *best ) { *best = gotBits; }
/* Regenerate the bit mask */
maxBits = gotBits+1;
#if defined( DEBUG )
fprintf( stderr, "maxBits = %d\n", maxBits );
#endif
if(maxBits < 32) {
bitMask1Low = ~((((uInt32) 1) << (32 - maxBits)) - 1);
bitMask1High = 0;
} else {
bitMask1Low = ~0;
bitMask1High = ~((((uInt32) 1) << (64 - maxBits)) - 1);
}
/* Copy this result back to the block buffer */
for(t=0; t < 16*blocks; t++) {
PUT_WORD(output + t*4, W[t]);
}
#if defined( DEBUG )
fprintf( stderr, "output: %s\n", output );
#endif
#if defined( DEBUG )
fprintf( stderr, "maskN = " );
for ( i = 0; i < 32; i++ ) {
fputc( (bitMask1High & (1UL << i) )? '1' : '0', stderr );
}
fputc( ' ', stderr );
for ( i = 0; i < 32; i++ ) {
fputc( (bitMask1Low & (1UL << i) )? '1' : '0', stderr );
}
fputc( '\n', stderr );
#endif
/* Is it good enough to bail out? */
if(gotBits >= bits) {
return iters+1;
}
}
MINTER_CALLBACK();
}
return iters+1;
}
|
