Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members

haval.cpp

00001 // haval.cpp - written and placed in the public domain by Wei Dai 00002 00003 #include "pch.h" 00004 #include "haval.h" 00005 #include "misc.h" 00006 00007 NAMESPACE_BEGIN(CryptoPP) 00008 00009 HAVAL::HAVAL(unsigned int digestSize, unsigned int pass) 00010 : IteratedHash<word32, LittleEndian, 128>(DIGESTSIZE) 00011 , digestSize(digestSize), pass(pass) 00012 { 00013 if (!(digestSize >= 16 && digestSize <= 32 && digestSize%4==0)) 00014 throw InvalidArgument("HAVAL: invalid digest size"); 00015 00016 if (!(pass >= 3 && pass <= 5)) 00017 throw InvalidArgument("HAVAL: invalid number of passes"); 00018 00019 Init(); 00020 } 00021 00022 void HAVAL::Init() 00023 { 00024 m_digest[0] = 0x243F6A88; 00025 m_digest[1] = 0x85A308D3; 00026 m_digest[2] = 0x13198A2E; 00027 m_digest[3] = 0x03707344; 00028 m_digest[4] = 0xA4093822; 00029 m_digest[5] = 0x299F31D0; 00030 m_digest[6] = 0x082EFA98; 00031 m_digest[7] = 0xEC4E6C89; 00032 } 00033 00034 inline void HAVAL::vTransform(const word32 *in) 00035 { 00036 if (pass==3) 00037 HAVAL3::Transform(m_digest, in); 00038 else if (pass==4) 00039 HAVAL4::Transform(m_digest, in); 00040 else 00041 HAVAL5::Transform(m_digest, in); 00042 } 00043 00044 void HAVAL::TruncatedFinal(byte *hash, unsigned int size) 00045 { 00046 ThrowIfInvalidTruncatedSize(size); 00047 00048 PadLastBlock(118, 1); // first byte of padding for HAVAL is 1 instead of 0x80 00049 CorrectEndianess(m_data, m_data, 120); 00050 00051 m_data[29] &= 0xffff; 00052 m_data[29] |= ((word32)digestSize<<25) | ((word32)pass<<19) | ((word32)HAVAL_VERSION<<16); 00053 m_data[30] = GetBitCountLo(); 00054 m_data[31] = GetBitCountHi(); 00055 00056 vTransform(m_data); 00057 Tailor(digestSize*8); 00058 CorrectEndianess(m_digest, m_digest, digestSize); 00059 memcpy(hash, m_digest, size); 00060 00061 Restart(); // reinit for next use 00062 } 00063 00064 #define ROTR(x, y) rotrFixed(x, y##u) 00065 00066 // fold digest down to desired size 00067 void HAVAL::Tailor(unsigned int bitlen) 00068 { 00069 #define EB(a, b, c) (m_digest[a] & (((~(word32)0) << b) & ((~(word32)0) >> (8*sizeof(word32)-b-c)))) 00070 #define S(a, b) (a > b ? a - b : 32 + a - b) 00071 #define T128(a, b, c, d, e) ROTR(EB(7, b, S(a,b)) | EB(6, c, S(b,c)) | EB(5, d, S(c,d)) | EB(4, e, S(d,e)), e) 00072 #define T160(a, b, c, d) ROTR(EB(7, b, S(a,b)) | EB(6, c, S(b,c)) | EB(5, d, S(c,d)), d) 00073 #define T192(a, b, c) ROTR(EB(7, b, S(a,b)) | EB(6, c, S(b,c)), c) 00074 #define T224(a, b) ROTR(EB(7, b, S(a,b)), b) 00075 00076 switch (bitlen) 00077 { 00078 case 128: 00079 m_digest[0] += T128(8, 0, 24, 16, 8); 00080 m_digest[1] += T128(16, 8, 0, 24, 16); 00081 m_digest[2] += T128(24, 16, 8, 0, 24); 00082 m_digest[3] += T128(0, 24, 16, 8, 0); 00083 break; 00084 00085 case 160: 00086 m_digest[0] += T160(6, 0, 25, 19); 00087 m_digest[1] += T160(12, 6, 0, 25); 00088 m_digest[2] += T160(19, 12, 6, 0); 00089 m_digest[3] += T160(25, 19, 12, 6); 00090 m_digest[4] += T160(0, 25, 19, 12); 00091 break; 00092 00093 case 192: 00094 m_digest[0] += T192(5, 0, 26); 00095 m_digest[1] += T192(10, 5, 0); 00096 m_digest[2] += T192(16, 10, 5); 00097 m_digest[3] += T192(21, 16, 10); 00098 m_digest[4] += T192(26, 21, 16); 00099 m_digest[5] += T192(0, 26, 21); 00100 break; 00101 00102 case 224: 00103 m_digest[0] += T224(0, 27); 00104 m_digest[1] += T224(27, 22); 00105 m_digest[2] += T224(22, 18); 00106 m_digest[3] += T224(18, 13); 00107 m_digest[4] += T224(13, 9); 00108 m_digest[5] += T224(9, 4); 00109 m_digest[6] += T224(4, 0); 00110 break; 00111 00112 case 256: 00113 break; 00114 00115 default: 00116 assert(false); 00117 } 00118 } 00119 00120 /* Nonlinear F functions */ 00121 00122 /* #define F1(X6, X5, X4, X3, X2, X1, X0) \ 00123 ((X1) & (X4) ^ (X2) & (X5) ^ (X3) & (X6) ^ (X0) & (X1) ^ (X0))*/ 00124 #define F1(X6, X5, X4, X3, X2, X1, X0) \ 00125 (((X1) & ((X4) ^ (X0))) ^ ((X2) & (X5)) ^ ((X3) & (X6)) ^ (X0)) 00126 00127 /* #define F2(X6, X5, X4, X3, X2, X1, X0) \ 00128 ((X1) & (X2) & (X3) ^ (X2) & (X4) & (X5) ^ \ 00129 (X1) & (X2) ^ (X1) & (X4) ^ (X2) & (X6) ^ (X3) & (X5) ^ \ 00130 (X4) & (X5) ^ (X0) & (X2) ^ (X0))*/ 00131 #define F2(X6, X5, X4, X3, X2, X1, X0) \ 00132 (((X2) & (((X1) & (~(X3))) ^ ((X4) & (X5)) ^ (X6) ^ (X0))) ^ \ 00133 (((X4) & ((X1) ^ (X5))) ^ ((X3) & (X5)) ^ (X0))) 00134 00135 /* #define F3(X6, X5, X4, X3, X2, X1, X0) \ 00136 ((X1) & (X2) & (X3) ^ (X1) & (X4) ^ (X2) & (X5) ^ (X3) & (X6) ^ (X0) & 00137 (X3) ^ (X0))*/ 00138 #define F3(X6, X5, X4, X3, X2, X1, X0) \ 00139 (((X3) & (((X1) & (X2)) ^ (X6) ^ (X0))) ^ ((X1) & (X4)) ^ \ 00140 ((X2) & (X5)) ^ (X0)) 00141 00142 /* #define F4(X6, X5, X4, X3, X2, X1, X0) \ 00143 ((X1) & (X2) & (X3) ^ (X2) & (X4) & (X5) ^ (X3) & (X4) & (X6) ^ \ 00144 (X1) & (X4) ^ (X2) & (X6) ^ (X3) & (X4) ^ (X3) & (X5) ^ \ 00145 (X3) & (X6) ^ (X4) & (X5) ^ (X4) & (X6) ^ (X0) & (X4) ^(X0))*/ 00146 #define F4(X6, X5, X4, X3, X2, X1, X0) \ 00147 (((X4) & (((~(X2)) & (X5)) ^ ((X3) | (X6)) ^ (X1) ^ (X0))) ^ \ 00148 ((X3) & (((X1) & (X2)) ^ (X5) ^ (X6))) ^ ((X2) & (X6)) ^ (X0)) 00149 00150 /* #define F5(X6, X5, X4, X3, X2, X1, X0) \ 00151 ((X1) & (X4) ^ (X2) & (X5) ^ (X3) & (X6) ^ \ 00152 (X0) & (X1) & (X2) & (X3) ^ (X0) & (X5) ^ (X0))*/ 00153 #define F5(X6, X5, X4, X3, X2, X1, X0) \ 00154 (((X1) & ((X4) ^ ((X0) & (X2) & (X3)))) ^ \ 00155 (((X2) ^ (X0)) & (X5)) ^ ((X3) & (X6)) ^ (X0)) 00156 00157 #define p31(x) (x==0 ? 1 : (x==1 ? 0 : (x==2 ? 3 : (x==3 ? 5 : (x==4 ? 6 : (x==5 ? 2 : (x==6 ? 4 : 7))))))) 00158 #define p41(x) (x==0 ? 2 : (x==1 ? 6 : (x==2 ? 1 : (x==3 ? 4 : (x==4 ? 5 : (x==5 ? 3 : (x==6 ? 0 : 7))))))) 00159 #define p51(x) (x==0 ? 3 : (x==1 ? 4 : (x==2 ? 1 : (x==3 ? 0 : (x==4 ? 5 : (x==5 ? 2 : (x==6 ? 6 : 7))))))) 00160 #define p32(x) (x==0 ? 4 : (x==1 ? 2 : (x==2 ? 1 : (x==3 ? 0 : (x==4 ? 5 : (x==5 ? 3 : (x==6 ? 6 : 7))))))) 00161 #define p42(x) (x==0 ? 3 : (x==1 ? 5 : (x==2 ? 2 : (x==3 ? 0 : (x==4 ? 1 : (x==5 ? 6 : (x==6 ? 4 : 7))))))) 00162 #define p52(x) (x==0 ? 6 : (x==1 ? 2 : (x==2 ? 1 : (x==3 ? 0 : (x==4 ? 3 : (x==5 ? 4 : (x==6 ? 5 : 7))))))) 00163 #define p33(x) (x==0 ? 6 : (x==1 ? 1 : (x==2 ? 2 : (x==3 ? 3 : (x==4 ? 4 : (x==5 ? 5 : (x==6 ? 0 : 7))))))) 00164 #define p43(x) (x==0 ? 1 : (x==1 ? 4 : (x==2 ? 3 : (x==3 ? 6 : (x==4 ? 0 : (x==5 ? 2 : (x==6 ? 5 : 7))))))) 00165 #define p53(x) (x==0 ? 2 : (x==1 ? 6 : (x==2 ? 0 : (x==3 ? 4 : (x==4 ? 3 : (x==5 ? 1 : (x==6 ? 5 : 7))))))) 00166 #define p44(x) (x==0 ? 6 : (x==1 ? 4 : (x==2 ? 0 : (x==3 ? 5 : (x==4 ? 2 : (x==5 ? 1 : (x==6 ? 3 : 7))))))) 00167 #define p54(x) (x==0 ? 1 : (x==1 ? 5 : (x==2 ? 3 : (x==3 ? 2 : (x==4 ? 0 : (x==5 ? 4 : (x==6 ? 6 : 7))))))) 00168 #define p55(x) (x==0 ? 2 : (x==1 ? 5 : (x==2 ? 0 : (x==3 ? 6 : (x==4 ? 4 : (x==5 ? 3 : (x==6 ? 1 : 7))))))) 00169 00170 #define t(b,p,x,j) ((b&&((p(x)+8-j)%8<(8-j)))?E:T)[(p(x)+8-j)%8] 00171 00172 #define FF(b, e, F, p, j, w, c) \ 00173 T[7-j] = rotrFixed(F(t(b,p,0,j), t(b,p,1,j), t(b,p,2,j), t(b,p,3,j), t(b,p,4,j), t(b,p,5,j), t(b,p,6,j)), 7U) + rotrFixed(t(b,p,7,j), 11U) + w + c; \ 00174 if (e) E[7-j] += T[7-j]; 00175 00176 #ifdef CRYPTOPP_DOXYGEN_PROCESSING 00177 // Doxygen can't handle these macros 00178 #define Round1(t) 00179 #define Round(t, n) 00180 #else 00181 #define Round1(t) \ 00182 for (i=0; i<4; i++) \ 00183 { \ 00184 FF(i==0, 0, F1, p##t##1, 0, W[8*i+0], 0); \ 00185 FF(i==0, 0, F1, p##t##1, 1, W[8*i+1], 0); \ 00186 FF(i==0, 0, F1, p##t##1, 2, W[8*i+2], 0); \ 00187 FF(i==0, 0, F1, p##t##1, 3, W[8*i+3], 0); \ 00188 FF(i==0, 0, F1, p##t##1, 4, W[8*i+4], 0); \ 00189 FF(i==0, 0, F1, p##t##1, 5, W[8*i+5], 0); \ 00190 FF(i==0, 0, F1, p##t##1, 6, W[8*i+6], 0); \ 00191 FF(i==0, 0, F1, p##t##1, 7, W[8*i+7], 0); \ 00192 } 00193 #define Round(t, n) \ 00194 for (i=0; i<4; i++) \ 00195 { \ 00196 FF(0, t==n && i==3, F##n, p##t##n, 0, W[wi##n[8*i+0]], mc##n[8*i+0]); \ 00197 FF(0, t==n && i==3, F##n, p##t##n, 1, W[wi##n[8*i+1]], mc##n[8*i+1]); \ 00198 FF(0, t==n && i==3, F##n, p##t##n, 2, W[wi##n[8*i+2]], mc##n[8*i+2]); \ 00199 FF(0, t==n && i==3, F##n, p##t##n, 3, W[wi##n[8*i+3]], mc##n[8*i+3]); \ 00200 FF(0, t==n && i==3, F##n, p##t##n, 4, W[wi##n[8*i+4]], mc##n[8*i+4]); \ 00201 FF(0, t==n && i==3, F##n, p##t##n, 5, W[wi##n[8*i+5]], mc##n[8*i+5]); \ 00202 FF(0, t==n && i==3, F##n, p##t##n, 6, W[wi##n[8*i+6]], mc##n[8*i+6]); \ 00203 FF(0, t==n && i==3, F##n, p##t##n, 7, W[wi##n[8*i+7]], mc##n[8*i+7]); \ 00204 } 00205 #endif 00206 00207 const unsigned int HAVAL::wi2[32] = { 5,14,26,18,11,28, 7,16, 0,23,20,22, 1,10, 4, 8,30, 3,21, 9,17,24,29, 6,19,12,15,13, 2,25,31,27}; 00208 const unsigned int HAVAL::wi3[32] = {19, 9, 4,20,28,17, 8,22,29,14,25,12,24,30,16,26,31,15, 7, 3, 1, 0,18,27,13, 6,21,10,23,11, 5, 2}; 00209 const unsigned int HAVAL::wi4[32] = {24, 4, 0,14, 2, 7,28,23,26, 6,30,20,18,25,19, 3,22,11,31,21, 8,27,12, 9, 1,29, 5,15,17,10,16,13}; 00210 const unsigned int HAVAL::wi5[32] = {27, 3,21,26,17,11,20,29,19, 0,12, 7,13, 8,31,10, 5, 9,14,30,18, 6,28,24, 2,23,16,22, 4, 1,25,15}; 00211 00212 const word32 HAVAL::mc2[32] = { 00213 0x452821E6, 0x38D01377, 0xBE5466CF, 0x34E90C6C, 0xC0AC29B7, 0xC97C50DD, 0x3F84D5B5, 0xB5470917 00214 , 0x9216D5D9, 0x8979FB1B, 0xD1310BA6, 0x98DFB5AC, 0x2FFD72DB, 0xD01ADFB7, 0xB8E1AFED, 0x6A267E96 00215 , 0xBA7C9045, 0xF12C7F99, 0x24A19947, 0xB3916CF7, 0x0801F2E2, 0x858EFC16, 0x636920D8, 0x71574E69 00216 , 0xA458FEA3, 0xF4933D7E, 0x0D95748F, 0x728EB658, 0x718BCD58, 0x82154AEE, 0x7B54A41D, 0xC25A59B5}; 00217 00218 const word32 HAVAL::mc3[32] = { 00219 0x9C30D539,0x2AF26013,0xC5D1B023,0x286085F0,0xCA417918,0xB8DB38EF,0x8E79DCB0,0x603A180E, 00220 0x6C9E0E8B,0xB01E8A3E,0xD71577C1,0xBD314B27,0x78AF2FDA,0x55605C60,0xE65525F3,0xAA55AB94, 00221 0x57489862,0x63E81440,0x55CA396A,0x2AAB10B6,0xB4CC5C34,0x1141E8CE,0xA15486AF,0x7C72E993, 00222 0xB3EE1411,0x636FBC2A,0x2BA9C55D,0x741831F6,0xCE5C3E16,0x9B87931E,0xAFD6BA33,0x6C24CF5C}; 00223 00224 const word32 HAVAL::mc4[32] = { 00225 0x7A325381,0x28958677,0x3B8F4898,0x6B4BB9AF,0xC4BFE81B,0x66282193,0x61D809CC,0xFB21A991, 00226 0x487CAC60,0x5DEC8032,0xEF845D5D,0xE98575B1,0xDC262302,0xEB651B88,0x23893E81,0xD396ACC5, 00227 0x0F6D6FF3,0x83F44239,0x2E0B4482,0xA4842004,0x69C8F04A,0x9E1F9B5E,0x21C66842,0xF6E96C9A, 00228 0x670C9C61,0xABD388F0,0x6A51A0D2,0xD8542F68,0x960FA728,0xAB5133A3,0x6EEF0B6C,0x137A3BE4}; 00229 00230 const word32 HAVAL::mc5[32] = { 00231 0xBA3BF050,0x7EFB2A98,0xA1F1651D,0x39AF0176,0x66CA593E,0x82430E88,0x8CEE8619,0x456F9FB4, 00232 0x7D84A5C3,0x3B8B5EBE,0xE06F75D8,0x85C12073,0x401A449F,0x56C16AA6,0x4ED3AA62,0x363F7706, 00233 0x1BFEDF72,0x429B023D,0x37D0D724,0xD00A1248,0xDB0FEAD3,0x49F1C09B,0x075372C9,0x80991B7B, 00234 0x25D479D8,0xF6E8DEF7,0xE3FE501A,0xB6794C3B,0x976CE0BD,0x04C006BA,0xC1A94FB6,0x409F60C4}; 00235 00236 void HAVAL3::Transform(word32 *E, const word32 *W) 00237 { 00238 word32 T[8]; 00239 unsigned int i; 00240 00241 Round1(3); 00242 Round(3, 2); 00243 Round(3, 3); 00244 00245 memset(T, 0, sizeof(T)); 00246 } 00247 00248 void HAVAL4::Transform(word32 *E, const word32 *W) 00249 { 00250 word32 T[8]; 00251 unsigned int i; 00252 00253 Round1(4); 00254 Round(4, 2); 00255 Round(4, 3); 00256 Round(4, 4); 00257 00258 memset(T, 0, sizeof(T)); 00259 } 00260 00261 void HAVAL5::Transform(word32 *E, const word32 *W) 00262 { 00263 word32 T[8]; 00264 unsigned int i; 00265 00266 Round1(5); 00267 Round(5, 2); 00268 Round(5, 3); 00269 Round(5, 4); 00270 Round(5, 5); 00271 00272 memset(T, 0, sizeof(T)); 00273 } 00274 00275 NAMESPACE_END

Generated on Wed Jul 28 08:07:07 2004 for Crypto++ by doxygen 1.3.7