1
0
mirror of https://github.com/hashcat/hashcat.git synced 2024-11-01 21:19:04 +00:00
hashcat/OpenCL/m00300_a3-pure.cl

183 lines
3.2 KiB
Common Lisp

/**
* Author......: See docs/credits.txt
* License.....: MIT
*/
#define NEW_SIMD_CODE
#ifdef KERNEL_STATIC
#include "inc_vendor.h"
#include "inc_types.h"
#include "inc_common.cl"
#include "inc_simd.cl"
#include "inc_hash_sha1.cl"
#endif
KERNEL_FQ void m00300_mxx (KERN_ATTR_VECTOR ())
{
/**
* modifier
*/
const u64 lid = get_local_id (0);
const u64 gid = get_global_id (0);
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 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;
sha1_ctx_vector_t ctx0;
sha1_init_vector (&ctx0);
sha1_update_vector (&ctx0, w, pw_len);
sha1_final_vector (&ctx0);
sha1_ctx_vector_t ctx;
sha1_init_vector (&ctx);
ctx.w0[0] = ctx0.h[0];
ctx.w0[1] = ctx0.h[1];
ctx.w0[2] = ctx0.h[2];
ctx.w0[3] = ctx0.h[3];
ctx.w1[0] = ctx0.h[4];
ctx.w1[1] = 0x80000000;
ctx.w1[2] = 0;
ctx.w1[3] = 0;
ctx.w2[0] = 0;
ctx.w2[1] = 0;
ctx.w2[2] = 0;
ctx.w2[3] = 0;
ctx.w3[0] = 0;
ctx.w3[1] = 0;
ctx.w3[2] = 0;
ctx.w3[3] = 20 * 8;
sha1_transform_vector (ctx.w0, ctx.w1, ctx.w2, ctx.w3, ctx.h);
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);
}
}
KERNEL_FQ void m00300_sxx (KERN_ATTR_VECTOR ())
{
/**
* modifier
*/
const u64 lid = get_local_id (0);
const u64 gid = get_global_id (0);
if (gid >= gid_max) return;
/**
* digest
*/
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]
};
/**
* 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 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;
sha1_ctx_vector_t ctx0;
sha1_init_vector (&ctx0);
sha1_update_vector (&ctx0, w, pw_len);
sha1_final_vector (&ctx0);
sha1_ctx_vector_t ctx;
sha1_init_vector (&ctx);
ctx.w0[0] = ctx0.h[0];
ctx.w0[1] = ctx0.h[1];
ctx.w0[2] = ctx0.h[2];
ctx.w0[3] = ctx0.h[3];
ctx.w1[0] = ctx0.h[4];
ctx.w1[1] = 0x80000000;
ctx.w1[2] = 0;
ctx.w1[3] = 0;
ctx.w2[0] = 0;
ctx.w2[1] = 0;
ctx.w2[2] = 0;
ctx.w2[3] = 0;
ctx.w3[0] = 0;
ctx.w3[1] = 0;
ctx.w3[2] = 0;
ctx.w3[3] = 20 * 8;
sha1_transform_vector (ctx.w0, ctx.w1, ctx.w2, ctx.w3, ctx.h);
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_S_SIMD (r0, r1, r2, r3);
}
}