SHA 알고리즘

목차

없음

본문내용

&lengthPad, 8L);
if (hash)
{
for (i = 0; i < SHA_HASH_WORDS; i++)
{
hash[0] = (uint8_t) (sc->hash[i] >> 24);
hash[1] = (uint8_t) (sc->hash[i] >> 16);
hash[2] = (uint8_t) (sc->hash[i] >> 8);
hash[3] = (uint8_t) sc->hash[i];
hash += 4;
}
}
}
/************************************************************************
Module Name : char *shaFile (char *name, FILE *fp)
Description : 각 파일의 체크섬을 구한다.
Argument :
PATH :
*************************************************************************/
char *shaFile (char *name, FILE *fp)
{
union {
SHAContext sha;
} s;
size_t len;
uint8_t hash[SHA_HASH_SIZE];
int hashLen, i;
static char Buffer[64];
memset (&s, 0, sizeof (s));
SHAInit (&s.sha);
while ((len = fread (buffer, 1, SHA_BUFFER_SIZE, fp)) > 0)
{
SHAUpdate (&s.sha, buffer, len);
}
SHAFinal (&s.sha, hash);
hashLen = SHA_HASH_SIZE;
memset(Buffer, 0x00, sizeof(Buffer));
for (i = 0; i < hashLen; i++)
{
snprintf(Buffer+strlen(Buffer), sizeof(Buffer)-strlen(Buffer), "
}
memset (&s, 0, sizeof (s));
return Buffer;
}
int main(int argc, char **argv)
{
FILE *fp;
long offs;
char result[512];
if (!(buffer = malloc (SHA_BUFFER_SIZE + 7)))
{
printf("integrity buffer memory malloc error\n");
exit(1);
}
if ((offs = (long) buffer & 7L))
{
buffer += 8 - offs;
}
memset (buffer, 0, SHA_BUFFER_SIZE);
if(argv[1] != NULL)
{
if ((fp = fopen (argv[1], "rb")))
{
memset(result, 0x00, sizeof(result));
sprintf(result, "
fclose (fp);
}
}
printf("Check Sum Result[
if(buffer)free(buffer);
}
@ SHA Processing

키워드

알고리즘,   SHA,   SHA알고리즘