mirror of
https://github.com/VCMP-SqMod/SqMod.git
synced 2026-01-19 05:34:40 +01:00
Add a quick and simple implementation of base64 encryption and Whirpool hashing algorithm.
This commit is contained in:
76
include/b64.h
Normal file
76
include/b64.h
Normal file
@@ -0,0 +1,76 @@
|
||||
|
||||
/**
|
||||
* `b64.h' - b64
|
||||
*
|
||||
* copyright (c) 2014 joseph werle
|
||||
*/
|
||||
|
||||
#ifndef B64_H
|
||||
#define B64_H 1
|
||||
|
||||
/**
|
||||
* Memory allocation functions to use. You can define b64_malloc and
|
||||
* b64_realloc to custom functions if you want.
|
||||
*/
|
||||
|
||||
#ifndef b64_malloc
|
||||
# define b64_malloc(ptr) malloc(ptr)
|
||||
#endif
|
||||
#ifndef b64_realloc
|
||||
# define b64_realloc(ptr, size) realloc(ptr, size)
|
||||
#endif
|
||||
|
||||
/**
|
||||
* Base64 index table.
|
||||
*/
|
||||
|
||||
static const char b64_table[] = {
|
||||
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
|
||||
'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
|
||||
'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
|
||||
'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',
|
||||
'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
|
||||
'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
|
||||
'w', 'x', 'y', 'z', '0', '1', '2', '3',
|
||||
'4', '5', '6', '7', '8', '9', '+', '/'
|
||||
};
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/**
|
||||
* Encode `unsigned char *' source with `size_t' size.
|
||||
* Returns a `char *' base64 encoded string.
|
||||
*/
|
||||
|
||||
char *
|
||||
b64_encode (const unsigned char *, size_t);
|
||||
|
||||
/**
|
||||
* Encode `unsigned char *' source with `size_t' size.
|
||||
* Returns a `char *' base64 encoded string + size of encoded string.
|
||||
*/
|
||||
|
||||
char *
|
||||
b64_encode_ex (const unsigned char *, size_t, size_t *);
|
||||
|
||||
/**
|
||||
* Dencode `char *' source with `size_t' size.
|
||||
* Returns a `unsigned char *' base64 decoded string.
|
||||
*/
|
||||
unsigned char *
|
||||
b64_decode (const char *, size_t);
|
||||
|
||||
/**
|
||||
* Dencode `char *' source with `size_t' size.
|
||||
* Returns a `unsigned char *' base64 decoded string + size of decoded string.
|
||||
*/
|
||||
unsigned char *
|
||||
b64_decode_ex (const char *, size_t, size_t *);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
||||
34
include/whirlpool.h
Normal file
34
include/whirlpool.h
Normal file
@@ -0,0 +1,34 @@
|
||||
/* whirlpool.h */
|
||||
#ifndef WHIRLPOOL_H
|
||||
#define WHIRLPOOL_H
|
||||
#include "ustd.h"
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#define whirlpool_block_size 64
|
||||
|
||||
/* algorithm context */
|
||||
typedef struct whirlpool_ctx
|
||||
{
|
||||
uint64_t hash[8]; /* 512-bit algorithm internal hashing state */
|
||||
unsigned char message[whirlpool_block_size]; /* 512-bit buffer to hash */
|
||||
|
||||
/* Note: original algorith uses 256-bit counter, allowing to hash up to
|
||||
2^256 bits sized message. For optimization we use here 64-bit counter,
|
||||
thus reducing maximal message size to 2^64 bits = 2 Exbibytes = 2^21 TiB) */
|
||||
uint64_t length; /* number of processed bytes */
|
||||
} whirlpool_ctx;
|
||||
|
||||
/* hash functions */
|
||||
|
||||
void rhash_whirlpool_init(whirlpool_ctx* ctx);
|
||||
void rhash_whirlpool_update(whirlpool_ctx* ctx, const unsigned char* msg, size_t size);
|
||||
void rhash_whirlpool_final(whirlpool_ctx* ctx, unsigned char* result);
|
||||
|
||||
#ifdef __cplusplus
|
||||
} /* extern "C" */
|
||||
#endif /* __cplusplus */
|
||||
|
||||
#endif /* WHIRLPOOL_H */
|
||||
Reference in New Issue
Block a user