21.03.2013 Views

Problem - Kevin Tafuro

Problem - Kevin Tafuro

Problem - Kevin Tafuro

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

unsigned char b[SPC_KEY_SZ];<br />

size_t ix;<br />

size_t tl;<br />

} SPC_DM_CTX;<br />

void spc_dm_init(SPC_DM_CTX *c) {<br />

memset(c->h, 0x52, SPC_BLOCK_SZ);<br />

c->ix = 0;<br />

c->tl = 0;<br />

}<br />

static void spc_dm_once(SPC_DM_CTX *c, unsigned char b[SPC_KEY_SZ]) {<br />

int i;<br />

SPC_KEY_SCHED ks;<br />

unsigned char tmp[SPC_BLOCK_SZ];<br />

SPC_ENCRYPT_INIT(&ks, b, SPC_KEY_SZ);<br />

SPC_DO_ENCRYPT(&ks, c->h, tmp);<br />

for (i = 0; i < SPC_BLOCK_SZ / sizeof(int); i++)<br />

((int *)c->h)[i] ^= ((int *)tmp)[i];<br />

}<br />

void spc_dm_update(SPC_DM_CTX *c, unsigned char *t, size_t l) {<br />

c->tl += l; /* if c->tl < l: abort */<br />

while (c->ix && l) {<br />

c->b[c->ix++] = *t++;<br />

l--;<br />

if (!(c->ix %= SPC_KEY_SZ)) spc_dm_once(c, c->b);<br />

}<br />

while (l > SPC_KEY_SZ) {<br />

spc_dm_once(c, t);<br />

t += SPC_KEY_SZ;<br />

l -= SPC_KEY_SZ;<br />

}<br />

c->ix = l;<br />

for (l = 0; l < c->ix; l++) c->b[l] = *t++;<br />

}<br />

void spc_dm_final(SPC_DM_CTX *c, unsigned char output[SPC_BLOCK_SZ]) {<br />

int i;<br />

c->b[c->ix++] = 0x80;<br />

while (c->ix < SPC_KEY_SZ) c->b[c->ix++] = 0;<br />

spc_dm_once(c, c->b);<br />

memset(c->b, 0, SPC_KEY_SZ - sizeof(size_t));<br />

c->tl = htonl(c->tl);<br />

for (i = 0; i < sizeof(size_t); i++)<br />

c->b[SPC_KEY_SZ - sizeof(size_t) + i] = ((unsigned char *)(&c->tl))[i];<br />

spc_dm_once(c, c->b);<br />

memcpy(output, c->h, SPC_BLOCK_SZ);<br />

}<br />

Constructing a Hash Function from a Block Cipher | 293<br />

This is the Title of the Book, eMatter Edition<br />

Copyright © 2007 O’Reilly & Associates, Inc. All rights reserved.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!