mirror of https://github.com/OISF/suricata
tls: adding cryptographic functions.
Adding util-crypt containing cryptographic functions as SHA1 and Base64.pull/32/head
Jean-Paul Roliers
14 years ago
committed by
Eric Leblond
parent
efdf96ccba
commit
9071bcf983
@ -0,0 +1,271 @@
|
||||
/* Copyright (C) 2007-2012 Open Information Security Foundation
|
||||
*
|
||||
* You can copy, redistribute or modify this Program under the terms of
|
||||
* the GNU General Public License version 2 as published by the Free
|
||||
* Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* version 2 along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
||||
* 02110-1301, USA.
|
||||
*/
|
||||
|
||||
/**
|
||||
* \file
|
||||
*
|
||||
* \author Roliers Jean-Paul <popof.fpn@gmail.co>
|
||||
*
|
||||
* Implements cryptographic functions.
|
||||
* Based on the libtomcrypt library ( http://libtom.org/?page=features&newsitems=5&whatfile=crypt )
|
||||
*/
|
||||
|
||||
#include "util-crypt.h"
|
||||
|
||||
#define F0(x,y,z) (z ^ (x & (y ^ z)))
|
||||
#define F1(x,y,z) (x ^ y ^ z)
|
||||
#define F2(x,y,z) ((x & y) | (z & (x | y)))
|
||||
#define F3(x,y,z) (x ^ y ^ z)
|
||||
|
||||
|
||||
static int Sha1Compress(HashState *md, unsigned char *buf)
|
||||
{
|
||||
uint32_t a,b,c,d,e,W[80],i;
|
||||
/* copy the state into 512-bits into W[0..15] */
|
||||
for (i = 0; i < 16; i++) {
|
||||
LOAD32H(W[i], buf + (4*i));
|
||||
}
|
||||
|
||||
/* copy state */
|
||||
a = md->sha1.state[0];
|
||||
b = md->sha1.state[1];
|
||||
c = md->sha1.state[2];
|
||||
d = md->sha1.state[3];
|
||||
e = md->sha1.state[4];
|
||||
|
||||
/* expand it */
|
||||
for (i = 16; i < 80; i++) {
|
||||
W[i] = ROL(W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16], 1);
|
||||
}
|
||||
|
||||
/* compress */
|
||||
/* round one */
|
||||
#define FF0(a,b,c,d,e,i) e = (ROLc(a, 5) + F0(b,c,d) + e + W[i] + 0x5a827999UL); b = ROLc(b, 30);
|
||||
#define FF1(a,b,c,d,e,i) e = (ROLc(a, 5) + F1(b,c,d) + e + W[i] + 0x6ed9eba1UL); b = ROLc(b, 30);
|
||||
#define FF2(a,b,c,d,e,i) e = (ROLc(a, 5) + F2(b,c,d) + e + W[i] + 0x8f1bbcdcUL); b = ROLc(b, 30);
|
||||
#define FF3(a,b,c,d,e,i) e = (ROLc(a, 5) + F3(b,c,d) + e + W[i] + 0xca62c1d6UL); b = ROLc(b, 30);
|
||||
|
||||
for (i = 0; i < 20; ) {
|
||||
FF0(a,b,c,d,e,i++);
|
||||
FF0(e,a,b,c,d,i++);
|
||||
FF0(d,e,a,b,c,i++);
|
||||
FF0(c,d,e,a,b,i++);
|
||||
FF0(b,c,d,e,a,i++);
|
||||
}
|
||||
|
||||
/* round two */
|
||||
for (; i < 40; ) {
|
||||
FF1(a,b,c,d,e,i++);
|
||||
FF1(e,a,b,c,d,i++);
|
||||
FF1(d,e,a,b,c,i++);
|
||||
FF1(c,d,e,a,b,i++);
|
||||
FF1(b,c,d,e,a,i++);
|
||||
}
|
||||
|
||||
/* round three */
|
||||
for (; i < 60; ) {
|
||||
FF2(a,b,c,d,e,i++);
|
||||
FF2(e,a,b,c,d,i++);
|
||||
FF2(d,e,a,b,c,i++);
|
||||
FF2(c,d,e,a,b,i++);
|
||||
FF2(b,c,d,e,a,i++);
|
||||
}
|
||||
|
||||
/* round four */
|
||||
for (; i < 80; ) {
|
||||
FF3(a,b,c,d,e,i++);
|
||||
FF3(e,a,b,c,d,i++);
|
||||
FF3(d,e,a,b,c,i++);
|
||||
FF3(c,d,e,a,b,i++);
|
||||
FF3(b,c,d,e,a,i++);
|
||||
}
|
||||
|
||||
#undef FF0
|
||||
#undef FF1
|
||||
#undef FF2
|
||||
#undef FF3
|
||||
|
||||
/* store */
|
||||
md->sha1.state[0] = md->sha1.state[0] + a;
|
||||
md->sha1.state[1] = md->sha1.state[1] + b;
|
||||
md->sha1.state[2] = md->sha1.state[2] + c;
|
||||
md->sha1.state[3] = md->sha1.state[3] + d;
|
||||
md->sha1.state[4] = md->sha1.state[4] + e;
|
||||
|
||||
return SC_SHA_1_OK;
|
||||
}
|
||||
|
||||
static int Sha1Init(HashState * md)
|
||||
{
|
||||
if(md == NULL)
|
||||
{
|
||||
return SC_SHA_1_NOK;
|
||||
}
|
||||
md->sha1.state[0] = 0x67452301UL;
|
||||
md->sha1.state[1] = 0xefcdab89UL;
|
||||
md->sha1.state[2] = 0x98badcfeUL;
|
||||
md->sha1.state[3] = 0x10325476UL;
|
||||
md->sha1.state[4] = 0xc3d2e1f0UL;
|
||||
md->sha1.curlen = 0;
|
||||
md->sha1.length = 0;
|
||||
return SC_SHA_1_OK;
|
||||
}
|
||||
|
||||
static int Sha1Process (HashState * md, const unsigned char *in, unsigned long inlen)
|
||||
{
|
||||
if(md == NULL || in == NULL) {
|
||||
return SC_SHA_1_INVALID_ARG;
|
||||
}
|
||||
|
||||
unsigned long n;
|
||||
int err;
|
||||
|
||||
if (md->sha1.curlen > sizeof(md->sha1.buf)) {
|
||||
return SC_SHA_1_INVALID_ARG;
|
||||
}
|
||||
while (inlen > 0) {
|
||||
if (md-> sha1.curlen == 0 && inlen >= 64) {
|
||||
if ((err = Sha1Compress(md, (unsigned char *)in)) != SC_SHA_1_OK) {
|
||||
return err;
|
||||
}
|
||||
md-> sha1 .length += 64 * 8;
|
||||
in += 64;
|
||||
inlen -= 64;
|
||||
} else {
|
||||
n = MIN(inlen, (64 - md-> sha1 .curlen));
|
||||
memcpy(md-> sha1 .buf + md-> sha1.curlen, in, (size_t)n);
|
||||
md-> sha1 .curlen += n;
|
||||
in += n;
|
||||
inlen -= n;
|
||||
if (md-> sha1 .curlen == 64) {
|
||||
if ((err = Sha1Compress(md, md-> sha1 .buf)) != SC_SHA_1_OK) {
|
||||
return err;
|
||||
}
|
||||
md-> sha1 .length += 8*64;
|
||||
md-> sha1 .curlen = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
return SC_SHA_1_OK;
|
||||
}
|
||||
|
||||
|
||||
|
||||
static int Sha1Done(HashState * md, unsigned char *out)
|
||||
{
|
||||
int i;
|
||||
|
||||
if (md == NULL || out == NULL)
|
||||
{
|
||||
return SC_SHA_1_NOK;
|
||||
}
|
||||
|
||||
if (md->sha1.curlen >= sizeof(md->sha1.buf)) {
|
||||
return SC_SHA_1_INVALID_ARG;
|
||||
}
|
||||
|
||||
/* increase the length of the message */
|
||||
md->sha1.length += md->sha1.curlen * 8;
|
||||
|
||||
/* append the '1' bit */
|
||||
md->sha1.buf[md->sha1.curlen++] = (unsigned char)0x80;
|
||||
|
||||
/* if the length is currently above 56 bytes we append zeros
|
||||
* then compress. Then we can fall back to padding zeros and length
|
||||
* encoding like normal.
|
||||
*/
|
||||
if (md->sha1.curlen > 56) {
|
||||
while (md->sha1.curlen < 64) {
|
||||
md->sha1.buf[md->sha1.curlen++] = (unsigned char)0;
|
||||
}
|
||||
Sha1Compress(md, md->sha1.buf);
|
||||
md->sha1.curlen = 0;
|
||||
}
|
||||
|
||||
/* pad upto 56 bytes of zeroes */
|
||||
while (md->sha1.curlen < 56) {
|
||||
md->sha1.buf[md->sha1.curlen++] = (unsigned char)0;
|
||||
}
|
||||
|
||||
/* store length */
|
||||
STORE64H(md->sha1.length, md->sha1.buf+56);
|
||||
Sha1Compress(md, md->sha1.buf);
|
||||
|
||||
/* copy output */
|
||||
for (i = 0; i < 5; i++) {
|
||||
STORE32H(md->sha1.state[i], out+(4*i));
|
||||
}
|
||||
|
||||
memset(md, 0, sizeof(HashState));
|
||||
|
||||
return SC_SHA_1_OK;
|
||||
}
|
||||
|
||||
unsigned char* ComputeSHA1(unsigned char* buff, int bufflen)
|
||||
{
|
||||
HashState md;
|
||||
unsigned char* lResult = (unsigned char*) SCMalloc((sizeof(unsigned char) * 20));
|
||||
if (lResult == NULL)
|
||||
return NULL;
|
||||
Sha1Init(&md);
|
||||
Sha1Process(&md, buff, bufflen);
|
||||
Sha1Done(&md, lResult);
|
||||
return lResult;
|
||||
}
|
||||
|
||||
static const char *b64codes = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
||||
|
||||
int Base64Encode(const unsigned char *in, unsigned long inlen,
|
||||
unsigned char *out, unsigned long *outlen)
|
||||
{
|
||||
unsigned long i, len2, leven;
|
||||
unsigned char *p;
|
||||
if(in == NULL || out == NULL || outlen == NULL)
|
||||
{
|
||||
return SC_BASE64_INVALID_ARG;
|
||||
}
|
||||
/* valid output size ? */
|
||||
len2 = 4 * ((inlen + 2) / 3);
|
||||
if (*outlen < len2 + 1) {
|
||||
*outlen = len2 + 1;
|
||||
return SC_BASE64_OVERFLOW;
|
||||
}
|
||||
p = out;
|
||||
leven = 3*(inlen / 3);
|
||||
for (i = 0; i < leven; i += 3) {
|
||||
*p++ = b64codes[(in[0] >> 2) & 0x3F];
|
||||
*p++ = b64codes[(((in[0] & 3) << 4) + (in[1] >> 4)) & 0x3F];
|
||||
*p++ = b64codes[(((in[1] & 0xf) << 2) + (in[2] >> 6)) & 0x3F];
|
||||
*p++ = b64codes[in[2] & 0x3F];
|
||||
in += 3;
|
||||
}
|
||||
/* Pad it if necessary... */
|
||||
if (i < inlen) {
|
||||
unsigned a = in[0];
|
||||
unsigned b = (i+1 < inlen) ? in[1] : 0;
|
||||
|
||||
*p++ = b64codes[(a >> 2) & 0x3F];
|
||||
*p++ = b64codes[(((a & 3) << 4) + (b >> 4)) & 0x3F];
|
||||
*p++ = (i+1 < inlen) ? b64codes[(((b & 0xf) << 2)) & 0x3F] : '=';
|
||||
*p++ = '=';
|
||||
}
|
||||
/* append a NULL byte */
|
||||
*p = '\0';
|
||||
/* return ok */
|
||||
*outlen = p - out;
|
||||
return SC_BASE64_OK;
|
||||
}
|
||||
@ -0,0 +1,78 @@
|
||||
/* Copyright (C) 2007-2012 Open Information Security Foundation
|
||||
*
|
||||
* You can copy, redistribute or modify this Program under the terms of
|
||||
* the GNU General Public License version 2 as published by the Free
|
||||
* Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* version 2 along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
||||
* 02110-1301, USA.
|
||||
*/
|
||||
|
||||
/**
|
||||
* \file
|
||||
*
|
||||
* \author Roliers Jean-Paul <popof.fpn@gmail.co>
|
||||
*
|
||||
* Implements cryptographic functions.
|
||||
* Based on the libtomcrypt library ( http://libtom.org/?page=features&newsitems=5&whatfile=crypt )
|
||||
*/
|
||||
|
||||
#ifndef UTIL_CRYPT_H_
|
||||
#define UTIL_CRYPT_H_
|
||||
|
||||
#include "suricata-common.h"
|
||||
|
||||
#define LOAD32H(x, y) \
|
||||
{ x = ((unsigned long)((y)[0] & 255)<<24) | \
|
||||
((unsigned long)((y)[1] & 255)<<16) | \
|
||||
((unsigned long)((y)[2] & 255)<<8) | \
|
||||
((unsigned long)((y)[3] & 255)); }
|
||||
|
||||
#define STORE64H(x, y) \
|
||||
{ (y)[0] = (unsigned char)(((x)>>56)&255); (y)[1] = (unsigned char)(((x)>>48)&255); \
|
||||
(y)[2] = (unsigned char)(((x)>>40)&255); (y)[3] = (unsigned char)(((x)>>32)&255); \
|
||||
(y)[4] = (unsigned char)(((x)>>24)&255); (y)[5] = (unsigned char)(((x)>>16)&255); \
|
||||
(y)[6] = (unsigned char)(((x)>>8)&255); (y)[7] = (unsigned char)((x)&255); }
|
||||
|
||||
#define STORE32H(x, y) \
|
||||
{ (y)[0] = (unsigned char)(((x)>>24)&255); (y)[1] = (unsigned char)(((x)>>16)&255); \
|
||||
(y)[2] = (unsigned char)(((x)>>8)&255); (y)[3] = (unsigned char)((x)&255); }
|
||||
|
||||
#define ROL(x, y) ( (((unsigned long)(x)<<(unsigned long)((y)&31)) | (((unsigned long)(x)&0xFFFFFFFFUL)>>(unsigned long)(32-((y)&31)))) & 0xFFFFFFFFUL)
|
||||
#define ROLc(x, y) ( (((unsigned long)(x)<<(unsigned long)((y)&31)) | (((unsigned long)(x)&0xFFFFFFFFUL)>>(unsigned long)(32-((y)&31)))) & 0xFFFFFFFFUL)
|
||||
#define MIN(x, y) ( ((x)<(y))?(x):(y) )
|
||||
|
||||
typedef enum {
|
||||
SC_SHA_1_OK,
|
||||
SC_SHA_1_NOK,
|
||||
SC_SHA_1_INVALID_ARG,
|
||||
|
||||
SC_BASE64_OK,
|
||||
SC_BASE64_INVALID_ARG,
|
||||
SC_BASE64_OVERFLOW,
|
||||
|
||||
} CryptId;
|
||||
|
||||
typedef struct Sha1State_ {
|
||||
uint64_t length;
|
||||
uint32_t state[5], curlen;
|
||||
unsigned char buf[64];
|
||||
} Sha1State;
|
||||
|
||||
typedef union HashState_ {
|
||||
char dummy[1];
|
||||
Sha1State sha1;
|
||||
void *data;
|
||||
} HashState;
|
||||
|
||||
unsigned char* ComputeSHA1(unsigned char* buff, int bufflen);
|
||||
int Base64Encode(const unsigned char *in, unsigned long inlen, unsigned char *out, unsigned long *outlen);
|
||||
|
||||
#endif /* UTIL_CRYPT_H_ */
|
||||
Loading…
Reference in New Issue