mirror of
https://github.com/hashcat/hashcat.git
synced 2024-11-12 10:48:57 +00:00
193 lines
5.4 KiB
Common Lisp
193 lines
5.4 KiB
Common Lisp
/**
|
|
* Author......: See docs/credits.txt
|
|
* License.....: MIT
|
|
*/
|
|
|
|
//#define NEW_SIMD_CODE
|
|
|
|
#include "inc_vendor.cl"
|
|
#include "inc_hash_constants.h"
|
|
#include "inc_hash_functions.cl"
|
|
#include "inc_types.cl"
|
|
#include "inc_common.cl"
|
|
#include "inc_rp.h"
|
|
#include "inc_rp.cl"
|
|
#include "inc_scalar.cl"
|
|
#include "inc_hash_whirlpool.cl"
|
|
|
|
__kernel void m06100_mxx (__global pw_t *pws, __global const kernel_rule_t *rules_buf, __global const pw_t *combs_buf, __global const bf_t *bfs_buf, __global void *tmps, __global void *hooks, __global const u32 *bitmaps_buf_s1_a, __global const u32 *bitmaps_buf_s1_b, __global const u32 *bitmaps_buf_s1_c, __global const u32 *bitmaps_buf_s1_d, __global const u32 *bitmaps_buf_s2_a, __global const u32 *bitmaps_buf_s2_b, __global const u32 *bitmaps_buf_s2_c, __global const u32 *bitmaps_buf_s2_d, __global plain_t *plains_buf, __global const digest_t *digests_buf, __global u32 *hashes_shown, __global const salt_t *salt_bufs, __global const void *esalt_bufs, __global u32 *d_return_buf, __global u32 *d_scryptV0_buf, __global u32 *d_scryptV1_buf, __global u32 *d_scryptV2_buf, __global u32 *d_scryptV3_buf, const u32 bitmap_mask, const u32 bitmap_shift1, const u32 bitmap_shift2, const u32 salt_pos, const u32 loop_pos, const u32 loop_cnt, const u32 il_cnt, const u32 digests_cnt, const u32 digests_offset, const u32 combs_mode, const u32 gid_max)
|
|
{
|
|
/**
|
|
* modifier
|
|
*/
|
|
|
|
const u32 gid = get_global_id (0);
|
|
const u32 lid = get_local_id (0);
|
|
const u32 lsz = get_local_size (0);
|
|
|
|
/**
|
|
* shared
|
|
*/
|
|
|
|
__local u32 s_Ch[8][256];
|
|
__local u32 s_Cl[8][256];
|
|
|
|
for (u32 i = lid; i < 256; i += lsz)
|
|
{
|
|
s_Ch[0][i] = Ch[0][i];
|
|
s_Ch[1][i] = Ch[1][i];
|
|
s_Ch[2][i] = Ch[2][i];
|
|
s_Ch[3][i] = Ch[3][i];
|
|
s_Ch[4][i] = Ch[4][i];
|
|
s_Ch[5][i] = Ch[5][i];
|
|
s_Ch[6][i] = Ch[6][i];
|
|
s_Ch[7][i] = Ch[7][i];
|
|
|
|
s_Cl[0][i] = Cl[0][i];
|
|
s_Cl[1][i] = Cl[1][i];
|
|
s_Cl[2][i] = Cl[2][i];
|
|
s_Cl[3][i] = Cl[3][i];
|
|
s_Cl[4][i] = Cl[4][i];
|
|
s_Cl[5][i] = Cl[5][i];
|
|
s_Cl[6][i] = Cl[6][i];
|
|
s_Cl[7][i] = Cl[7][i];
|
|
}
|
|
|
|
barrier (CLK_LOCAL_MEM_FENCE);
|
|
|
|
if (gid >= gid_max) return;
|
|
|
|
/**
|
|
* base
|
|
*/
|
|
|
|
const u32 pw_len = pws[gid].pw_len;
|
|
|
|
const u32 pw_lenv = ceil ((float) pw_len / 4);
|
|
|
|
u32 w[64] = { 0 };
|
|
|
|
for (int idx = 0; idx < pw_lenv; idx++)
|
|
{
|
|
w[idx] = swap32_S (pws[gid].i[idx]);
|
|
}
|
|
|
|
/**
|
|
* loop
|
|
*/
|
|
|
|
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
|
{
|
|
// todo: add rules engine
|
|
|
|
whirlpool_ctx_t ctx;
|
|
|
|
whirlpool_init (&ctx, s_Ch, s_Cl);
|
|
|
|
whirlpool_update (&ctx, w, pw_len);
|
|
|
|
whirlpool_final (&ctx);
|
|
|
|
const u32 r0 = ctx.h[DGST_R0];
|
|
const u32 r1 = ctx.h[DGST_R1];
|
|
const u32 r2 = ctx.h[DGST_R2];
|
|
const u32 r3 = ctx.h[DGST_R3];
|
|
|
|
COMPARE_M_SCALAR (r0, r1, r2, r3);
|
|
}
|
|
}
|
|
|
|
__kernel void m06100_sxx (__global pw_t *pws, __global const kernel_rule_t *rules_buf, __global const pw_t *combs_buf, __global const bf_t *bfs_buf, __global void *tmps, __global void *hooks, __global const u32 *bitmaps_buf_s1_a, __global const u32 *bitmaps_buf_s1_b, __global const u32 *bitmaps_buf_s1_c, __global const u32 *bitmaps_buf_s1_d, __global const u32 *bitmaps_buf_s2_a, __global const u32 *bitmaps_buf_s2_b, __global const u32 *bitmaps_buf_s2_c, __global const u32 *bitmaps_buf_s2_d, __global plain_t *plains_buf, __global const digest_t *digests_buf, __global u32 *hashes_shown, __global const salt_t *salt_bufs, __global const void *esalt_bufs, __global u32 *d_return_buf, __global u32 *d_scryptV0_buf, __global u32 *d_scryptV1_buf, __global u32 *d_scryptV2_buf, __global u32 *d_scryptV3_buf, const u32 bitmap_mask, const u32 bitmap_shift1, const u32 bitmap_shift2, const u32 salt_pos, const u32 loop_pos, const u32 loop_cnt, const u32 il_cnt, const u32 digests_cnt, const u32 digests_offset, const u32 combs_mode, const u32 gid_max)
|
|
{
|
|
/**
|
|
* modifier
|
|
*/
|
|
|
|
const u32 gid = get_global_id (0);
|
|
const u32 lid = get_local_id (0);
|
|
const u32 lsz = get_local_size (0);
|
|
|
|
/**
|
|
* shared
|
|
*/
|
|
|
|
__local u32 s_Ch[8][256];
|
|
__local u32 s_Cl[8][256];
|
|
|
|
for (u32 i = lid; i < 256; i += lsz)
|
|
{
|
|
s_Ch[0][i] = Ch[0][i];
|
|
s_Ch[1][i] = Ch[1][i];
|
|
s_Ch[2][i] = Ch[2][i];
|
|
s_Ch[3][i] = Ch[3][i];
|
|
s_Ch[4][i] = Ch[4][i];
|
|
s_Ch[5][i] = Ch[5][i];
|
|
s_Ch[6][i] = Ch[6][i];
|
|
s_Ch[7][i] = Ch[7][i];
|
|
|
|
s_Cl[0][i] = Cl[0][i];
|
|
s_Cl[1][i] = Cl[1][i];
|
|
s_Cl[2][i] = Cl[2][i];
|
|
s_Cl[3][i] = Cl[3][i];
|
|
s_Cl[4][i] = Cl[4][i];
|
|
s_Cl[5][i] = Cl[5][i];
|
|
s_Cl[6][i] = Cl[6][i];
|
|
s_Cl[7][i] = Cl[7][i];
|
|
}
|
|
|
|
barrier (CLK_LOCAL_MEM_FENCE);
|
|
|
|
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;
|
|
|
|
const u32 pw_lenv = ceil ((float) pw_len / 4);
|
|
|
|
u32 w[64] = { 0 };
|
|
|
|
for (int idx = 0; idx < pw_lenv; idx++)
|
|
{
|
|
w[idx] = swap32_S (pws[gid].i[idx]);
|
|
}
|
|
|
|
/**
|
|
* loop
|
|
*/
|
|
|
|
for (u32 il_pos = 0; il_pos < il_cnt; il_pos++)
|
|
{
|
|
// todo: add rules engine
|
|
|
|
whirlpool_ctx_t ctx;
|
|
|
|
whirlpool_init (&ctx, s_Ch, s_Cl);
|
|
|
|
whirlpool_update (&ctx, w, pw_len);
|
|
|
|
whirlpool_final (&ctx);
|
|
|
|
const u32 r0 = ctx.h[DGST_R0];
|
|
const u32 r1 = ctx.h[DGST_R1];
|
|
const u32 r2 = ctx.h[DGST_R2];
|
|
const u32 r3 = ctx.h[DGST_R3];
|
|
|
|
COMPARE_S_SCALAR (r0, r1, r2, r3);
|
|
}
|
|
}
|