mirror of https://github.com/hashcat/hashcat
added pkzip kernels 17200, 17210, 17220 and 17230
This commit is contained in:
Sein Coray
parent
836c91c8c2
commit
97249ba1ca
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,967 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_zip_inflate.cl"
|
||||
#include "inc_rp.h"
|
||||
#include "inc_rp.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
typedef struct {
|
||||
u8 op; /* operation, extra bits, table bits */
|
||||
u8 bits; /* bits in this part of the code */
|
||||
u16 val; /* offset in table or code value */
|
||||
} code;
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hash;
|
||||
} pkzip_t;
|
||||
|
||||
__constant code lenfix[512] = {
|
||||
{96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48},
|
||||
{0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128},
|
||||
{0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59},
|
||||
{0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176},
|
||||
{0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20},
|
||||
{21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100},
|
||||
{0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8},
|
||||
{0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216},
|
||||
{18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76},
|
||||
{0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114},
|
||||
{0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},
|
||||
{0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148},
|
||||
{20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42},
|
||||
{0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86},
|
||||
{0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15},
|
||||
{0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236},
|
||||
{16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62},
|
||||
{0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},
|
||||
{0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31},
|
||||
{0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162},
|
||||
{0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25},
|
||||
{0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105},
|
||||
{0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4},
|
||||
{0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202},
|
||||
{17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69},
|
||||
{0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125},
|
||||
{0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13},
|
||||
{0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195},
|
||||
{19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35},
|
||||
{0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91},
|
||||
{0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19},
|
||||
{0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246},
|
||||
{16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55},
|
||||
{0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135},
|
||||
{0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99},
|
||||
{0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190},
|
||||
{0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16},
|
||||
{20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96},
|
||||
{0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6},
|
||||
{0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209},
|
||||
{17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},
|
||||
{0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116},
|
||||
{0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4},
|
||||
{0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153},
|
||||
{20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44},
|
||||
{0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82},
|
||||
{0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11},
|
||||
{0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},
|
||||
{16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58},
|
||||
{0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138},
|
||||
{0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51},
|
||||
{0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173},
|
||||
{0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30},
|
||||
{0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110},
|
||||
{0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0},
|
||||
{0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195},
|
||||
{16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65},
|
||||
{0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121},
|
||||
{0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},
|
||||
{0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258},
|
||||
{19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37},
|
||||
{0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93},
|
||||
{0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23},
|
||||
{0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251},
|
||||
{16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51},
|
||||
{0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},
|
||||
{0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67},
|
||||
{0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183},
|
||||
{0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23},
|
||||
{64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103},
|
||||
{0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9},
|
||||
{0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223},
|
||||
{18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79},
|
||||
{0,9,255}
|
||||
};
|
||||
|
||||
__constant code distfix[32] = {
|
||||
{16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025},
|
||||
{21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193},
|
||||
{18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385},
|
||||
{19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577},
|
||||
{16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073},
|
||||
{22,5,193},{64,5,0}
|
||||
};
|
||||
|
||||
DECLSPEC int check_inflate_code2 (u8 *next)
|
||||
{
|
||||
u32 bits, hold, thisget, have, i;
|
||||
int left;
|
||||
u32 ncode;
|
||||
u32 ncount[2]; // ends up being an array of 8 u8 count values. But we can clear it, and later 'check' it with 2 u32 instructions.
|
||||
u8 *count; // this will point to ncount array. NOTE, this is alignment required 'safe' for Sparc systems or others requiring alignment.
|
||||
hold = *next + (((u32)next[1])<<8) + (((u32)next[2])<<16) + (((u32)next[3])<<24);
|
||||
next += 3; // we pre-increment when pulling it in the loop, thus we need to be 1 byte back.
|
||||
hold >>= 3; // we already processed 3 bits
|
||||
count = (u8*)ncount;
|
||||
|
||||
if (257+(hold&0x1F) > 286)
|
||||
{
|
||||
return 0; // nlen, but we do not use it.
|
||||
}
|
||||
hold >>= 5;
|
||||
if (1+(hold&0x1F) > 30)
|
||||
{
|
||||
return 0; // ndist, but we do not use it.
|
||||
}
|
||||
hold >>= 5;
|
||||
ncode = 4+(hold&0xF);
|
||||
hold >>= 4;
|
||||
|
||||
// we have 15 bits left.
|
||||
hold += ((u32)(*++next)) << 15;
|
||||
hold += ((u32)(*++next)) << 23;
|
||||
// we now have 31 bits. We need to know this for the loop below.
|
||||
bits = 31;
|
||||
|
||||
// We have 31 bits now, in accum. If we are processing 19 codes, we do 7, then have 10 bits.
|
||||
// Add 16 more and have 26, then use 21, have 5. Then load 16 more, then eat 15 of them.
|
||||
have = 0;
|
||||
|
||||
ncount[0] = ncount[1] = 0;
|
||||
for (;;)
|
||||
{
|
||||
if (have+7>ncode)
|
||||
{
|
||||
thisget = ncode-have;
|
||||
}
|
||||
else
|
||||
{
|
||||
thisget = 7;
|
||||
}
|
||||
have += thisget;
|
||||
bits -= thisget*3;
|
||||
while (thisget--)
|
||||
{
|
||||
++count[hold&7];
|
||||
hold>>=3;
|
||||
}
|
||||
if (have == ncode)
|
||||
{
|
||||
break;
|
||||
}
|
||||
hold += ((u32)(*++next)) << bits;
|
||||
bits += 8;
|
||||
hold += ((u32)(*++next)) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
count[0] = 0;
|
||||
if (!ncount[0] && !ncount[1])
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
left = 1;
|
||||
for (i = 1; i <= 7; ++i)
|
||||
{
|
||||
left <<= 1;
|
||||
left -= count[i];
|
||||
if (left < 0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
if (left > 0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
|
||||
DECLSPEC int check_inflate_code1 (u8 *next, int left){
|
||||
u32 whave = 0, op, bits, hold,len;
|
||||
code here1;
|
||||
|
||||
hold = *next + (((u32)next[1])<<8) + (((u32)next[2])<<16) + (((u32)next[3])<<24);
|
||||
next += 3; // we pre-increment when pulling it in the loop, thus we need to be 1 byte back.
|
||||
left -= 4;
|
||||
hold >>= 3; // we already processed 3 bits
|
||||
bits = 32-3;
|
||||
for (;;)
|
||||
{
|
||||
if (bits < 15)
|
||||
{
|
||||
if (left < 2)
|
||||
{
|
||||
return 1; // we are out of bytes. Return we had no error.
|
||||
}
|
||||
left -= 2;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
here1=lenfix[hold & 0x1FF];
|
||||
op = (unsigned)(here1.bits);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
op = (unsigned)(here1.op);
|
||||
if (op == 0)
|
||||
{
|
||||
++whave;
|
||||
}
|
||||
else if (op & 16)
|
||||
{
|
||||
len = (unsigned)(here1.val);
|
||||
op &= 15;
|
||||
if (op)
|
||||
{
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
len += (unsigned)hold & ((1U << op) - 1);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
}
|
||||
if (bits < 15)
|
||||
{
|
||||
if (left < 2)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
left -= 2;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
code here2 = distfix[hold & 0x1F];
|
||||
op = (unsigned)(here2.bits);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
op = (unsigned)(here2.op);
|
||||
if (op & 16) /* distance base */
|
||||
{
|
||||
u32 dist = (unsigned)(here2.val);
|
||||
op &= 15;
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
}
|
||||
dist += (unsigned)hold & ((1U << op) - 1);
|
||||
if (dist > whave)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
|
||||
whave += len;
|
||||
}
|
||||
else
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
else if (op & 32)
|
||||
{
|
||||
if (left == 0)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17200_sxx (KERN_ATTR_RULES_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
COPY_PW (pws[gid]);
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
pw_t tmp = PASTE_PW;
|
||||
|
||||
tmp.pw_len = apply_rules (rules_buf[il_pos].cmds, tmp.i, tmp.pw_len);
|
||||
|
||||
key0 = 0x12345678;
|
||||
key1 = 0x23456789;
|
||||
key2 = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < tmp.pw_len; i++)
|
||||
{
|
||||
key0 = CRC32 (key0, (tmp.i[i >> 2] >> ((i & 3) << 3)) & 0xff);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
}
|
||||
|
||||
u8 compressed[MAX_COMPRESSED_LENGTH];
|
||||
u8 abort = 0;
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
compressed[0] = plain;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
for (unsigned int i = 13; i < 36; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
compressed[i - 12] = plain;
|
||||
}
|
||||
|
||||
if (((compressed[0]) & 6) == 2 && !check_inflate_code1 (compressed, 36))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
if (((compressed[0]) & 6) == 4 && !check_inflate_code2 (compressed))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
|
||||
if (abort)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
for (unsigned int i = 36; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
compressed[i - 12] = plain;
|
||||
}
|
||||
|
||||
unsigned char inflated[MAX_UNCOMPRESSED_LENGTH];
|
||||
mz_stream infstream;
|
||||
inflate_state pStream;
|
||||
infstream.zalloc = Z_NULL;
|
||||
infstream.zfree = Z_NULL;
|
||||
infstream.opaque = Z_NULL;
|
||||
infstream.avail_in = esalt_bufs[digests_offset].hash.data_length - 12; // size of input
|
||||
infstream.next_in = (Bytef *) compressed; // input char array
|
||||
infstream.avail_out = 2048; // size of output
|
||||
infstream.next_out = (Bytef *) inflated; // output char array
|
||||
|
||||
// inflateinit2 is needed because otherwise it checks for headers by default
|
||||
mz_inflateInit2 (&infstream, -MAX_WBITS, &pStream);
|
||||
|
||||
const int ret = mz_inflate (&infstream, Z_NO_FLUSH);
|
||||
if (ret < 0)
|
||||
{
|
||||
continue; // failed to inflate
|
||||
}
|
||||
|
||||
// check CRC
|
||||
u32x crc = 0xffffffff;
|
||||
for (unsigned int k = 0; k < infstream.total_out; ++k)
|
||||
{
|
||||
crc = CRC32 (crc, inflated[k]);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17200_mxx (KERN_ATTR_RULES_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
COPY_PW (pws[gid]);
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
pw_t tmp = PASTE_PW;
|
||||
|
||||
tmp.pw_len = apply_rules (rules_buf[il_pos].cmds, tmp.i, tmp.pw_len);
|
||||
|
||||
key0 = 0x12345678;
|
||||
key1 = 0x23456789;
|
||||
key2 = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < tmp.pw_len; i++)
|
||||
{
|
||||
key0 = CRC32 (key0, (tmp.i[i >> 2] >> ((i & 3) << 3)) & 0xff);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
}
|
||||
|
||||
u8 compressed[MAX_COMPRESSED_LENGTH];
|
||||
u8 abort = 0;
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
compressed[0] = plain;
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
for (unsigned int i = 13; i < 36; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
compressed[i - 12] = plain;
|
||||
}
|
||||
|
||||
if (((compressed[0]) & 6) == 2 && !check_inflate_code1 (compressed, 36))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
if (((compressed[0]) & 6) == 4 && !check_inflate_code2 (compressed))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
|
||||
if (abort)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
for (unsigned int i = 36; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32 (key0, plain);
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32 (key2, MSB(key1));
|
||||
|
||||
compressed[i - 12] = plain;
|
||||
}
|
||||
|
||||
unsigned char inflated[MAX_UNCOMPRESSED_LENGTH];
|
||||
mz_stream infstream;
|
||||
inflate_state pStream;
|
||||
infstream.zalloc = Z_NULL;
|
||||
infstream.zfree = Z_NULL;
|
||||
infstream.opaque = Z_NULL;
|
||||
infstream.avail_in = esalt_bufs[digests_offset].hash.data_length - 12; // size of input
|
||||
infstream.next_in = (Bytef *) compressed; // input char array
|
||||
infstream.avail_out = 2048; // size of output
|
||||
infstream.next_out = (Bytef *) inflated; // output char array
|
||||
|
||||
// inflateinit2 is needed because otherwise it checks for headers by default
|
||||
mz_inflateInit2 (&infstream, -MAX_WBITS, &pStream);
|
||||
|
||||
const int ret = mz_inflate (&infstream, Z_NO_FLUSH);
|
||||
if (ret < 0)
|
||||
{
|
||||
continue; // failed to inflate
|
||||
}
|
||||
|
||||
// check CRC
|
||||
u32x crc = 0xffffffff;
|
||||
for (unsigned int k = 0; k < infstream.total_out; ++k)
|
||||
{
|
||||
crc = CRC32 (crc, inflated[k]);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,967 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_zip_inflate.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
typedef struct {
|
||||
u8 op; /* operation, extra bits, table bits */
|
||||
u8 bits; /* bits in this part of the code */
|
||||
u16 val; /* offset in table or code value */
|
||||
} code;
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hash;
|
||||
} pkzip_t;
|
||||
|
||||
__constant code lenfix[512] = {
|
||||
{96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48},
|
||||
{0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128},
|
||||
{0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59},
|
||||
{0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176},
|
||||
{0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20},
|
||||
{21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100},
|
||||
{0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8},
|
||||
{0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216},
|
||||
{18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76},
|
||||
{0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114},
|
||||
{0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},
|
||||
{0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148},
|
||||
{20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42},
|
||||
{0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86},
|
||||
{0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15},
|
||||
{0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236},
|
||||
{16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62},
|
||||
{0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},
|
||||
{0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31},
|
||||
{0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162},
|
||||
{0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25},
|
||||
{0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105},
|
||||
{0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4},
|
||||
{0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202},
|
||||
{17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69},
|
||||
{0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125},
|
||||
{0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13},
|
||||
{0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195},
|
||||
{19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35},
|
||||
{0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91},
|
||||
{0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19},
|
||||
{0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246},
|
||||
{16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55},
|
||||
{0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135},
|
||||
{0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99},
|
||||
{0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190},
|
||||
{0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16},
|
||||
{20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96},
|
||||
{0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6},
|
||||
{0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209},
|
||||
{17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},
|
||||
{0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116},
|
||||
{0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4},
|
||||
{0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153},
|
||||
{20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44},
|
||||
{0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82},
|
||||
{0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11},
|
||||
{0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},
|
||||
{16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58},
|
||||
{0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138},
|
||||
{0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51},
|
||||
{0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173},
|
||||
{0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30},
|
||||
{0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110},
|
||||
{0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0},
|
||||
{0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195},
|
||||
{16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65},
|
||||
{0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121},
|
||||
{0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},
|
||||
{0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258},
|
||||
{19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37},
|
||||
{0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93},
|
||||
{0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23},
|
||||
{0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251},
|
||||
{16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51},
|
||||
{0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},
|
||||
{0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67},
|
||||
{0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183},
|
||||
{0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23},
|
||||
{64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103},
|
||||
{0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9},
|
||||
{0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223},
|
||||
{18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79},
|
||||
{0,9,255}
|
||||
};
|
||||
|
||||
__constant code distfix[32] = {
|
||||
{16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025},
|
||||
{21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193},
|
||||
{18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385},
|
||||
{19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577},
|
||||
{16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073},
|
||||
{22,5,193},{64,5,0}
|
||||
};
|
||||
|
||||
DECLSPEC int check_inflate_code2 (u8 *next)
|
||||
{
|
||||
u32 bits, hold, thisget, have, i;
|
||||
int left;
|
||||
u32 ncode;
|
||||
u32 ncount[2]; // ends up being an array of 8 u8 count values. But we can clear it, and later 'check' it with 2 u32 instructions.
|
||||
u8 *count; // this will point to ncount array. NOTE, this is alignment required 'safe' for Sparc systems or others requiring alignment.
|
||||
hold = *next + (((u32)next[1])<<8) + (((u32)next[2])<<16) + (((u32)next[3])<<24);
|
||||
next += 3; // we pre-increment when pulling it in the loop, thus we need to be 1 byte back.
|
||||
hold >>= 3; // we already processed 3 bits
|
||||
count = (u8*)ncount;
|
||||
|
||||
if (257+(hold&0x1F) > 286)
|
||||
{
|
||||
return 0; // nlen, but we do not use it.
|
||||
}
|
||||
hold >>= 5;
|
||||
if (1+(hold&0x1F) > 30)
|
||||
{
|
||||
return 0; // ndist, but we do not use it.
|
||||
}
|
||||
hold >>= 5;
|
||||
ncode = 4+(hold&0xF);
|
||||
hold >>= 4;
|
||||
|
||||
// we have 15 bits left.
|
||||
hold += ((u32)(*++next)) << 15;
|
||||
hold += ((u32)(*++next)) << 23;
|
||||
// we now have 31 bits. We need to know this for the loop below.
|
||||
bits = 31;
|
||||
|
||||
// We have 31 bits now, in accum. If we are processing 19 codes, we do 7, then have 10 bits.
|
||||
// Add 16 more and have 26, then use 21, have 5. Then load 16 more, then eat 15 of them.
|
||||
have = 0;
|
||||
|
||||
ncount[0] = ncount[1] = 0;
|
||||
for (;;)
|
||||
{
|
||||
if (have+7>ncode)
|
||||
{
|
||||
thisget = ncode-have;
|
||||
}
|
||||
else
|
||||
{
|
||||
thisget = 7;
|
||||
}
|
||||
have += thisget;
|
||||
bits -= thisget*3;
|
||||
while (thisget--)
|
||||
{
|
||||
++count[hold&7];
|
||||
hold>>=3;
|
||||
}
|
||||
if (have == ncode)
|
||||
{
|
||||
break;
|
||||
}
|
||||
hold += ((u32)(*++next)) << bits;
|
||||
bits += 8;
|
||||
hold += ((u32)(*++next)) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
count[0] = 0;
|
||||
if (!ncount[0] && !ncount[1])
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
left = 1;
|
||||
for (i = 1; i <= 7; ++i)
|
||||
{
|
||||
left <<= 1;
|
||||
left -= count[i];
|
||||
if (left < 0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
if (left > 0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
|
||||
DECLSPEC int check_inflate_code1 (u8 *next, int left){
|
||||
u32 whave = 0, op, bits, hold,len;
|
||||
code here1;
|
||||
|
||||
hold = *next + (((u32)next[1])<<8) + (((u32)next[2])<<16) + (((u32)next[3])<<24);
|
||||
next += 3; // we pre-increment when pulling it in the loop, thus we need to be 1 byte back.
|
||||
left -= 4;
|
||||
hold >>= 3; // we already processed 3 bits
|
||||
bits = 32-3;
|
||||
for (;;)
|
||||
{
|
||||
if (bits < 15)
|
||||
{
|
||||
if (left < 2)
|
||||
{
|
||||
return 1; // we are out of bytes. Return we had no error.
|
||||
}
|
||||
left -= 2;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
here1=lenfix[hold & 0x1FF];
|
||||
op = (unsigned)(here1.bits);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
op = (unsigned)(here1.op);
|
||||
if (op == 0)
|
||||
{
|
||||
++whave;
|
||||
}
|
||||
else if (op & 16)
|
||||
{
|
||||
len = (unsigned)(here1.val);
|
||||
op &= 15;
|
||||
if (op)
|
||||
{
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
len += (unsigned)hold & ((1U << op) - 1);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
}
|
||||
if (bits < 15)
|
||||
{
|
||||
if (left < 2)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
left -= 2;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
code here2 = distfix[hold & 0x1F];
|
||||
op = (unsigned)(here2.bits);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
op = (unsigned)(here2.op);
|
||||
if (op & 16) /* distance base */
|
||||
{
|
||||
u32 dist = (unsigned)(here2.val);
|
||||
op &= 15;
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
}
|
||||
dist += (unsigned)hold & ((1U << op) - 1);
|
||||
if (dist > whave)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
|
||||
whave += len;
|
||||
}
|
||||
else
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
else if (op & 32)
|
||||
{
|
||||
if (left == 0)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17200_sxx (KERN_ATTR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pws[gid].pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (pws[gid].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
key0 = key0init;
|
||||
key1 = key1init;
|
||||
key2 = key2init;
|
||||
|
||||
for (u8 i = 0; i < combs_buf[il_pos].pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (combs_buf[il_pos].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 compressed[MAX_COMPRESSED_LENGTH];
|
||||
u8 abort = 0;
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
compressed[0] = plain;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
for (unsigned int i = 13; i < 36; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
compressed[i-12] = plain;
|
||||
}
|
||||
|
||||
if (((compressed[0]) & 6) == 2 && !check_inflate_code1 (compressed, 36))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
if (((compressed[0]) & 6) == 4 && !check_inflate_code2 (compressed))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
|
||||
if (abort)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
for (unsigned int i = 36; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
compressed[i - 12] = plain;
|
||||
}
|
||||
|
||||
unsigned char inflated[MAX_UNCOMPRESSED_LENGTH];
|
||||
mz_stream infstream;
|
||||
inflate_state pStream;
|
||||
infstream.zalloc = Z_NULL;
|
||||
infstream.zfree = Z_NULL;
|
||||
infstream.opaque = Z_NULL;
|
||||
infstream.avail_in = esalt_bufs[digests_offset].hash.data_length - 12; // size of input
|
||||
infstream.next_in = (Bytef *)compressed; // input char array
|
||||
infstream.avail_out = 2048; // size of output
|
||||
infstream.next_out = (Bytef *)inflated; // output char array
|
||||
|
||||
// inflateinit2 is needed because otherwise it checks for headers by default
|
||||
mz_inflateInit2(&infstream, -MAX_WBITS, &pStream);
|
||||
int ret = mz_inflate(&infstream, Z_NO_FLUSH);
|
||||
if (ret < 0)
|
||||
{
|
||||
continue; // failed to inflate
|
||||
}
|
||||
|
||||
// check CRC
|
||||
u32x crc = 0xffffffff;
|
||||
for (unsigned int k = 0; k < infstream.total_out; ++k)
|
||||
{
|
||||
crc = CRC32(crc, inflated[k]);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17200_mxx (KERN_ATTR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for(u8 i = 0; i < pws[gid].pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (pws[gid].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
key0 = key0init;
|
||||
key1 = key1init;
|
||||
key2 = key2init;
|
||||
|
||||
for(u8 i = 0; i < combs_buf[il_pos].pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (combs_buf[il_pos].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 compressed[MAX_COMPRESSED_LENGTH];
|
||||
u8 abort = 0;
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
compressed[0] = plain;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
for (unsigned int i = 13; i < 36; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
compressed[i-12] = plain;
|
||||
}
|
||||
|
||||
if (((compressed[0]) & 6) == 2 && !check_inflate_code1 (compressed, 36))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
if (((compressed[0]) & 6) == 4 && !check_inflate_code2 (compressed))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
|
||||
if (abort)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
for (unsigned int i = 36; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
compressed[i - 12] = plain;
|
||||
}
|
||||
|
||||
unsigned char inflated[MAX_UNCOMPRESSED_LENGTH];
|
||||
mz_stream infstream;
|
||||
inflate_state pStream;
|
||||
infstream.zalloc = Z_NULL;
|
||||
infstream.zfree = Z_NULL;
|
||||
infstream.opaque = Z_NULL;
|
||||
infstream.avail_in = esalt_bufs[digests_offset].hash.data_length - 12; // size of input
|
||||
infstream.next_in = (Bytef *)compressed; // input char array
|
||||
infstream.avail_out = 2048; // size of output
|
||||
infstream.next_out = (Bytef *)inflated; // output char array
|
||||
|
||||
// inflateinit2 is needed because otherwise it checks for headers by default
|
||||
mz_inflateInit2(&infstream, -MAX_WBITS, &pStream);
|
||||
int ret = mz_inflate(&infstream, Z_NO_FLUSH);
|
||||
if (ret < 0)
|
||||
{
|
||||
continue; // failed to inflate
|
||||
}
|
||||
|
||||
// check CRC
|
||||
u32x crc = 0xffffffff;
|
||||
for (unsigned int k = 0; k < infstream.total_out; ++k)
|
||||
{
|
||||
crc = CRC32(crc, inflated[k]);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,979 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_zip_inflate.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
typedef struct {
|
||||
u8 op; /* operation, extra bits, table bits */
|
||||
u8 bits; /* bits in this part of the code */
|
||||
u16 val; /* offset in table or code value */
|
||||
} code;
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hash;
|
||||
} pkzip_t;
|
||||
|
||||
__constant code lenfix[512] = {
|
||||
{96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48},
|
||||
{0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128},
|
||||
{0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59},
|
||||
{0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176},
|
||||
{0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20},
|
||||
{21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100},
|
||||
{0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8},
|
||||
{0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216},
|
||||
{18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76},
|
||||
{0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114},
|
||||
{0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},
|
||||
{0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148},
|
||||
{20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42},
|
||||
{0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86},
|
||||
{0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15},
|
||||
{0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236},
|
||||
{16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62},
|
||||
{0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},
|
||||
{0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31},
|
||||
{0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162},
|
||||
{0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25},
|
||||
{0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105},
|
||||
{0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4},
|
||||
{0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202},
|
||||
{17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69},
|
||||
{0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125},
|
||||
{0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13},
|
||||
{0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195},
|
||||
{19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35},
|
||||
{0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91},
|
||||
{0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19},
|
||||
{0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246},
|
||||
{16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55},
|
||||
{0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135},
|
||||
{0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99},
|
||||
{0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190},
|
||||
{0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16},
|
||||
{20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96},
|
||||
{0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6},
|
||||
{0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209},
|
||||
{17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},
|
||||
{0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116},
|
||||
{0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4},
|
||||
{0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153},
|
||||
{20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44},
|
||||
{0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82},
|
||||
{0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11},
|
||||
{0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},
|
||||
{16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58},
|
||||
{0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138},
|
||||
{0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51},
|
||||
{0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173},
|
||||
{0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30},
|
||||
{0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110},
|
||||
{0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0},
|
||||
{0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195},
|
||||
{16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65},
|
||||
{0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121},
|
||||
{0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},
|
||||
{0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258},
|
||||
{19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37},
|
||||
{0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93},
|
||||
{0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23},
|
||||
{0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251},
|
||||
{16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51},
|
||||
{0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},
|
||||
{0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67},
|
||||
{0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183},
|
||||
{0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23},
|
||||
{64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103},
|
||||
{0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9},
|
||||
{0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223},
|
||||
{18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79},
|
||||
{0,9,255}
|
||||
};
|
||||
|
||||
__constant code distfix[32] = {
|
||||
{16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025},
|
||||
{21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193},
|
||||
{18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385},
|
||||
{19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577},
|
||||
{16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073},
|
||||
{22,5,193},{64,5,0}
|
||||
};
|
||||
|
||||
DECLSPEC int check_inflate_code2(u8 *next)
|
||||
{
|
||||
u32 bits, hold, thisget, have, i;
|
||||
int left;
|
||||
u32 ncode;
|
||||
u32 ncount[2]; // ends up being an array of 8 u8 count values. But we can clear it, and later 'check' it with 2 u32 instructions.
|
||||
u8 *count; // this will point to ncount array. NOTE, this is alignment required 'safe' for Sparc systems or others requiring alignment.
|
||||
hold = *next + (((u32)next[1])<<8) + (((u32)next[2])<<16) + (((u32)next[3])<<24);
|
||||
next += 3; // we pre-increment when pulling it in the loop, thus we need to be 1 byte back.
|
||||
hold >>= 3; // we already processed 3 bits
|
||||
count = (u8*)ncount;
|
||||
|
||||
if (257+(hold&0x1F) > 286)
|
||||
{
|
||||
return 0; // nlen, but we do not use it.
|
||||
}
|
||||
hold >>= 5;
|
||||
if (1+(hold&0x1F) > 30)
|
||||
{
|
||||
return 0; // ndist, but we do not use it.
|
||||
}
|
||||
hold >>= 5;
|
||||
ncode = 4+(hold&0xF);
|
||||
hold >>= 4;
|
||||
|
||||
// we have 15 bits left.
|
||||
hold += ((u32)(*++next)) << 15;
|
||||
hold += ((u32)(*++next)) << 23;
|
||||
// we now have 31 bits. We need to know this for the loop below.
|
||||
bits = 31;
|
||||
|
||||
// We have 31 bits now, in accum. If we are processing 19 codes, we do 7, then have 10 bits.
|
||||
// Add 16 more and have 26, then use 21, have 5. Then load 16 more, then eat 15 of them.
|
||||
have = 0;
|
||||
|
||||
ncount[0] = ncount[1] = 0;
|
||||
for (;;)
|
||||
{
|
||||
if (have+7>ncode)
|
||||
{
|
||||
thisget = ncode-have;
|
||||
}
|
||||
else
|
||||
{
|
||||
thisget = 7;
|
||||
}
|
||||
have += thisget;
|
||||
bits -= thisget*3;
|
||||
while (thisget--)
|
||||
{
|
||||
++count[hold&7];
|
||||
hold>>=3;
|
||||
}
|
||||
if (have == ncode)
|
||||
{
|
||||
break;
|
||||
}
|
||||
hold += ((u32)(*++next)) << bits;
|
||||
bits += 8;
|
||||
hold += ((u32)(*++next)) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
count[0] = 0;
|
||||
if (!ncount[0] && !ncount[1])
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
left = 1;
|
||||
for (i = 1; i <= 7; ++i)
|
||||
{
|
||||
left <<= 1;
|
||||
left -= count[i];
|
||||
if (left < 0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
if (left > 0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
|
||||
DECLSPEC int check_inflate_code1(u8 *next, int left){
|
||||
u32 whave = 0, op, bits, hold,len;
|
||||
code here1;
|
||||
|
||||
hold = *next + (((u32)next[1])<<8) + (((u32)next[2])<<16) + (((u32)next[3])<<24);
|
||||
next += 3; // we pre-increment when pulling it in the loop, thus we need to be 1 byte back.
|
||||
left -= 4;
|
||||
hold >>= 3; // we already processed 3 bits
|
||||
bits = 32-3;
|
||||
for (;;)
|
||||
{
|
||||
if (bits < 15)
|
||||
{
|
||||
if (left < 2)
|
||||
{
|
||||
return 1; // we are out of bytes. Return we had no error.
|
||||
}
|
||||
left -= 2;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
here1=lenfix[hold & 0x1FF];
|
||||
op = (unsigned)(here1.bits);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
op = (unsigned)(here1.op);
|
||||
if (op == 0)
|
||||
{
|
||||
++whave;
|
||||
}
|
||||
else if (op & 16)
|
||||
{
|
||||
len = (unsigned)(here1.val);
|
||||
op &= 15;
|
||||
if (op)
|
||||
{
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
len += (unsigned)hold & ((1U << op) - 1);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
}
|
||||
if (bits < 15)
|
||||
{
|
||||
if (left < 2)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
left -= 2;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
code here2 = distfix[hold & 0x1F];
|
||||
op = (unsigned)(here2.bits);
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
op = (unsigned)(here2.op);
|
||||
if (op & 16) /* distance base */
|
||||
{
|
||||
u32 dist = (unsigned)(here2.val);
|
||||
op &= 15;
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
if (bits < op)
|
||||
{
|
||||
if (!left)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
--left;
|
||||
hold += (u32)(*++next) << bits;
|
||||
bits += 8;
|
||||
}
|
||||
}
|
||||
dist += (unsigned)hold & ((1U << op) - 1);
|
||||
if (dist > whave)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
hold >>= op;
|
||||
bits -= op;
|
||||
|
||||
whave += len;
|
||||
}
|
||||
else
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
else if (op & 32)
|
||||
{
|
||||
if (left == 0)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17200_sxx (KERN_ATTR_VECTOR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
const u32 pw_len = pws[gid].pw_len;
|
||||
|
||||
u32x w[64] = { 0 };
|
||||
|
||||
for (int i = 0, idx = 0; i < pw_len; i += 4, idx += 1)
|
||||
{
|
||||
w[idx] = pws[gid].i[idx];
|
||||
}
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32 w0l = w[0];
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos += VECT_SIZE)
|
||||
{
|
||||
const u32x w0r = words_buf_r[il_pos / VECT_SIZE];
|
||||
const u32x w0 = w0l | w0r;
|
||||
w[0] = w0;
|
||||
|
||||
key0 = 0x12345678;
|
||||
key1 = 0x23456789;
|
||||
key2 = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (w[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 compressed[MAX_COMPRESSED_LENGTH];
|
||||
u8 abort = 0;
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
compressed[0] = plain;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
for (unsigned int i = 13; i < 36; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
compressed[i-12] = plain;
|
||||
}
|
||||
|
||||
if (((compressed[0]) & 6) == 2 && !check_inflate_code1 (compressed, 36))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
if (((compressed[0]) & 6) == 4 && !check_inflate_code2 (compressed))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
|
||||
if (abort)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
for (unsigned int i = 36; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
compressed[i - 12] = plain;
|
||||
}
|
||||
|
||||
unsigned char inflated[MAX_UNCOMPRESSED_LENGTH];
|
||||
mz_stream infstream;
|
||||
inflate_state pStream;
|
||||
infstream.zalloc = Z_NULL;
|
||||
infstream.zfree = Z_NULL;
|
||||
infstream.opaque = Z_NULL;
|
||||
infstream.avail_in = esalt_bufs[digests_offset].hash.data_length - 12; // size of input
|
||||
infstream.next_in = (Bytef *)compressed; // input char array
|
||||
infstream.avail_out = 2048; // size of output
|
||||
infstream.next_out = (Bytef *)inflated; // output char array
|
||||
|
||||
// inflateinit2 is needed because otherwise it checks for headers by default
|
||||
mz_inflateInit2(&infstream, -MAX_WBITS, &pStream);
|
||||
int ret = mz_inflate(&infstream, Z_NO_FLUSH);
|
||||
if (ret < 0)
|
||||
{
|
||||
continue; // failed to inflate
|
||||
}
|
||||
|
||||
// check CRC
|
||||
u32x crc = 0xffffffff;
|
||||
for (unsigned int k = 0; k < infstream.total_out; ++k)
|
||||
{
|
||||
crc = CRC32(crc, inflated[k]);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17200_mxx (KERN_ATTR_VECTOR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
const u32 pw_len = pws[gid].pw_len;
|
||||
|
||||
u32x w[64] = { 0 };
|
||||
|
||||
for (int i = 0, idx = 0; i < pw_len; i += 4, idx += 1)
|
||||
{
|
||||
w[idx] = pws[gid].i[idx];
|
||||
}
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32 w0l = w[0];
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos += VECT_SIZE)
|
||||
{
|
||||
const u32x w0r = words_buf_r[il_pos / VECT_SIZE];
|
||||
const u32x w0 = w0l | w0r;
|
||||
w[0] = w0;
|
||||
|
||||
key0 = 0x12345678;
|
||||
key1 = 0x23456789;
|
||||
key2 = 0x34567890;
|
||||
|
||||
for(u8 i = 0; i < pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (w[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 compressed[MAX_COMPRESSED_LENGTH];
|
||||
u8 abort = 0;
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
compressed[0] = plain;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
for (unsigned int i = 13; i < 36; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
compressed[i-12] = plain;
|
||||
}
|
||||
|
||||
if (((compressed[0]) & 6) == 2 && !check_inflate_code1 (compressed, 36))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
if (((compressed[0]) & 6) == 4 && !check_inflate_code2 (compressed))
|
||||
{
|
||||
abort=1;
|
||||
}
|
||||
|
||||
if (abort)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
for (unsigned int i = 36; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
compressed[i - 12] = plain;
|
||||
}
|
||||
|
||||
unsigned char inflated[MAX_UNCOMPRESSED_LENGTH];
|
||||
mz_stream infstream;
|
||||
inflate_state pStream;
|
||||
infstream.zalloc = Z_NULL;
|
||||
infstream.zfree = Z_NULL;
|
||||
infstream.opaque = Z_NULL;
|
||||
infstream.avail_in = esalt_bufs[digests_offset].hash.data_length - 12; // size of input
|
||||
infstream.next_in = (Bytef *)compressed; // input char array
|
||||
infstream.avail_out = 2048; // size of output
|
||||
infstream.next_out = (Bytef *)inflated; // output char array
|
||||
|
||||
// inflateinit2 is needed because otherwise it checks for headers by default
|
||||
mz_inflateInit2(&infstream, -MAX_WBITS, &pStream);
|
||||
int ret = mz_inflate(&infstream, Z_NO_FLUSH);
|
||||
if (ret < 0)
|
||||
{
|
||||
continue; // failed to inflate
|
||||
}
|
||||
|
||||
// check CRC
|
||||
u32x crc = 0xffffffff;
|
||||
for (unsigned int k = 0; k < infstream.total_out; ++k)
|
||||
{
|
||||
crc = CRC32(crc, inflated[k]);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,551 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_vendor.cl"
|
||||
#include "inc_hash_constants.h"
|
||||
#include "inc_hash_functions.cl"
|
||||
#include "inc_types.cl"
|
||||
#include "inc_common.cl"
|
||||
#include "inc_simd.cl"
|
||||
#include "inc_rp.h"
|
||||
#include "inc_rp.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_UNCOMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hash;
|
||||
} pkzip_t;
|
||||
|
||||
__kernel void m17210_sxx (KERN_ATTR_RULES_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
COPY_PW (pws[gid]);
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
pw_t tmp = PASTE_PW;
|
||||
|
||||
tmp.pw_len = apply_rules (rules_buf[il_pos].cmds, tmp.i, tmp.pw_len);
|
||||
|
||||
key0 = 0x12345678;
|
||||
key1 = 0x23456789;
|
||||
key2 = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < tmp.pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (tmp.i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp^1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
u32x crc = 0xffffffff;
|
||||
crc = CRC32(crc, plain);
|
||||
|
||||
for (unsigned int i = 13; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
crc = CRC32(crc, plain);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17210_mxx (KERN_ATTR_RULES_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
COPY_PW (pws[gid]);
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
pw_t tmp = PASTE_PW;
|
||||
|
||||
tmp.pw_len = apply_rules (rules_buf[il_pos].cmds, tmp.i, tmp.pw_len);
|
||||
|
||||
key0 = 0x12345678;
|
||||
key1 = 0x23456789;
|
||||
key2 = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < tmp.pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (tmp.i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp^1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
u32x crc = 0xffffffff;
|
||||
crc = CRC32(crc, plain);
|
||||
|
||||
for (unsigned int i = 13; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
crc = CRC32(crc, plain);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,553 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_vendor.cl"
|
||||
#include "inc_hash_constants.h"
|
||||
#include "inc_hash_functions.cl"
|
||||
#include "inc_types.cl"
|
||||
#include "inc_common.cl"
|
||||
#include "inc_simd.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_UNCOMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hash;
|
||||
} pkzip_t;
|
||||
|
||||
__kernel void m17210_sxx (KERN_ATTR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pws[gid].pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (pws[gid].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
key0 = key0init;
|
||||
key1 = key1init;
|
||||
key2 = key2init;
|
||||
|
||||
for (u8 i = 0; i < combs_buf[il_pos].pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (combs_buf[il_pos].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp^1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
u32x crc = 0xffffffff;
|
||||
crc = CRC32(crc, plain);
|
||||
|
||||
for (unsigned int i = 13; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
crc = CRC32(crc, plain);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17210_mxx (KERN_ATTR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pws[gid].pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (pws[gid].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
key0 = key0init;
|
||||
key1 = key1init;
|
||||
key2 = key2init;
|
||||
|
||||
for (u8 i = 0; i < combs_buf[il_pos].pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (combs_buf[il_pos].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp^1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
u32x crc = 0xffffffff;
|
||||
crc = CRC32(crc, plain);
|
||||
|
||||
for (unsigned int i = 13; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
crc = CRC32(crc, plain);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,565 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_vendor.cl"
|
||||
#include "inc_hash_constants.h"
|
||||
#include "inc_hash_functions.cl"
|
||||
#include "inc_types.cl"
|
||||
#include "inc_common.cl"
|
||||
#include "inc_simd.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_UNCOMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hash;
|
||||
} pkzip_t;
|
||||
|
||||
__kernel void m17210_sxx (KERN_ATTR_VECTOR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
const u32 pw_len = pws[gid].pw_len;
|
||||
|
||||
u32x w[64] = { 0 };
|
||||
|
||||
for (int i = 0, idx = 0; i < pw_len; i += 4, idx += 1)
|
||||
{
|
||||
w[idx] = pws[gid].i[idx];
|
||||
}
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32 w0l = w[0];
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos += VECT_SIZE)
|
||||
{
|
||||
const u32x w0r = words_buf_r[il_pos / VECT_SIZE];
|
||||
const u32x w0 = w0l | w0r;
|
||||
w[0] = w0;
|
||||
|
||||
key0 = 0x12345678;
|
||||
key1 = 0x23456789;
|
||||
key2 = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (w[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp^1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
u32x crc = 0xffffffff;
|
||||
crc = CRC32(crc, plain);
|
||||
|
||||
for (unsigned int i = 13; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
crc = CRC32(crc, plain);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17210_mxx (KERN_ATTR_VECTOR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
const u32 pw_len = pws[gid].pw_len;
|
||||
|
||||
u32x w[64] = { 0 };
|
||||
|
||||
for (int i = 0, idx = 0; i < pw_len; i += 4, idx += 1)
|
||||
{
|
||||
w[idx] = pws[gid].i[idx];
|
||||
}
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32 w0l = w[0];
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos += VECT_SIZE)
|
||||
{
|
||||
const u32x w0r = words_buf_r[il_pos / VECT_SIZE];
|
||||
const u32x w0 = w0l | w0r;
|
||||
w[0] = w0;
|
||||
|
||||
key0 = 0x12345678;
|
||||
key1 = 0x23456789;
|
||||
key2 = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pw_len; i++)
|
||||
{
|
||||
key0 = CRC32( key0, (w[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hash.checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp & 0xff))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp^1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hash.checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hash.checksum_from_timestamp >> 8))
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[12] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
u32x crc = 0xffffffff;
|
||||
crc = CRC32(crc, plain);
|
||||
|
||||
for (unsigned int i = 13; i < esalt_bufs[digests_offset].hash.data_length; i++)
|
||||
{
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hash.data[i] ^ key3;
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
crc = CRC32(crc, plain);
|
||||
}
|
||||
crc = ~crc;
|
||||
|
||||
if (crc == esalt_bufs[digests_offset].hash.crc32)
|
||||
{
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,539 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_vendor.cl"
|
||||
#include "inc_hash_constants.h"
|
||||
#include "inc_hash_functions.cl"
|
||||
#include "inc_types.cl"
|
||||
#include "inc_common.cl"
|
||||
#include "inc_simd.cl"
|
||||
#include "inc_rp.h"
|
||||
#include "inc_rp.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hashes[8];
|
||||
} pkzip_t;
|
||||
|
||||
__kernel void m17230_sxx (KERN_ATTR_RULES_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
COPY_PW (pws[gid]);
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
pw_t tmp = PASTE_PW;
|
||||
|
||||
tmp.pw_len = apply_rules (rules_buf[il_pos].cmds, tmp.i, tmp.pw_len);
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < tmp.pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (tmp.i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
for (u8 idx = 0; idx < esalt_bufs[digests_offset].hash_count; idx++)
|
||||
{
|
||||
key0 = key0init;
|
||||
key1 = key1init;
|
||||
key2 = key2init;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp & 0xff))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp >> 8))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (idx + 1 == esalt_bufs[digests_offset].hash_count){ \
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17230_mxx (KERN_ATTR_RULES_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
COPY_PW (pws[gid]);
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
pw_t tmp = PASTE_PW;
|
||||
|
||||
tmp.pw_len = apply_rules (rules_buf[il_pos].cmds, tmp.i, tmp.pw_len);
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < tmp.pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (tmp.i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
for (u8 idx = 0; idx < esalt_bufs[digests_offset].hash_count; idx++)
|
||||
{
|
||||
key0 = key0init;
|
||||
key1 = key1init;
|
||||
key2 = key2init;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp & 0xff))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp >> 8))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (idx + 1 == esalt_bufs[digests_offset].hash_count){ \
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,544 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_zip_inflate.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
|
||||
typedef struct {
|
||||
u8 op; /* operation, extra bits, table bits */
|
||||
u8 bits; /* bits in this part of the code */
|
||||
u16 val; /* offset in table or code value */
|
||||
} code;
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hashes[8];
|
||||
} pkzip_t;
|
||||
|
||||
__kernel void m17230_sxx (KERN_ATTR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
u32x key0init2, key1init2, key2init2;
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pws[gid].pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (pws[gid].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
key0init2 = key0init;
|
||||
key1init2 = key1init;
|
||||
key2init2 = key2init;
|
||||
|
||||
for (u8 i = 0; i < combs_buf[il_pos].pw_len; i++)
|
||||
{
|
||||
key0init2 = CRC32( key0init2, (combs_buf[il_pos].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init2 = (key1init2 + (key0init2 & 0xff)) * CONST + 1;
|
||||
key2init2 = CRC32( key2init2, MSB(key1init2) );
|
||||
}
|
||||
|
||||
u8 abort = 0;
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
for (u8 idx = 0; idx < esalt_bufs[digests_offset].hash_count; idx++)
|
||||
{
|
||||
key0 = key0init2;
|
||||
key1 = key1init2;
|
||||
key2 = key2init2;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp & 0xff))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp >> 8))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (idx + 1 == esalt_bufs[digests_offset].hash_count){ \
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17230_mxx (KERN_ATTR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
u32x key0init2, key1init2, key2init2;
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pws[gid].pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (pws[gid].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
||||
{
|
||||
key0init2 = key0init;
|
||||
key1init2 = key1init;
|
||||
key2init2 = key2init;
|
||||
|
||||
for (u8 i = 0; i < combs_buf[il_pos].pw_len; i++)
|
||||
{
|
||||
key0init2 = CRC32( key0init2, (combs_buf[il_pos].i[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init2 = (key1init2 + (key0init2 & 0xff)) * CONST + 1;
|
||||
key2init2 = CRC32( key2init2, MSB(key1init2) );
|
||||
}
|
||||
|
||||
u8 abort = 0;
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
for (u8 idx = 0; idx < esalt_bufs[digests_offset].hash_count; idx++)
|
||||
{
|
||||
key0 = key0init2;
|
||||
key1 = key1init2;
|
||||
key2 = key2init2;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp & 0xff))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp >> 8))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (idx + 1 == esalt_bufs[digests_offset].hash_count){ \
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,555 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "inc_vendor.cl"
|
||||
#include "inc_hash_constants.h"
|
||||
#include "inc_hash_functions.cl"
|
||||
#include "inc_types.cl"
|
||||
#include "inc_common.cl"
|
||||
#include "inc_simd.cl"
|
||||
#include "inc_rp.h"
|
||||
#include "inc_rp.cl"
|
||||
|
||||
#define CRC32(x,c) (((x)>>8)^l_crc32tab[((x)^(c))&0xff])
|
||||
#define MSB(x) ((x)>>24)
|
||||
#define CONST 0x08088405
|
||||
#define POLYNOMIAL 0xEDB88320
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hashes[8];
|
||||
} pkzip_t;
|
||||
|
||||
__kernel void m17230_sxx (KERN_ATTR_VECTOR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
const u32 pw_len = pws[gid].pw_len;
|
||||
|
||||
u32x w[64] = { 0 };
|
||||
|
||||
for (int i = 0, idx = 0; i < pw_len; i += 4, idx += 1)
|
||||
{
|
||||
w[idx] = pws[gid].i[idx];
|
||||
}
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
u32 w0l = w[0];
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos += VECT_SIZE)
|
||||
{
|
||||
const u32x w0r = words_buf_r[il_pos / VECT_SIZE];
|
||||
const u32x w0 = w0l | w0r;
|
||||
w[0] = w0;
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (w[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
for (u8 idx = 0; idx < esalt_bufs[digests_offset].hash_count; idx++)
|
||||
{
|
||||
key0 = key0init;
|
||||
key1 = key1init;
|
||||
key2 = key2init;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp & 0xff))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp >> 8))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (idx + 1 == esalt_bufs[digests_offset].hash_count){ \
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
__kernel void m17230_mxx (KERN_ATTR_VECTOR_ESALT (pkzip_t))
|
||||
{
|
||||
/**
|
||||
* modifier
|
||||
*/
|
||||
|
||||
const u64 lid = get_local_id (0);
|
||||
const u64 gid = get_global_id (0);
|
||||
|
||||
__local u32 l_crc32tab[0x100];
|
||||
|
||||
u32 remainder;
|
||||
u32 b = 0;
|
||||
u8 set = 0;
|
||||
for (u32 b = 0; b < 256; b++)
|
||||
{
|
||||
remainder = b;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
if (remainder & 1) remainder = (remainder >> 1) ^ POLYNOMIAL;
|
||||
else remainder >>= 1;
|
||||
|
||||
l_crc32tab[b] = remainder;
|
||||
}
|
||||
|
||||
barrier (CLK_LOCAL_MEM_FENCE);
|
||||
|
||||
if (gid >= gid_max) return;
|
||||
|
||||
/**
|
||||
* base
|
||||
*/
|
||||
|
||||
const u32 pw_len = pws[gid].pw_len;
|
||||
|
||||
u32x w[64] = { 0 };
|
||||
|
||||
for (int i = 0, idx = 0; i < pw_len; i += 4, idx += 1)
|
||||
{
|
||||
w[idx] = pws[gid].i[idx];
|
||||
}
|
||||
|
||||
/**
|
||||
* loop
|
||||
*/
|
||||
|
||||
u32x key0, key1, key2;
|
||||
u32x key0init, key1init, key2init;
|
||||
u32 w0l = w[0];
|
||||
|
||||
for (u32 il_pos = 0; il_pos < il_cnt; il_pos += VECT_SIZE)
|
||||
{
|
||||
const u32x w0r = words_buf_r[il_pos / VECT_SIZE];
|
||||
const u32x w0 = w0l | w0r;
|
||||
w[0] = w0;
|
||||
|
||||
key0init = 0x12345678;
|
||||
key1init = 0x23456789;
|
||||
key2init = 0x34567890;
|
||||
|
||||
for (u8 i = 0; i < pw_len; i++)
|
||||
{
|
||||
key0init = CRC32( key0init, (w[i >> 2] >> ((i & 3) << 3)) & 0xff );
|
||||
key1init = (key1init + (key0init & 0xff)) * CONST + 1;
|
||||
key2init = CRC32( key2init, MSB(key1init) );
|
||||
}
|
||||
|
||||
u8 plain;
|
||||
u8 key3;
|
||||
u16 temp;
|
||||
|
||||
for (u8 idx = 0; idx < esalt_bufs[digests_offset].hash_count; idx++)
|
||||
{
|
||||
key0 = key0init;
|
||||
key1 = key1init;
|
||||
key2 = key2init;
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[0] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[1] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[2] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[3] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[4] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[5] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[6] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[7] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[8] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[9] ^ key3;
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[10] ^ key3;
|
||||
|
||||
if (esalt_bufs[digests_offset].checksum_size == 2 && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc & 0xff) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp & 0xff))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[11] ^ key3;
|
||||
|
||||
if (plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_crc >> 8) && plain != (esalt_bufs[digests_offset].hashes[idx].checksum_from_timestamp >> 8))
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
key0 = CRC32( key0, plain );
|
||||
key1 = (key1 + (key0 & 0xff)) * CONST + 1;
|
||||
key2 = CRC32( key2, MSB(key1) );
|
||||
|
||||
temp = (key2 & 0xffff) | 3;
|
||||
key3 = ((temp * (temp ^ 1)) >> 8) & 0xff;
|
||||
plain = esalt_bufs[digests_offset].hashes[idx].data[12] ^ key3;
|
||||
|
||||
if ((plain & 6) == 0 || (plain & 6) == 6)
|
||||
{
|
||||
idx = 0xfe;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (idx + 1 == esalt_bufs[digests_offset].hash_count){ \
|
||||
if (atomic_inc (&hashes_shown[digests_offset]) == 0)
|
||||
{
|
||||
mark_hash (plains_buf, d_return_buf, salt_pos, digests_cnt, 0, digests_offset + 0, gid, il_pos, 0, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -24,6 +24,7 @@
|
|||
- Added hash-mode: sha1(md5(md5($pass)))
|
||||
- Added hash-mode: sha1($salt1.$pass.$salt2)
|
||||
- Added hash-mode: Ruby on Rails Restful-Authentication
|
||||
- Added hash-mode: PKZIP archive encryption
|
||||
|
||||
##
|
||||
## Bugs
|
||||
|
|
|
|||
|
|
@ -0,0 +1,398 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "common.h"
|
||||
#include "types.h"
|
||||
#include "modules.h"
|
||||
#include "bitops.h"
|
||||
#include "convert.h"
|
||||
#include "shared.h"
|
||||
#include "inc_hash_constants.h"
|
||||
|
||||
static const u32 ATTACK_EXEC = ATTACK_EXEC_INSIDE_KERNEL;
|
||||
static const u32 DGST_POS0 = 1;
|
||||
static const u32 DGST_POS1 = 2;
|
||||
static const u32 DGST_POS2 = 3;
|
||||
static const u32 DGST_POS3 = 4;
|
||||
static const u32 DGST_SIZE = DGST_SIZE_4_4;
|
||||
static const u32 HASH_CATEGORY = HASH_CATEGORY_ARCHIVE;
|
||||
static const char *HASH_NAME = "PKZIP (Compressed)";
|
||||
static const u64 KERN_TYPE = 17200;
|
||||
static const u32 OPTI_TYPE = 0;
|
||||
static const u64 OPTS_TYPE = 0;
|
||||
static const u32 SALT_TYPE = SALT_TYPE_EMBEDDED;
|
||||
static const char *ST_PASS = "hashcat";
|
||||
static const char *ST_HASH = "$pkzip2$1*1*2*0*e3*1c5*eda7a8de*0*28*8*e3*eda7*5096*a9fc1f4e951c8fb3031a6f903e5f4e3211c8fdc4671547bf77f6f682afbfcc7475d83898985621a7af9bccd1349d1976500a68c48f630b7f22d7a0955524d768e34868880461335417ddd149c65a917c0eb0a4bf7224e24a1e04cf4ace5eef52205f4452e66ded937db9545f843a68b1e84a2e933cc05fb36d3db90e6c5faf1bee2249fdd06a7307849902a8bb24ec7e8a0886a4544ca47979a9dfeefe034bdfc5bd593904cfe9a5309dd199d337d3183f307c2cb39622549a5b9b8b485b7949a4803f63f67ca427a0640ad3793a519b2476c52198488e3e2e04cac202d624fb7d13c2*$/pkzip2$";
|
||||
|
||||
static const char *SIGNATURE_PKZIP_V1 = "$pkzip$";
|
||||
static const char *SIGNATURE_PKZIP_V2 = "$pkzip2$";
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
u32 module_attack_exec (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ATTACK_EXEC; }
|
||||
u32 module_dgst_pos0 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS0; }
|
||||
u32 module_dgst_pos1 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS1; }
|
||||
u32 module_dgst_pos2 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS2; }
|
||||
u32 module_dgst_pos3 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS3; }
|
||||
u32 module_dgst_size (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_SIZE; }
|
||||
u32 module_hash_category (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return HASH_CATEGORY; }
|
||||
const char *module_hash_name (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return HASH_NAME; }
|
||||
u64 module_kern_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return KERN_TYPE; }
|
||||
u32 module_opti_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return OPTI_TYPE; }
|
||||
u64 module_opts_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return OPTS_TYPE; }
|
||||
u32 module_salt_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return SALT_TYPE; }
|
||||
const char *module_st_hash (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ST_HASH; }
|
||||
const char *module_st_pass (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ST_PASS; }
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hash;
|
||||
} pkzip_t;
|
||||
|
||||
u64 module_esalt_size (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra)
|
||||
{
|
||||
const u64 esalt_size = (const u64) sizeof (pkzip_t);
|
||||
|
||||
return esalt_size;
|
||||
}
|
||||
|
||||
void hex_to_binary (const char *source, int len, char* out)
|
||||
{
|
||||
const char *pos = source;
|
||||
for (size_t count = 0; count < (size_t) len/2; count++) {
|
||||
sscanf(pos, "%2hhx", &out[count]);
|
||||
pos += 2;
|
||||
}
|
||||
}
|
||||
|
||||
int module_hash_decode (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED void *digest_buf, MAYBE_UNUSED salt_t *salt, MAYBE_UNUSED void *esalt_buf, MAYBE_UNUSED void *hook_salt_buf, MAYBE_UNUSED hashinfo_t *hash_info, const char *line_buf, MAYBE_UNUSED const int line_len)
|
||||
{
|
||||
pkzip_t *pkzip = (pkzip_t *) esalt_buf;
|
||||
|
||||
u32 *digest = (u32 *) digest_buf;
|
||||
|
||||
char input[line_len + 1];
|
||||
input[line_len] = '\0';
|
||||
memcpy(&input, line_buf, line_len);
|
||||
|
||||
char *p = strtok(input, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
if (strncmp(p, SIGNATURE_PKZIP_V1, 7) != 0 && strncmp(p, SIGNATURE_PKZIP_V2, 8) != 0) return PARSER_HASH_LENGTH;
|
||||
|
||||
pkzip->version = 1;
|
||||
if(strlen(p) == 9) pkzip->version = 2;
|
||||
|
||||
char sub[2];
|
||||
sub[0] = p[strlen(p) - 1];
|
||||
sub[1] = '\0';
|
||||
pkzip->hash_count = atoi(sub);
|
||||
|
||||
// check here that the hash_count is valid for the attack type
|
||||
if(pkzip->hash_count != 1) return PARSER_HASH_VALUE;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->checksum_size = atoi(p);
|
||||
if (pkzip->checksum_size != 1 && pkzip->checksum_size != 2) return PARSER_HASH_LENGTH;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.data_type_enum = atoi(p);
|
||||
if (pkzip->hash.data_type_enum > 3) return PARSER_HASH_LENGTH;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.magic_type_enum = atoi(p);
|
||||
|
||||
if(pkzip->hash.data_type_enum > 1)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.compressed_length = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.uncompressed_length = strtoul(p, NULL, 16);
|
||||
if (pkzip->hash.compressed_length > MAX_COMPRESSED_LENGTH || pkzip->hash.uncompressed_length > MAX_UNCOMPRESSED_LENGTH)
|
||||
{
|
||||
return PARSER_TOKEN_LENGTH;
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%x", &(pkzip->hash.crc32));
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.offset = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.additional_offset = strtoul(p, NULL, 16);
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.compression_type = atoi(p);
|
||||
if (pkzip->hash.compression_type != 8) return PARSER_HASH_VALUE;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.data_length = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%hx", &(pkzip->hash.checksum_from_crc));
|
||||
if(pkzip->version == 2)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%hx", &(pkzip->hash.checksum_from_timestamp));
|
||||
}
|
||||
else
|
||||
{
|
||||
pkzip->hash.checksum_from_timestamp = pkzip->hash.checksum_from_crc;
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
|
||||
hex_to_binary(p, strlen(p) * 2, (char *) &(pkzip->hash.data));
|
||||
|
||||
// fake salt
|
||||
salt->salt_buf[0] = pkzip->hash.data[ 3] << 24 | pkzip->hash.data[ 2] << 16 | pkzip->hash.data[ 1] << 8 | pkzip->hash.data[ 0];
|
||||
salt->salt_buf[1] = pkzip->hash.data[ 7] << 24 | pkzip->hash.data[ 6] << 16 | pkzip->hash.data[ 5] << 8 | pkzip->hash.data[ 4];
|
||||
salt->salt_buf[2] = pkzip->hash.data[11] << 24 | pkzip->hash.data[10] << 16 | pkzip->hash.data[ 9] << 8 | pkzip->hash.data[ 8];
|
||||
salt->salt_buf[3] = pkzip->hash.data[15] << 24 | pkzip->hash.data[14] << 16 | pkzip->hash.data[13] << 8 | pkzip->hash.data[ 12];
|
||||
|
||||
salt->salt_len = 16;
|
||||
|
||||
// fake hash
|
||||
digest[0] = pkzip->hash.data[ 0] << 24 | pkzip->hash.data[ 1] << 16 | pkzip->hash.data[ 2] << 8 | pkzip->hash.data[ 3];
|
||||
digest[1] = pkzip->hash.data[ 4] << 24 | pkzip->hash.data[ 5] << 16 | pkzip->hash.data[ 6] << 8 | pkzip->hash.data[ 7];
|
||||
digest[2] = pkzip->hash.data[ 8] << 24 | pkzip->hash.data[ 9] << 16 | pkzip->hash.data[10] << 8 | pkzip->hash.data[11];
|
||||
digest[3] = pkzip->hash.data[12] << 24 | pkzip->hash.data[13] << 16 | pkzip->hash.data[14] << 8 | pkzip->hash.data[15];
|
||||
|
||||
return (PARSER_OK);
|
||||
}
|
||||
|
||||
int module_hash_encode (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const void *digest_buf, MAYBE_UNUSED const salt_t *salt, MAYBE_UNUSED const void *esalt_buf, MAYBE_UNUSED const void *hook_salt_buf, MAYBE_UNUSED const hashinfo_t *hash_info, char *line_buf, MAYBE_UNUSED const int line_size)
|
||||
{
|
||||
const u32 *digest = (const u32 *) digest_buf;
|
||||
|
||||
const pkzip_t *pkzip = (const pkzip_t *) esalt_buf;
|
||||
|
||||
int out_len = 0;
|
||||
|
||||
if (pkzip->version == 1)
|
||||
{
|
||||
sprintf (line_buf, "%s", SIGNATURE_PKZIP_V1);
|
||||
out_len += 7;
|
||||
}
|
||||
else
|
||||
{
|
||||
sprintf (line_buf, "%s", SIGNATURE_PKZIP_V2);
|
||||
out_len += 8;
|
||||
}
|
||||
out_len += sprintf (line_buf + out_len, "%i*%i*", pkzip->hash_count, pkzip->checksum_size);
|
||||
|
||||
out_len += sprintf (line_buf + out_len, "%i*%i*", pkzip->hash.data_type_enum, pkzip->hash.magic_type_enum);
|
||||
if (pkzip->hash.data_type_enum > 1)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%x*%x*%x*%x*%x*", pkzip->hash.compressed_length, pkzip->hash.uncompressed_length, pkzip->hash.crc32, pkzip->hash.offset, pkzip->hash.additional_offset);
|
||||
}
|
||||
|
||||
out_len += sprintf (line_buf + out_len, "%i*%x*%x*", pkzip->hash.compression_type, pkzip->hash.data_length, pkzip->hash.checksum_from_crc);
|
||||
if (pkzip->version == 2)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%x*", pkzip->hash.checksum_from_timestamp);
|
||||
}
|
||||
|
||||
for (u32 i = 0; i < pkzip->hash.data_length; i++)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%02x", pkzip->hash.data[i]);
|
||||
}
|
||||
|
||||
if (pkzip->version == 1)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "*$/pkzip$");
|
||||
}
|
||||
else
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "*$/pkzip2$");
|
||||
}
|
||||
|
||||
return out_len;
|
||||
}
|
||||
|
||||
void module_init (module_ctx_t *module_ctx)
|
||||
{
|
||||
module_ctx->module_context_size = MODULE_CONTEXT_SIZE_CURRENT;
|
||||
module_ctx->module_interface_version = MODULE_INTERFACE_VERSION_CURRENT;
|
||||
|
||||
module_ctx->module_attack_exec = module_attack_exec;
|
||||
module_ctx->module_benchmark_esalt = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_hook_salt = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_mask = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_salt = MODULE_DEFAULT;
|
||||
module_ctx->module_build_plain_postprocess = MODULE_DEFAULT;
|
||||
module_ctx->module_deep_comp_kernel = MODULE_DEFAULT;
|
||||
module_ctx->module_dgst_pos0 = module_dgst_pos0;
|
||||
module_ctx->module_dgst_pos1 = module_dgst_pos1;
|
||||
module_ctx->module_dgst_pos2 = module_dgst_pos2;
|
||||
module_ctx->module_dgst_pos3 = module_dgst_pos3;
|
||||
module_ctx->module_dgst_size = module_dgst_size;
|
||||
module_ctx->module_dictstat_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_esalt_size = module_esalt_size;
|
||||
module_ctx->module_extra_buffer_size = MODULE_DEFAULT;
|
||||
module_ctx->module_extra_tmp_size = MODULE_DEFAULT;
|
||||
module_ctx->module_forced_outfile_format = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_count = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_parse = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_save = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode_outfile = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode_zero_hash = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode = module_hash_decode;
|
||||
module_ctx->module_hash_encode_status = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_encode = module_hash_encode;
|
||||
module_ctx->module_hash_init_selftest = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_mode = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_category = module_hash_category;
|
||||
module_ctx->module_hash_name = module_hash_name;
|
||||
module_ctx->module_hlfmt_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_hook12 = MODULE_DEFAULT;
|
||||
module_ctx->module_hook23 = MODULE_DEFAULT;
|
||||
module_ctx->module_hook_salt_size = MODULE_DEFAULT;
|
||||
module_ctx->module_hook_size = MODULE_DEFAULT;
|
||||
module_ctx->module_jit_build_options = MODULE_DEFAULT;
|
||||
module_ctx->module_jit_cache_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_accel_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_accel_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_loops_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_loops_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_threads_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_threads_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kern_type = module_kern_type;
|
||||
module_ctx->module_kern_type_dynamic = MODULE_DEFAULT;
|
||||
module_ctx->module_opti_type = module_opti_type;
|
||||
module_ctx->module_opts_type = module_opts_type;
|
||||
module_ctx->module_outfile_check_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_outfile_check_nocomp = MODULE_DEFAULT;
|
||||
module_ctx->module_potfile_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_potfile_keep_all_hashes = MODULE_DEFAULT;
|
||||
module_ctx->module_pwdump_column = MODULE_DEFAULT;
|
||||
module_ctx->module_pw_max = MODULE_DEFAULT;
|
||||
module_ctx->module_pw_min = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_max = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_min = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_type = module_salt_type;
|
||||
module_ctx->module_separator = MODULE_DEFAULT;
|
||||
module_ctx->module_st_hash = module_st_hash;
|
||||
module_ctx->module_st_pass = module_st_pass;
|
||||
module_ctx->module_tmp_size = MODULE_DEFAULT;
|
||||
module_ctx->module_unstable_warning = MODULE_DEFAULT;
|
||||
module_ctx->module_warmup_disable = MODULE_DEFAULT;
|
||||
}
|
||||
|
|
@ -0,0 +1,400 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "common.h"
|
||||
#include "types.h"
|
||||
#include "modules.h"
|
||||
#include "bitops.h"
|
||||
#include "convert.h"
|
||||
#include "shared.h"
|
||||
#include "inc_hash_constants.h"
|
||||
|
||||
static const u32 ATTACK_EXEC = ATTACK_EXEC_INSIDE_KERNEL;
|
||||
static const u32 DGST_POS0 = 1;
|
||||
static const u32 DGST_POS1 = 2;
|
||||
static const u32 DGST_POS2 = 3;
|
||||
static const u32 DGST_POS3 = 4;
|
||||
static const u32 DGST_SIZE = DGST_SIZE_4_4;
|
||||
static const u32 HASH_CATEGORY = HASH_CATEGORY_ARCHIVE;
|
||||
static const char *HASH_NAME = "PKZIP (Uncompressed)";
|
||||
static const u64 KERN_TYPE = 17210;
|
||||
static const u32 OPTI_TYPE = 0;
|
||||
static const u64 OPTS_TYPE = OPTS_TYPE_PT_NEVERCRACK;
|
||||
static const u32 SALT_TYPE = SALT_TYPE_EMBEDDED;
|
||||
static const char *ST_PASS = "hashcat";
|
||||
static const char *ST_HASH = "$pkzip2$1*1*2*0*1d1*1c5*eda7a8de*0*28*0*1d1*eda7*5096*1dea673da43d9fc7e2be1a1f4f664269fceb6cb88723a97408ae1fe07f774d31d1442ea8485081e63f919851ca0b7588d5e3442317fff19fe547a4ef97492ed75417c427eea3c4e146e16c100a2f8b6abd7e5988dc967e5a0e51f641401605d673630ea52ebb04da4b388489901656532c9aa474ca090dbac7cf8a21428d57b42a71da5f3d83fed927361e5d385ca8e480a6d42dea5b4bf497d3a24e79fc7be37c8d1721238cbe9e1ea3ae1eb91fc02aabdf33070d718d5105b70b3d7f3d2c28b3edd822e89a5abc0c8fee117c7fbfbfd4b4c8e130977b75cb0b1da080bfe1c0859e6483c42f459c8069d45a76220e046e6c2a2417392fd87e4aa4a2559eaab3baf78a77a1b94d8c8af16a977b4bb45e3da211838ad044f209428dba82666bf3d54d4eed82c64a9b3444a44746b9e398d0516a2596d84243b4a1d7e87d9843f38e45b6be67fd980107f3ad7b8453d87300e6c51ac9f5e3f6c3b702654440c543b1d808b62f7a313a83b31a6faaeedc2620de7057cd0df80f70346fe2d4dccc318f0b5ed128bcf0643e63d754bb05f53afb2b0fa90b34b538b2ad3648209dff587df4fa18698e4fa6d858ad44aa55d2bba3b08dfdedd3e28b8b7caf394d5d9d95e452c2ab1c836b9d74538c2f0d24b9b577*$/pkzip2$";
|
||||
|
||||
static const char *SIGNATURE_PKZIP_V1 = "$pkzip$";
|
||||
static const char *SIGNATURE_PKZIP_V2 = "$pkzip2$";
|
||||
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
u32 module_attack_exec (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ATTACK_EXEC; }
|
||||
u32 module_dgst_pos0 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS0; }
|
||||
u32 module_dgst_pos1 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS1; }
|
||||
u32 module_dgst_pos2 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS2; }
|
||||
u32 module_dgst_pos3 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS3; }
|
||||
u32 module_dgst_size (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_SIZE; }
|
||||
u32 module_hash_category (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return HASH_CATEGORY; }
|
||||
const char *module_hash_name (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return HASH_NAME; }
|
||||
u64 module_kern_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return KERN_TYPE; }
|
||||
u32 module_opti_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return OPTI_TYPE; }
|
||||
u64 module_opts_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return OPTS_TYPE; }
|
||||
u32 module_salt_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return SALT_TYPE; }
|
||||
const char *module_st_hash (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ST_HASH; }
|
||||
const char *module_st_pass (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ST_PASS; }
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_UNCOMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hash;
|
||||
} pkzip_t;
|
||||
|
||||
u64 module_esalt_size (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra)
|
||||
{
|
||||
const u64 esalt_size = (const u64) sizeof (pkzip_t);
|
||||
|
||||
return esalt_size;
|
||||
}
|
||||
|
||||
void hex_to_binary (const char *source, int len, char* out)
|
||||
{
|
||||
const char *pos = source;
|
||||
for (size_t count = 0; count < (size_t) len/2; count++) {
|
||||
sscanf(pos, "%2hhx", &out[count]);
|
||||
pos += 2;
|
||||
}
|
||||
}
|
||||
|
||||
int module_hash_decode (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED void *digest_buf, MAYBE_UNUSED salt_t *salt, MAYBE_UNUSED void *esalt_buf, MAYBE_UNUSED void *hook_salt_buf, MAYBE_UNUSED hashinfo_t *hash_info, const char *line_buf, MAYBE_UNUSED const int line_len)
|
||||
{
|
||||
pkzip_t *pkzip = (pkzip_t *) esalt_buf;
|
||||
|
||||
u32 *digest = (u32 *) digest_buf;
|
||||
|
||||
char input[line_len + 1];
|
||||
input[line_len] = '\0';
|
||||
memcpy(&input, line_buf, line_len);
|
||||
|
||||
char *p = strtok(input, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
if (strncmp(p, SIGNATURE_PKZIP_V1, 7) != 0 && strncmp(p, SIGNATURE_PKZIP_V2, 8) != 0) return PARSER_HASH_LENGTH;
|
||||
|
||||
pkzip->version = 1;
|
||||
if(strlen(p) == 9) pkzip->version = 2;
|
||||
|
||||
char sub[2];
|
||||
sub[0] = p[strlen(p) - 1];
|
||||
sub[1] = '\0';
|
||||
pkzip->hash_count = atoi(sub);
|
||||
|
||||
// check here that the hash_count is valid for the attack type
|
||||
if(pkzip->hash_count != 1) return PARSER_HASH_VALUE;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->checksum_size = atoi(p);
|
||||
if (pkzip->checksum_size != 1 && pkzip->checksum_size != 2) return PARSER_HASH_LENGTH;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.data_type_enum = atoi(p);
|
||||
if (pkzip->hash.data_type_enum > 3) return PARSER_HASH_LENGTH;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.magic_type_enum = atoi(p);
|
||||
|
||||
if(pkzip->hash.data_type_enum > 1)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.compressed_length = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.uncompressed_length = strtoul(p, NULL, 16);
|
||||
if (pkzip->hash.uncompressed_length > MAX_UNCOMPRESSED_LENGTH)
|
||||
{
|
||||
return PARSER_TOKEN_LENGTH;
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%x", &(pkzip->hash.crc32));
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.offset = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.additional_offset = strtoul(p, NULL, 16);
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.compression_type = atoi(p);
|
||||
if (pkzip->hash.compression_type != 0) return PARSER_HASH_VALUE;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hash.data_length = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%hx", &(pkzip->hash.checksum_from_crc));
|
||||
if(pkzip->version == 2)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%hx", &(pkzip->hash.checksum_from_timestamp));
|
||||
}
|
||||
else
|
||||
{
|
||||
pkzip->hash.checksum_from_timestamp = pkzip->hash.checksum_from_crc;
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
|
||||
hex_to_binary(p, strlen(p) * 2, (char *) &(pkzip->hash.data));
|
||||
|
||||
// fake salt
|
||||
salt->salt_buf[0] = pkzip->hash.data[ 3] << 24 | pkzip->hash.data[ 2] << 16 | pkzip->hash.data[ 1] << 8 | pkzip->hash.data[ 0];
|
||||
salt->salt_buf[1] = pkzip->hash.data[ 7] << 24 | pkzip->hash.data[ 6] << 16 | pkzip->hash.data[ 5] << 8 | pkzip->hash.data[ 4];
|
||||
salt->salt_buf[2] = pkzip->hash.data[11] << 24 | pkzip->hash.data[10] << 16 | pkzip->hash.data[ 9] << 8 | pkzip->hash.data[ 8];
|
||||
salt->salt_buf[3] = pkzip->hash.data[15] << 24 | pkzip->hash.data[14] << 16 | pkzip->hash.data[13] << 8 | pkzip->hash.data[ 12];
|
||||
|
||||
salt->salt_len = 16;
|
||||
|
||||
// fake hash
|
||||
digest[0] = pkzip->hash.data[ 0] << 24 | pkzip->hash.data[ 1] << 16 | pkzip->hash.data[ 2] << 8 | pkzip->hash.data[ 3];
|
||||
digest[1] = pkzip->hash.data[ 4] << 24 | pkzip->hash.data[ 5] << 16 | pkzip->hash.data[ 6] << 8 | pkzip->hash.data[ 7];
|
||||
digest[2] = pkzip->hash.data[ 8] << 24 | pkzip->hash.data[ 9] << 16 | pkzip->hash.data[10] << 8 | pkzip->hash.data[11];
|
||||
digest[3] = pkzip->hash.data[12] << 24 | pkzip->hash.data[13] << 16 | pkzip->hash.data[14] << 8 | pkzip->hash.data[15];
|
||||
|
||||
return (PARSER_OK);
|
||||
}
|
||||
|
||||
int module_hash_encode (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const void *digest_buf, MAYBE_UNUSED const salt_t *salt, MAYBE_UNUSED const void *esalt_buf, MAYBE_UNUSED const void *hook_salt_buf, MAYBE_UNUSED const hashinfo_t *hash_info, char *line_buf, MAYBE_UNUSED const int line_size)
|
||||
{
|
||||
const u32 *digest = (const u32 *) digest_buf;
|
||||
|
||||
const pkzip_t *pkzip = (const pkzip_t *) esalt_buf;
|
||||
|
||||
int out_len = 0;
|
||||
|
||||
if (pkzip->version == 1)
|
||||
{
|
||||
sprintf (line_buf, "%s", SIGNATURE_PKZIP_V1);
|
||||
out_len += 7;
|
||||
}
|
||||
else
|
||||
{
|
||||
sprintf (line_buf, "%s", SIGNATURE_PKZIP_V2);
|
||||
out_len += 8;
|
||||
}
|
||||
out_len += sprintf (line_buf + out_len, "%i*%i*", pkzip->hash_count, pkzip->checksum_size);
|
||||
|
||||
for (int cnt = 0; cnt < pkzip->hash_count; cnt++)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%i*%i*", pkzip->hash.data_type_enum, pkzip->hash.magic_type_enum);
|
||||
if (pkzip->hash.data_type_enum > 1)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%x*%x*%x*%x*%x*", pkzip->hash.compressed_length, pkzip->hash.uncompressed_length, pkzip->hash.crc32, pkzip->hash.offset, pkzip->hash.additional_offset);
|
||||
}
|
||||
|
||||
out_len += sprintf (line_buf + out_len, "%i*%x*%x*", pkzip->hash.compression_type, pkzip->hash.data_length, pkzip->hash.checksum_from_crc);
|
||||
if (pkzip->version == 2)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%x*", pkzip->hash.checksum_from_timestamp);
|
||||
}
|
||||
|
||||
for (u32 i = 0; i < pkzip->hash.data_length; i++)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%02x", pkzip->hash.data[i]);
|
||||
}
|
||||
}
|
||||
|
||||
if (pkzip->version == 1)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "*$/pkzip$");
|
||||
}
|
||||
else
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "*$/pkzip2$");
|
||||
}
|
||||
|
||||
return out_len;
|
||||
}
|
||||
|
||||
void module_init (module_ctx_t *module_ctx)
|
||||
{
|
||||
module_ctx->module_context_size = MODULE_CONTEXT_SIZE_CURRENT;
|
||||
module_ctx->module_interface_version = MODULE_INTERFACE_VERSION_CURRENT;
|
||||
|
||||
module_ctx->module_attack_exec = module_attack_exec;
|
||||
module_ctx->module_benchmark_esalt = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_hook_salt = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_mask = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_salt = MODULE_DEFAULT;
|
||||
module_ctx->module_build_plain_postprocess = MODULE_DEFAULT;
|
||||
module_ctx->module_deep_comp_kernel = MODULE_DEFAULT;
|
||||
module_ctx->module_dgst_pos0 = module_dgst_pos0;
|
||||
module_ctx->module_dgst_pos1 = module_dgst_pos1;
|
||||
module_ctx->module_dgst_pos2 = module_dgst_pos2;
|
||||
module_ctx->module_dgst_pos3 = module_dgst_pos3;
|
||||
module_ctx->module_dgst_size = module_dgst_size;
|
||||
module_ctx->module_dictstat_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_esalt_size = module_esalt_size;
|
||||
module_ctx->module_extra_buffer_size = MODULE_DEFAULT;
|
||||
module_ctx->module_extra_tmp_size = MODULE_DEFAULT;
|
||||
module_ctx->module_forced_outfile_format = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_count = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_parse = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_save = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode_outfile = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode_zero_hash = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode = module_hash_decode;
|
||||
module_ctx->module_hash_encode_status = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_encode = module_hash_encode;
|
||||
module_ctx->module_hash_init_selftest = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_mode = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_category = module_hash_category;
|
||||
module_ctx->module_hash_name = module_hash_name;
|
||||
module_ctx->module_hlfmt_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_hook12 = MODULE_DEFAULT;
|
||||
module_ctx->module_hook23 = MODULE_DEFAULT;
|
||||
module_ctx->module_hook_salt_size = MODULE_DEFAULT;
|
||||
module_ctx->module_hook_size = MODULE_DEFAULT;
|
||||
module_ctx->module_jit_build_options = MODULE_DEFAULT;
|
||||
module_ctx->module_jit_cache_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_accel_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_accel_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_loops_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_loops_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_threads_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_threads_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kern_type = module_kern_type;
|
||||
module_ctx->module_kern_type_dynamic = MODULE_DEFAULT;
|
||||
module_ctx->module_opti_type = module_opti_type;
|
||||
module_ctx->module_opts_type = module_opts_type;
|
||||
module_ctx->module_outfile_check_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_outfile_check_nocomp = MODULE_DEFAULT;
|
||||
module_ctx->module_potfile_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_potfile_keep_all_hashes = MODULE_DEFAULT;
|
||||
module_ctx->module_pwdump_column = MODULE_DEFAULT;
|
||||
module_ctx->module_pw_max = MODULE_DEFAULT;
|
||||
module_ctx->module_pw_min = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_max = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_min = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_type = module_salt_type;
|
||||
module_ctx->module_separator = MODULE_DEFAULT;
|
||||
module_ctx->module_st_hash = module_st_hash;
|
||||
module_ctx->module_st_pass = module_st_pass;
|
||||
module_ctx->module_tmp_size = MODULE_DEFAULT;
|
||||
module_ctx->module_unstable_warning = MODULE_DEFAULT;
|
||||
module_ctx->module_warmup_disable = MODULE_DEFAULT;
|
||||
}
|
||||
|
|
@ -0,0 +1,404 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "common.h"
|
||||
#include "types.h"
|
||||
#include "modules.h"
|
||||
#include "bitops.h"
|
||||
#include "convert.h"
|
||||
#include "shared.h"
|
||||
#include "inc_hash_constants.h"
|
||||
|
||||
static const u32 ATTACK_EXEC = ATTACK_EXEC_INSIDE_KERNEL;
|
||||
static const u32 DGST_POS0 = 1;
|
||||
static const u32 DGST_POS1 = 2;
|
||||
static const u32 DGST_POS2 = 3;
|
||||
static const u32 DGST_POS3 = 4;
|
||||
static const u32 DGST_SIZE = DGST_SIZE_4_4;
|
||||
static const u32 HASH_CATEGORY = HASH_CATEGORY_ARCHIVE;
|
||||
static const char *HASH_NAME = "PKZIP (Compressed Multi-File)";
|
||||
static const u64 KERN_TYPE = 17220;
|
||||
static const u32 OPTI_TYPE = 0;
|
||||
static const u64 OPTS_TYPE = 0;
|
||||
static const u32 SALT_TYPE = SALT_TYPE_EMBEDDED;
|
||||
static const char *ST_PASS = "hashcat";
|
||||
static const char *ST_HASH = "$pkzip2$3*1*1*0*8*24*a425*8827*d1730095cd829e245df04ebba6c52c0573d49d3bbeab6cb385b7fa8a28dcccd3098bfdd7*1*0*8*24*2a74*882a*51281ac874a60baedc375ca645888d29780e20d4076edd1e7154a99bde982152a736311f*2*0*e3*1c5*eda7a8de*0*29*8*e3*eda7*5096*1455781b59707f5151139e018bdcfeebfc89bc37e372883a7ec0670a5eafc622feb338f9b021b6601a674094898a91beac70e41e675f77702834ca6156111a1bf7361bc9f3715d77dfcdd626634c68354c6f2e5e0a7b1e1ce84a44e632d0f6e36019feeab92fb7eac9dda8df436e287aafece95d042059a1b27d533c5eab62c1c559af220dc432f2eb1a38a70f29e8f3cb5a207704274d1e305d7402180fd47e026522792f5113c52a116d5bb25b67074ffd6f4926b221555234aabddc69775335d592d5c7d22462b75de1259e8342a9ba71cb06223d13c7f51f13be2ad76352c3b8ed*$/pkzip2$";
|
||||
|
||||
static const char *SIGNATURE_PKZIP_V1 = "$pkzip$";
|
||||
static const char *SIGNATURE_PKZIP_V2 = "$pkzip2$";
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
#define MAX_UNCOMPRESSED_LENGTH 4096
|
||||
|
||||
u32 module_attack_exec (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ATTACK_EXEC; }
|
||||
u32 module_dgst_pos0 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS0; }
|
||||
u32 module_dgst_pos1 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS1; }
|
||||
u32 module_dgst_pos2 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS2; }
|
||||
u32 module_dgst_pos3 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS3; }
|
||||
u32 module_dgst_size (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_SIZE; }
|
||||
u32 module_hash_category (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return HASH_CATEGORY; }
|
||||
const char *module_hash_name (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return HASH_NAME; }
|
||||
u64 module_kern_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return KERN_TYPE; }
|
||||
u32 module_opti_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return OPTI_TYPE; }
|
||||
u64 module_opts_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return OPTS_TYPE; }
|
||||
u32 module_salt_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return SALT_TYPE; }
|
||||
const char *module_st_hash (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ST_HASH; }
|
||||
const char *module_st_pass (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ST_PASS; }
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hashes[8];
|
||||
} pkzip_t;
|
||||
|
||||
u64 module_esalt_size (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra)
|
||||
{
|
||||
const u64 esalt_size = (const u64) sizeof (pkzip_t);
|
||||
|
||||
return esalt_size;
|
||||
}
|
||||
|
||||
void hex_to_binary (const char *source, int len, char* out)
|
||||
{
|
||||
const char *pos = source;
|
||||
for (size_t count = 0; count < (size_t) len/2; count++) {
|
||||
sscanf(pos, "%2hhx", &out[count]);
|
||||
pos += 2;
|
||||
}
|
||||
}
|
||||
|
||||
int module_hash_decode (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED void *digest_buf, MAYBE_UNUSED salt_t *salt, MAYBE_UNUSED void *esalt_buf, MAYBE_UNUSED void *hook_salt_buf, MAYBE_UNUSED hashinfo_t *hash_info, const char *line_buf, MAYBE_UNUSED const int line_len)
|
||||
{
|
||||
pkzip_t *pkzip = (pkzip_t *) esalt_buf;
|
||||
|
||||
u32 *digest = (u32 *) digest_buf;
|
||||
|
||||
char input[line_len + 1];
|
||||
input[line_len] = '\0';
|
||||
memcpy(&input, line_buf, line_len);
|
||||
|
||||
char *p = strtok(input, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
if (strncmp(p, SIGNATURE_PKZIP_V1, 7) != 0 && strncmp(p, SIGNATURE_PKZIP_V2, 8) != 0) return PARSER_HASH_LENGTH;
|
||||
|
||||
pkzip->version = 1;
|
||||
if(strlen(p) == 9) pkzip->version = 2;
|
||||
|
||||
char sub[2];
|
||||
sub[0] = p[strlen(p) - 1];
|
||||
sub[1] = '\0';
|
||||
pkzip->hash_count = atoi(sub);
|
||||
|
||||
// check here that the hash_count is valid for the attack type
|
||||
if(pkzip->hash_count > 8) return PARSER_HASH_VALUE;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->checksum_size = atoi(p);
|
||||
if (pkzip->checksum_size != 1 && pkzip->checksum_size != 2) return PARSER_HASH_LENGTH;
|
||||
|
||||
for(int i = 0; i < pkzip->hash_count; i++)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].data_type_enum = atoi(p);
|
||||
if (pkzip->hashes[i].data_type_enum > 3) return PARSER_HASH_LENGTH;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].magic_type_enum = atoi(p);
|
||||
|
||||
if(pkzip->hashes[i].data_type_enum > 1)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].compressed_length = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].uncompressed_length = strtoul(p, NULL, 16);
|
||||
if (pkzip->hashes[i].compressed_length > MAX_COMPRESSED_LENGTH || pkzip->hashes[i].uncompressed_length > MAX_UNCOMPRESSED_LENGTH)
|
||||
{
|
||||
return PARSER_TOKEN_LENGTH;
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%x", &(pkzip->hashes[i].crc32));
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].offset = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].additional_offset = strtoul(p, NULL, 16);
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].compression_type = atoi(p);
|
||||
if (pkzip->hashes[i].compression_type != 8) return PARSER_HASH_VALUE;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].data_length = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%hx", &(pkzip->hashes[i].checksum_from_crc));
|
||||
if(pkzip->version == 2)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%hx", &(pkzip->hashes[i].checksum_from_timestamp));
|
||||
}
|
||||
else
|
||||
{
|
||||
pkzip->hashes[i].checksum_from_timestamp = pkzip->hashes[i].checksum_from_crc;
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
|
||||
hex_to_binary(p, strlen(p) * 2, (char *) &(pkzip->hashes[i].data));
|
||||
|
||||
// fake salt
|
||||
salt->salt_buf[0] ^= pkzip->hashes[i].data[ 3] << 24 | pkzip->hashes[i].data[ 2] << 16 | pkzip->hashes[i].data[ 1] << 8 | pkzip->hashes[i].data[ 0];
|
||||
salt->salt_buf[1] ^= pkzip->hashes[i].data[ 7] << 24 | pkzip->hashes[i].data[ 6] << 16 | pkzip->hashes[i].data[ 5] << 8 | pkzip->hashes[i].data[ 4];
|
||||
salt->salt_buf[2] ^= pkzip->hashes[i].data[11] << 24 | pkzip->hashes[i].data[10] << 16 | pkzip->hashes[i].data[ 9] << 8 | pkzip->hashes[i].data[ 8];
|
||||
salt->salt_buf[3] ^= pkzip->hashes[i].data[15] << 24 | pkzip->hashes[i].data[14] << 16 | pkzip->hashes[i].data[13] << 8 | pkzip->hashes[i].data[ 12];
|
||||
|
||||
salt->salt_len = 16;
|
||||
|
||||
// fake hash
|
||||
digest[0] ^= pkzip->hashes[i].data[ 0] << 24 | pkzip->hashes[i].data[ 1] << 16 | pkzip->hashes[i].data[ 2] << 8 | pkzip->hashes[i].data[ 3];
|
||||
digest[1] ^= pkzip->hashes[i].data[ 4] << 24 | pkzip->hashes[i].data[ 5] << 16 | pkzip->hashes[i].data[ 6] << 8 | pkzip->hashes[i].data[ 7];
|
||||
digest[2] ^= pkzip->hashes[i].data[ 8] << 24 | pkzip->hashes[i].data[ 9] << 16 | pkzip->hashes[i].data[10] << 8 | pkzip->hashes[i].data[11];
|
||||
digest[3] ^= pkzip->hashes[i].data[12] << 24 | pkzip->hashes[i].data[13] << 16 | pkzip->hashes[i].data[14] << 8 | pkzip->hashes[i].data[15];
|
||||
}
|
||||
|
||||
return (PARSER_OK);
|
||||
}
|
||||
|
||||
int module_hash_encode (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const void *digest_buf, MAYBE_UNUSED const salt_t *salt, MAYBE_UNUSED const void *esalt_buf, MAYBE_UNUSED const void *hook_salt_buf, MAYBE_UNUSED const hashinfo_t *hash_info, char *line_buf, MAYBE_UNUSED const int line_size)
|
||||
{
|
||||
const u32 *digest = (const u32 *) digest_buf;
|
||||
|
||||
const pkzip_t *pkzip = (const pkzip_t *) esalt_buf;
|
||||
|
||||
int out_len = 0;
|
||||
|
||||
if (pkzip->version == 1)
|
||||
{
|
||||
sprintf (line_buf, "%s", SIGNATURE_PKZIP_V1);
|
||||
out_len += 7;
|
||||
}
|
||||
else
|
||||
{
|
||||
sprintf (line_buf, "%s", SIGNATURE_PKZIP_V2);
|
||||
out_len += 8;
|
||||
}
|
||||
out_len += sprintf (line_buf + out_len, "%i*%i*", pkzip->hash_count, pkzip->checksum_size);
|
||||
|
||||
for (int cnt = 0; cnt < pkzip->hash_count; cnt++)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%i*%i*", pkzip->hashes[cnt].data_type_enum, pkzip->hashes[cnt].magic_type_enum);
|
||||
if (pkzip->hashes[cnt].data_type_enum > 1)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%x*%x*%x*%x*%x*", pkzip->hashes[cnt].compressed_length, pkzip->hashes[cnt].uncompressed_length, pkzip->hashes[cnt].crc32, pkzip->hashes[cnt].offset, pkzip->hashes[cnt].additional_offset);
|
||||
}
|
||||
|
||||
out_len += sprintf (line_buf + out_len, "%i*%x*%x*", pkzip->hashes[cnt].compression_type, pkzip->hashes[cnt].data_length, pkzip->hashes[cnt].checksum_from_crc);
|
||||
if (pkzip->version == 2)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%x*", pkzip->hashes[cnt].checksum_from_timestamp);
|
||||
}
|
||||
|
||||
for (u32 i = 0; i < pkzip->hashes[cnt].data_length; i++)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%02x", pkzip->hashes[cnt].data[i]);
|
||||
}
|
||||
}
|
||||
|
||||
if (pkzip->version == 1)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "*$/pkzip$");
|
||||
}
|
||||
else
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "*$/pkzip2$");
|
||||
}
|
||||
|
||||
return out_len;
|
||||
}
|
||||
|
||||
void module_init (module_ctx_t *module_ctx)
|
||||
{
|
||||
module_ctx->module_context_size = MODULE_CONTEXT_SIZE_CURRENT;
|
||||
module_ctx->module_interface_version = MODULE_INTERFACE_VERSION_CURRENT;
|
||||
|
||||
module_ctx->module_attack_exec = module_attack_exec;
|
||||
module_ctx->module_benchmark_esalt = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_hook_salt = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_mask = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_salt = MODULE_DEFAULT;
|
||||
module_ctx->module_build_plain_postprocess = MODULE_DEFAULT;
|
||||
module_ctx->module_deep_comp_kernel = MODULE_DEFAULT;
|
||||
module_ctx->module_dgst_pos0 = module_dgst_pos0;
|
||||
module_ctx->module_dgst_pos1 = module_dgst_pos1;
|
||||
module_ctx->module_dgst_pos2 = module_dgst_pos2;
|
||||
module_ctx->module_dgst_pos3 = module_dgst_pos3;
|
||||
module_ctx->module_dgst_size = module_dgst_size;
|
||||
module_ctx->module_dictstat_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_esalt_size = module_esalt_size;
|
||||
module_ctx->module_extra_buffer_size = MODULE_DEFAULT;
|
||||
module_ctx->module_extra_tmp_size = MODULE_DEFAULT;
|
||||
module_ctx->module_forced_outfile_format = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_count = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_parse = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_save = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode_outfile = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode_zero_hash = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode = module_hash_decode;
|
||||
module_ctx->module_hash_encode_status = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_encode = module_hash_encode;
|
||||
module_ctx->module_hash_init_selftest = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_mode = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_category = module_hash_category;
|
||||
module_ctx->module_hash_name = module_hash_name;
|
||||
module_ctx->module_hlfmt_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_hook12 = MODULE_DEFAULT;
|
||||
module_ctx->module_hook23 = MODULE_DEFAULT;
|
||||
module_ctx->module_hook_salt_size = MODULE_DEFAULT;
|
||||
module_ctx->module_hook_size = MODULE_DEFAULT;
|
||||
module_ctx->module_jit_build_options = MODULE_DEFAULT;
|
||||
module_ctx->module_jit_cache_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_accel_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_accel_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_loops_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_loops_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_threads_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_threads_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kern_type = module_kern_type;
|
||||
module_ctx->module_kern_type_dynamic = MODULE_DEFAULT;
|
||||
module_ctx->module_opti_type = module_opti_type;
|
||||
module_ctx->module_opts_type = module_opts_type;
|
||||
module_ctx->module_outfile_check_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_outfile_check_nocomp = MODULE_DEFAULT;
|
||||
module_ctx->module_potfile_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_potfile_keep_all_hashes = MODULE_DEFAULT;
|
||||
module_ctx->module_pwdump_column = MODULE_DEFAULT;
|
||||
module_ctx->module_pw_max = MODULE_DEFAULT;
|
||||
module_ctx->module_pw_min = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_max = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_min = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_type = module_salt_type;
|
||||
module_ctx->module_separator = MODULE_DEFAULT;
|
||||
module_ctx->module_st_hash = module_st_hash;
|
||||
module_ctx->module_st_pass = module_st_pass;
|
||||
module_ctx->module_tmp_size = MODULE_DEFAULT;
|
||||
module_ctx->module_unstable_warning = MODULE_DEFAULT;
|
||||
module_ctx->module_warmup_disable = MODULE_DEFAULT;
|
||||
}
|
||||
|
|
@ -0,0 +1,404 @@
|
|||
/*
|
||||
|
||||
PKZIP Kernels for Hashcat (c) 2018, European Union
|
||||
|
||||
PKZIP Kernels for Hashcat has been developed by the Joint Research Centre of the European Commission.
|
||||
It is released as open source software under the MIT License.
|
||||
|
||||
PKZIP Kernels for Hashcat makes use of two primary external components, which continue to be subject
|
||||
to the terms and conditions stipulated in the respective licences they have been released under. These
|
||||
external components include, but are not necessarily limited to, the following:
|
||||
|
||||
-----
|
||||
|
||||
1. Hashcat: MIT License
|
||||
|
||||
Copyright (c) 2015-2018 Jens Steube
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
||||
associated documentation files (the "Software"), to deal in the Software without restriction, including
|
||||
without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to
|
||||
the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
2. Miniz: MIT License
|
||||
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
-----
|
||||
|
||||
The European Union disclaims all liability related to or arising out of the use made by third parties of
|
||||
any external components and dependencies which may be included with PKZIP Kernels for Hashcat.
|
||||
|
||||
-----
|
||||
|
||||
The MIT License
|
||||
|
||||
Copyright (c) 2018, EUROPEAN UNION
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all copies or substantial
|
||||
portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
||||
LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
||||
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
|
||||
Author: Sein Coray
|
||||
|
||||
*/
|
||||
|
||||
#include "common.h"
|
||||
#include "types.h"
|
||||
#include "modules.h"
|
||||
#include "bitops.h"
|
||||
#include "convert.h"
|
||||
#include "shared.h"
|
||||
#include "inc_hash_constants.h"
|
||||
|
||||
static const u32 ATTACK_EXEC = ATTACK_EXEC_INSIDE_KERNEL;
|
||||
static const u32 DGST_POS0 = 1;
|
||||
static const u32 DGST_POS1 = 2;
|
||||
static const u32 DGST_POS2 = 3;
|
||||
static const u32 DGST_POS3 = 4;
|
||||
static const u32 DGST_SIZE = DGST_SIZE_4_4;
|
||||
static const u32 HASH_CATEGORY = HASH_CATEGORY_ARCHIVE;
|
||||
static const char *HASH_NAME = "PKZIP (Compressed Multi-File Checksum-Only)";
|
||||
static const u64 KERN_TYPE = 17230;
|
||||
static const u32 OPTI_TYPE = 0;
|
||||
static const u64 OPTS_TYPE = 0;
|
||||
static const u32 SALT_TYPE = SALT_TYPE_EMBEDDED;
|
||||
static const char *ST_PASS = "hashcat";
|
||||
static const char *ST_HASH = "$pkzip2$8*1*1*0*8*24*a425*8827*3bd479d541019c2f32395046b8fbca7e1dca218b9b5414975be49942c3536298e9cc939e*1*0*8*24*2a74*882a*537af57c30fd9fd4b3eefa9ce55b6bff3bbfada237a7c1dace8ebf3bb0de107426211da3*1*0*8*24*2a74*882a*5f406b4858d3489fd4a6a6788798ac9b924b5d0ca8b8e5a6371739c9edcfd28c82f75316*1*0*8*24*2a74*882a*1843aca546b2ea68bd844d1e99d4f74d86417248eb48dd5e956270e42a331c18ea13f5ed*1*0*8*24*2a74*882a*aca3d16543bbfb2e5d2659f63802e0fa5b33e0a1f8ae47334019b4f0b6045d3d8eda3af1*1*0*8*24*2a74*882a*fbe0efc9e10ae1fc9b169bd060470bf3e39f09f8d83bebecd5216de02b81e35fe7e7b2f2*1*0*8*24*2a74*882a*537886dbabffbb7cac77deb01dc84760894524e6966183b4478a4ef56f0c657375a235a1*1*0*8*24*eda7*5096*40eb30ef1ddd9b77b894ed46abf199b480f1e5614fde510855f92ae7b8026a11f80e4d5f*$/pkzip2$";
|
||||
|
||||
static const char *SIGNATURE_PKZIP_V1 = "$pkzip$";
|
||||
static const char *SIGNATURE_PKZIP_V2 = "$pkzip2$";
|
||||
|
||||
#define MAX_COMPRESSED_LENGTH 2048
|
||||
|
||||
u32 module_attack_exec (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ATTACK_EXEC; }
|
||||
u32 module_dgst_pos0 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS0; }
|
||||
u32 module_dgst_pos1 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS1; }
|
||||
u32 module_dgst_pos2 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS2; }
|
||||
u32 module_dgst_pos3 (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_POS3; }
|
||||
u32 module_dgst_size (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return DGST_SIZE; }
|
||||
u32 module_hash_category (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return HASH_CATEGORY; }
|
||||
const char *module_hash_name (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return HASH_NAME; }
|
||||
u64 module_kern_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return KERN_TYPE; }
|
||||
u32 module_opti_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return OPTI_TYPE; }
|
||||
u64 module_opts_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return OPTS_TYPE; }
|
||||
u32 module_salt_type (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return SALT_TYPE; }
|
||||
const char *module_st_hash (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ST_HASH; }
|
||||
const char *module_st_pass (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra) { return ST_PASS; }
|
||||
|
||||
typedef struct pkzip_hash
|
||||
{
|
||||
u8 data_type_enum;
|
||||
u8 magic_type_enum;
|
||||
u32 compressed_length;
|
||||
u32 uncompressed_length;
|
||||
u32 crc32;
|
||||
u8 offset;
|
||||
u8 additional_offset;
|
||||
u8 compression_type;
|
||||
u32 data_length;
|
||||
u16 checksum_from_crc;
|
||||
u16 checksum_from_timestamp;
|
||||
u8 data[MAX_COMPRESSED_LENGTH];
|
||||
} pkzip_hash_t;
|
||||
|
||||
typedef struct pkzip
|
||||
{
|
||||
u8 hash_count;
|
||||
u8 checksum_size;
|
||||
u8 version;
|
||||
pkzip_hash_t hashes[8];
|
||||
} pkzip_t;
|
||||
|
||||
u64 module_esalt_size (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const user_options_t *user_options, MAYBE_UNUSED const user_options_extra_t *user_options_extra)
|
||||
{
|
||||
const u64 esalt_size = (const u64) sizeof (pkzip_t);
|
||||
|
||||
return esalt_size;
|
||||
}
|
||||
|
||||
void hex_to_binary (const char *source, int len, char* out)
|
||||
{
|
||||
const char *pos = source;
|
||||
for (size_t count = 0; count < (size_t) len/2; count++) {
|
||||
sscanf(pos, "%2hhx", &out[count]);
|
||||
pos += 2;
|
||||
}
|
||||
}
|
||||
|
||||
int module_hash_decode (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED void *digest_buf, MAYBE_UNUSED salt_t *salt, MAYBE_UNUSED void *esalt_buf, MAYBE_UNUSED void *hook_salt_buf, MAYBE_UNUSED hashinfo_t *hash_info, const char *line_buf, MAYBE_UNUSED const int line_len)
|
||||
{
|
||||
pkzip_t *pkzip = (pkzip_t *) esalt_buf;
|
||||
|
||||
u32 *digest = (u32 *) digest_buf;
|
||||
|
||||
char input[line_len + 1];
|
||||
input[line_len] = '\0';
|
||||
memcpy(&input, line_buf, line_len);
|
||||
|
||||
char *p = strtok(input, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
if (strncmp(p, SIGNATURE_PKZIP_V1, 7) != 0 && strncmp(p, SIGNATURE_PKZIP_V2, 8) != 0) return PARSER_HASH_LENGTH;
|
||||
|
||||
pkzip->version = 1;
|
||||
if(strlen(p) == 9) pkzip->version = 2;
|
||||
|
||||
char sub[2];
|
||||
sub[0] = p[strlen(p) - 1];
|
||||
sub[1] = '\0';
|
||||
pkzip->hash_count = atoi(sub);
|
||||
|
||||
// check here that the hash_count is valid for the attack type
|
||||
if(pkzip->hash_count > 8) return PARSER_HASH_VALUE;
|
||||
if(pkzip->hash_count < 3) return PARSER_HASH_VALUE;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->checksum_size = atoi(p);
|
||||
if (pkzip->checksum_size != 1 && pkzip->checksum_size != 2) return PARSER_HASH_LENGTH;
|
||||
|
||||
for(int i = 0; i < pkzip->hash_count; i++)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].data_type_enum = atoi(p);
|
||||
if (pkzip->hashes[i].data_type_enum > 3) return PARSER_HASH_LENGTH;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].magic_type_enum = atoi(p);
|
||||
|
||||
if(pkzip->hashes[i].data_type_enum > 1)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].compressed_length = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].uncompressed_length = strtoul(p, NULL, 16);
|
||||
if (pkzip->hashes[i].compressed_length > MAX_COMPRESSED_LENGTH)
|
||||
{
|
||||
return PARSER_TOKEN_LENGTH;
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%x", &(pkzip->hashes[i].crc32));
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].offset = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].additional_offset = strtoul(p, NULL, 16);
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].compression_type = atoi(p);
|
||||
if (pkzip->hashes[i].compression_type != 8) return PARSER_HASH_VALUE;
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
pkzip->hashes[i].data_length = strtoul(p, NULL, 16);
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%hx", &(pkzip->hashes[i].checksum_from_crc));
|
||||
if(pkzip->version == 2)
|
||||
{
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
sscanf(p, "%hx", &(pkzip->hashes[i].checksum_from_timestamp));
|
||||
}
|
||||
else
|
||||
{
|
||||
pkzip->hashes[i].checksum_from_timestamp = pkzip->hashes[i].checksum_from_crc;
|
||||
}
|
||||
|
||||
p = strtok(NULL, "*");
|
||||
if (p == NULL) return PARSER_HASH_LENGTH;
|
||||
|
||||
hex_to_binary(p, strlen(p) * 2, (char *) &(pkzip->hashes[i].data));
|
||||
|
||||
// fake salt
|
||||
salt->salt_buf[0] ^= pkzip->hashes[i].data[ 3] << 24 | pkzip->hashes[i].data[ 2] << 16 | pkzip->hashes[i].data[ 1] << 8 | pkzip->hashes[i].data[ 0];
|
||||
salt->salt_buf[1] ^= pkzip->hashes[i].data[ 7] << 24 | pkzip->hashes[i].data[ 6] << 16 | pkzip->hashes[i].data[ 5] << 8 | pkzip->hashes[i].data[ 4];
|
||||
salt->salt_buf[2] ^= pkzip->hashes[i].data[11] << 24 | pkzip->hashes[i].data[10] << 16 | pkzip->hashes[i].data[ 9] << 8 | pkzip->hashes[i].data[ 8];
|
||||
salt->salt_buf[3] ^= pkzip->hashes[i].data[15] << 24 | pkzip->hashes[i].data[14] << 16 | pkzip->hashes[i].data[13] << 8 | pkzip->hashes[i].data[ 12];
|
||||
|
||||
salt->salt_len = 16;
|
||||
|
||||
// fake hash
|
||||
digest[0] ^= pkzip->hashes[i].data[ 0] << 24 | pkzip->hashes[i].data[ 1] << 16 | pkzip->hashes[i].data[ 2] << 8 | pkzip->hashes[i].data[ 3];
|
||||
digest[1] ^= pkzip->hashes[i].data[ 4] << 24 | pkzip->hashes[i].data[ 5] << 16 | pkzip->hashes[i].data[ 6] << 8 | pkzip->hashes[i].data[ 7];
|
||||
digest[2] ^= pkzip->hashes[i].data[ 8] << 24 | pkzip->hashes[i].data[ 9] << 16 | pkzip->hashes[i].data[10] << 8 | pkzip->hashes[i].data[11];
|
||||
digest[3] ^= pkzip->hashes[i].data[12] << 24 | pkzip->hashes[i].data[13] << 16 | pkzip->hashes[i].data[14] << 8 | pkzip->hashes[i].data[15];
|
||||
}
|
||||
|
||||
return (PARSER_OK);
|
||||
}
|
||||
|
||||
int module_hash_encode (MAYBE_UNUSED const hashconfig_t *hashconfig, MAYBE_UNUSED const void *digest_buf, MAYBE_UNUSED const salt_t *salt, MAYBE_UNUSED const void *esalt_buf, MAYBE_UNUSED const void *hook_salt_buf, MAYBE_UNUSED const hashinfo_t *hash_info, char *line_buf, MAYBE_UNUSED const int line_size)
|
||||
{
|
||||
const u32 *digest = (const u32 *) digest_buf;
|
||||
|
||||
const pkzip_t *pkzip = (const pkzip_t *) esalt_buf;
|
||||
|
||||
int out_len = 0;
|
||||
|
||||
if (pkzip->version == 1)
|
||||
{
|
||||
sprintf (line_buf, "%s", SIGNATURE_PKZIP_V1);
|
||||
out_len += 7;
|
||||
}
|
||||
else
|
||||
{
|
||||
sprintf (line_buf, "%s", SIGNATURE_PKZIP_V2);
|
||||
out_len += 8;
|
||||
}
|
||||
out_len += sprintf (line_buf + out_len, "%i*%i*", pkzip->hash_count, pkzip->checksum_size);
|
||||
|
||||
for (int cnt = 0; cnt < pkzip->hash_count; cnt++)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%i*%i*", pkzip->hashes[cnt].data_type_enum, pkzip->hashes[cnt].magic_type_enum);
|
||||
if (pkzip->hashes[cnt].data_type_enum > 1)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%x*%x*%x*%x*%x*", pkzip->hashes[cnt].compressed_length, pkzip->hashes[cnt].uncompressed_length, pkzip->hashes[cnt].crc32, pkzip->hashes[cnt].offset, pkzip->hashes[cnt].additional_offset);
|
||||
}
|
||||
|
||||
out_len += sprintf (line_buf + out_len, "%i*%x*%x*", pkzip->hashes[cnt].compression_type, pkzip->hashes[cnt].data_length, pkzip->hashes[cnt].checksum_from_crc);
|
||||
if (pkzip->version == 2)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%x*", pkzip->hashes[cnt].checksum_from_timestamp);
|
||||
}
|
||||
|
||||
for (u32 i = 0; i < pkzip->hashes[cnt].data_length; i++)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "%02x", pkzip->hashes[cnt].data[i]);
|
||||
}
|
||||
}
|
||||
|
||||
if (pkzip->version == 1)
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "*$/pkzip$");
|
||||
}
|
||||
else
|
||||
{
|
||||
out_len += sprintf (line_buf + out_len, "*$/pkzip2$");
|
||||
}
|
||||
|
||||
return out_len;
|
||||
}
|
||||
|
||||
void module_init (module_ctx_t *module_ctx)
|
||||
{
|
||||
module_ctx->module_context_size = MODULE_CONTEXT_SIZE_CURRENT;
|
||||
module_ctx->module_interface_version = MODULE_INTERFACE_VERSION_CURRENT;
|
||||
|
||||
module_ctx->module_attack_exec = module_attack_exec;
|
||||
module_ctx->module_benchmark_esalt = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_hook_salt = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_mask = MODULE_DEFAULT;
|
||||
module_ctx->module_benchmark_salt = MODULE_DEFAULT;
|
||||
module_ctx->module_build_plain_postprocess = MODULE_DEFAULT;
|
||||
module_ctx->module_deep_comp_kernel = MODULE_DEFAULT;
|
||||
module_ctx->module_dgst_pos0 = module_dgst_pos0;
|
||||
module_ctx->module_dgst_pos1 = module_dgst_pos1;
|
||||
module_ctx->module_dgst_pos2 = module_dgst_pos2;
|
||||
module_ctx->module_dgst_pos3 = module_dgst_pos3;
|
||||
module_ctx->module_dgst_size = module_dgst_size;
|
||||
module_ctx->module_dictstat_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_esalt_size = module_esalt_size;
|
||||
module_ctx->module_extra_buffer_size = MODULE_DEFAULT;
|
||||
module_ctx->module_extra_tmp_size = MODULE_DEFAULT;
|
||||
module_ctx->module_forced_outfile_format = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_count = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_parse = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_binary_save = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode_outfile = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode_zero_hash = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_decode = module_hash_decode;
|
||||
module_ctx->module_hash_encode_status = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_encode = module_hash_encode;
|
||||
module_ctx->module_hash_init_selftest = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_mode = MODULE_DEFAULT;
|
||||
module_ctx->module_hash_category = module_hash_category;
|
||||
module_ctx->module_hash_name = module_hash_name;
|
||||
module_ctx->module_hlfmt_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_hook12 = MODULE_DEFAULT;
|
||||
module_ctx->module_hook23 = MODULE_DEFAULT;
|
||||
module_ctx->module_hook_salt_size = MODULE_DEFAULT;
|
||||
module_ctx->module_hook_size = MODULE_DEFAULT;
|
||||
module_ctx->module_jit_build_options = MODULE_DEFAULT;
|
||||
module_ctx->module_jit_cache_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_accel_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_accel_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_loops_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_loops_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_threads_max = MODULE_DEFAULT;
|
||||
module_ctx->module_kernel_threads_min = MODULE_DEFAULT;
|
||||
module_ctx->module_kern_type = module_kern_type;
|
||||
module_ctx->module_kern_type_dynamic = MODULE_DEFAULT;
|
||||
module_ctx->module_opti_type = module_opti_type;
|
||||
module_ctx->module_opts_type = module_opts_type;
|
||||
module_ctx->module_outfile_check_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_outfile_check_nocomp = MODULE_DEFAULT;
|
||||
module_ctx->module_potfile_disable = MODULE_DEFAULT;
|
||||
module_ctx->module_potfile_keep_all_hashes = MODULE_DEFAULT;
|
||||
module_ctx->module_pwdump_column = MODULE_DEFAULT;
|
||||
module_ctx->module_pw_max = MODULE_DEFAULT;
|
||||
module_ctx->module_pw_min = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_max = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_min = MODULE_DEFAULT;
|
||||
module_ctx->module_salt_type = module_salt_type;
|
||||
module_ctx->module_separator = MODULE_DEFAULT;
|
||||
module_ctx->module_st_hash = module_st_hash;
|
||||
module_ctx->module_st_pass = module_st_pass;
|
||||
module_ctx->module_tmp_size = MODULE_DEFAULT;
|
||||
module_ctx->module_unstable_warning = MODULE_DEFAULT;
|
||||
module_ctx->module_warmup_disable = MODULE_DEFAULT;
|
||||
}
|
||||
Loading…
Reference in New Issue