1
0
mirror of https://github.com/hashcat/hashcat.git synced 2024-11-01 04:58:57 +00:00
hashcat/OpenCL/m03710_a3-pure.cl

294 lines
6.9 KiB
Common Lisp
Raw Normal View History

2015-12-04 14:47:52 +00:00
/**
* Author......: See docs/credits.txt
2015-12-04 14:47:52 +00:00
* License.....: MIT
*/
#define NEW_SIMD_CODE
#ifdef KERNEL_STATIC
#include "inc_vendor.h"
#include "inc_types.h"
2019-04-26 11:59:43 +00:00
#include "inc_platform.cl"
#include "inc_common.cl"
#include "inc_simd.cl"
#include "inc_hash_md5.cl"
#endif
#if VECT_SIZE == 1
#define uint_to_hex_lower8(i) (u32x) (l_bin2asc[(i)])
#elif VECT_SIZE == 2
#define uint_to_hex_lower8(i) (u32x) (l_bin2asc[(i).s0], l_bin2asc[(i).s1])
#elif VECT_SIZE == 4
#define uint_to_hex_lower8(i) (u32x) (l_bin2asc[(i).s0], l_bin2asc[(i).s1], l_bin2asc[(i).s2], l_bin2asc[(i).s3])
#elif VECT_SIZE == 8
#define uint_to_hex_lower8(i) (u32x) (l_bin2asc[(i).s0], l_bin2asc[(i).s1], l_bin2asc[(i).s2], l_bin2asc[(i).s3], l_bin2asc[(i).s4], l_bin2asc[(i).s5], l_bin2asc[(i).s6], l_bin2asc[(i).s7])
#elif VECT_SIZE == 16
#define uint_to_hex_lower8(i) (u32x) (l_bin2asc[(i).s0], l_bin2asc[(i).s1], l_bin2asc[(i).s2], l_bin2asc[(i).s3], l_bin2asc[(i).s4], l_bin2asc[(i).s5], l_bin2asc[(i).s6], l_bin2asc[(i).s7], l_bin2asc[(i).s8], l_bin2asc[(i).s9], l_bin2asc[(i).sa], l_bin2asc[(i).sb], l_bin2asc[(i).sc], l_bin2asc[(i).sd], l_bin2asc[(i).se], l_bin2asc[(i).sf])
#endif
2015-12-04 14:47:52 +00:00
KERNEL_FQ void m03710_mxx (KERN_ATTR_VECTOR ())
2015-12-04 14:47:52 +00:00
{
/**
* modifier
*/
const u64 gid = get_global_id (0);
const u64 lid = get_local_id (0);
const u64 lsz = get_local_size (0);
2015-12-04 14:47:52 +00:00
/**
* bin2asc table
2015-12-04 14:47:52 +00:00
*/
LOCAL_AS u32 l_bin2asc[256];
for (u32 i = lid; i < 256; i += lsz)
{
const u32 i0 = (i >> 0) & 15;
const u32 i1 = (i >> 4) & 15;
l_bin2asc[i] = ((i0 < 10) ? '0' + i0 : 'a' - 10 + i0) << 8
| ((i1 < 10) ? '0' + i1 : 'a' - 10 + i1) << 0;
}
2019-04-26 11:34:07 +00:00
SYNC_THREADS ();
if (gid >= gid_max) return;
2015-12-04 14:47:52 +00:00
/**
* base
*/
const u32 pw_len = pws[gid].pw_len;
2015-12-04 14:47:52 +00:00
u32x w[64] = { 0 };
2015-12-04 14:47:52 +00:00
for (u32 i = 0, idx = 0; i < pw_len; i += 4, idx += 1)
2016-05-03 22:52:53 +00:00
{
w[idx] = pws[gid].i[idx];
2016-05-03 22:52:53 +00:00
}
2015-12-04 14:47:52 +00:00
const u32 salt_len = salt_bufs[salt_pos].salt_len;
2015-12-04 14:47:52 +00:00
u32x s[64] = { 0 };
2015-12-04 14:47:52 +00:00
for (u32 i = 0, idx = 0; i < salt_len; i += 4, idx += 1)
{
s[idx] = salt_bufs[salt_pos].salt_buf[idx];
}
2015-12-04 14:47:52 +00:00
/**
* loop
2015-12-04 14:47:52 +00:00
*/
u32x w0l = w[0];
2015-12-04 14:47:52 +00:00
for (u32 il_pos = 0; il_pos < il_cnt; il_pos += VECT_SIZE)
{
const u32x w0r = words_buf_r[il_pos / VECT_SIZE];
2015-12-04 14:47:52 +00:00
const u32x w0lr = w0l | w0r;
2015-12-04 14:47:52 +00:00
w[0] = w0lr;
2015-12-04 14:47:52 +00:00
md5_ctx_vector_t ctx0;
2015-12-04 14:47:52 +00:00
md5_init_vector (&ctx0);
2015-12-04 14:47:52 +00:00
md5_update_vector (&ctx0, w, pw_len);
2015-12-04 14:47:52 +00:00
md5_final_vector (&ctx0);
2015-12-04 14:47:52 +00:00
const u32x a = ctx0.h[0];
const u32x b = ctx0.h[1];
const u32x c = ctx0.h[2];
const u32x d = ctx0.h[3];
2015-12-04 14:47:52 +00:00
md5_ctx_vector_t ctx;
2015-12-04 14:47:52 +00:00
md5_init_vector (&ctx);
2015-12-04 14:47:52 +00:00
md5_update_vector (&ctx, s, salt_len);
2016-05-03 22:52:53 +00:00
u32x w0[4];
u32x w1[4];
u32x w2[4];
u32x w3[4];
2015-12-04 14:47:52 +00:00
w0[0] = uint_to_hex_lower8 ((a >> 0) & 255) << 0
| uint_to_hex_lower8 ((a >> 8) & 255) << 16;
w0[1] = uint_to_hex_lower8 ((a >> 16) & 255) << 0
| uint_to_hex_lower8 ((a >> 24) & 255) << 16;
w0[2] = uint_to_hex_lower8 ((b >> 0) & 255) << 0
| uint_to_hex_lower8 ((b >> 8) & 255) << 16;
w0[3] = uint_to_hex_lower8 ((b >> 16) & 255) << 0
| uint_to_hex_lower8 ((b >> 24) & 255) << 16;
w1[0] = uint_to_hex_lower8 ((c >> 0) & 255) << 0
| uint_to_hex_lower8 ((c >> 8) & 255) << 16;
w1[1] = uint_to_hex_lower8 ((c >> 16) & 255) << 0
| uint_to_hex_lower8 ((c >> 24) & 255) << 16;
w1[2] = uint_to_hex_lower8 ((d >> 0) & 255) << 0
| uint_to_hex_lower8 ((d >> 8) & 255) << 16;
w1[3] = uint_to_hex_lower8 ((d >> 16) & 255) << 0
| uint_to_hex_lower8 ((d >> 24) & 255) << 16;
w2[0] = 0;
w2[1] = 0;
w2[2] = 0;
w2[3] = 0;
w3[0] = 0;
w3[1] = 0;
w3[2] = 0;
w3[3] = 0;
2015-12-04 14:47:52 +00:00
md5_update_vector_64 (&ctx, w0, w1, w2, w3, 32);
2015-12-04 14:47:52 +00:00
md5_final_vector (&ctx);
2015-12-04 14:47:52 +00:00
const u32x r0 = ctx.h[DGST_R0];
const u32x r1 = ctx.h[DGST_R1];
const u32x r2 = ctx.h[DGST_R2];
const u32x r3 = ctx.h[DGST_R3];
COMPARE_M_SIMD (r0, r1, r2, r3);
}
2015-12-04 14:47:52 +00:00
}
KERNEL_FQ void m03710_sxx (KERN_ATTR_VECTOR ())
2015-12-04 14:47:52 +00:00
{
/**
* modifier
2015-12-04 14:47:52 +00:00
*/
const u64 gid = get_global_id (0);
const u64 lid = get_local_id (0);
const u64 lsz = get_local_size (0);
2015-12-04 14:47:52 +00:00
/**
* bin2asc table
*/
LOCAL_AS u32 l_bin2asc[256];
2015-12-04 14:47:52 +00:00
for (u32 i = lid; i < 256; i += lsz)
2016-05-03 22:52:53 +00:00
{
const u32 i0 = (i >> 0) & 15;
const u32 i1 = (i >> 4) & 15;
l_bin2asc[i] = ((i0 < 10) ? '0' + i0 : 'a' - 10 + i0) << 8
| ((i1 < 10) ? '0' + i1 : 'a' - 10 + i1) << 0;
}
2015-12-04 14:47:52 +00:00
2019-04-26 11:34:07 +00:00
SYNC_THREADS ();
2015-12-04 14:47:52 +00:00
if (gid >= gid_max) return;
/**
* digest
2015-12-04 14:47:52 +00:00
*/
const u32 search[4] =
{
digests_buf[digests_offset].digest_buf[DGST_R0],
digests_buf[digests_offset].digest_buf[DGST_R1],
digests_buf[digests_offset].digest_buf[DGST_R2],
digests_buf[digests_offset].digest_buf[DGST_R3]
};
2015-12-04 14:47:52 +00:00
/**
* base
*/
const u32 pw_len = pws[gid].pw_len;
2015-12-04 14:47:52 +00:00
u32x w[64] = { 0 };
2015-12-04 14:47:52 +00:00
for (u32 i = 0, idx = 0; i < pw_len; i += 4, idx += 1)
2016-05-03 22:52:53 +00:00
{
w[idx] = pws[gid].i[idx];
2016-05-03 22:52:53 +00:00
}
2015-12-04 14:47:52 +00:00
const u32 salt_len = salt_bufs[salt_pos].salt_len;
2015-12-04 14:47:52 +00:00
u32x s[64] = { 0 };
2015-12-04 14:47:52 +00:00
for (u32 i = 0, idx = 0; i < salt_len; i += 4, idx += 1)
{
s[idx] = salt_bufs[salt_pos].salt_buf[idx];
}
2015-12-04 14:47:52 +00:00
/**
* loop
2015-12-04 14:47:52 +00:00
*/
u32x 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 w0lr = w0l | w0r;
w[0] = w0lr;
md5_ctx_vector_t ctx0;
md5_init_vector (&ctx0);
2015-12-04 14:47:52 +00:00
md5_update_vector (&ctx0, w, pw_len);
2015-12-04 14:47:52 +00:00
md5_final_vector (&ctx0);
2015-12-04 14:47:52 +00:00
const u32x a = ctx0.h[0];
const u32x b = ctx0.h[1];
const u32x c = ctx0.h[2];
const u32x d = ctx0.h[3];
2015-12-04 14:47:52 +00:00
md5_ctx_vector_t ctx;
2015-12-04 14:47:52 +00:00
md5_init_vector (&ctx);
2015-12-04 14:47:52 +00:00
md5_update_vector (&ctx, s, salt_len);
2015-12-04 14:47:52 +00:00
u32x w0[4];
u32x w1[4];
u32x w2[4];
u32x w3[4];
2015-12-04 14:47:52 +00:00
w0[0] = uint_to_hex_lower8 ((a >> 0) & 255) << 0
| uint_to_hex_lower8 ((a >> 8) & 255) << 16;
w0[1] = uint_to_hex_lower8 ((a >> 16) & 255) << 0
| uint_to_hex_lower8 ((a >> 24) & 255) << 16;
w0[2] = uint_to_hex_lower8 ((b >> 0) & 255) << 0
| uint_to_hex_lower8 ((b >> 8) & 255) << 16;
w0[3] = uint_to_hex_lower8 ((b >> 16) & 255) << 0
| uint_to_hex_lower8 ((b >> 24) & 255) << 16;
w1[0] = uint_to_hex_lower8 ((c >> 0) & 255) << 0
| uint_to_hex_lower8 ((c >> 8) & 255) << 16;
w1[1] = uint_to_hex_lower8 ((c >> 16) & 255) << 0
| uint_to_hex_lower8 ((c >> 24) & 255) << 16;
w1[2] = uint_to_hex_lower8 ((d >> 0) & 255) << 0
| uint_to_hex_lower8 ((d >> 8) & 255) << 16;
w1[3] = uint_to_hex_lower8 ((d >> 16) & 255) << 0
| uint_to_hex_lower8 ((d >> 24) & 255) << 16;
w2[0] = 0;
w2[1] = 0;
w2[2] = 0;
w2[3] = 0;
w3[0] = 0;
w3[1] = 0;
w3[2] = 0;
w3[3] = 0;
2015-12-04 14:47:52 +00:00
md5_update_vector_64 (&ctx, w0, w1, w2, w3, 32);
2015-12-04 14:47:52 +00:00
md5_final_vector (&ctx);
const u32x r0 = ctx.h[DGST_R0];
const u32x r1 = ctx.h[DGST_R1];
const u32x r2 = ctx.h[DGST_R2];
const u32x r3 = ctx.h[DGST_R3];
2015-12-04 14:47:52 +00:00
COMPARE_S_SIMD (r0, r1, r2, r3);
}
2015-12-04 14:47:52 +00:00
}