HardenedBSD/crypto/openssh/deattack.c

166 lines
4.1 KiB
C
Raw Normal View History

2015-07-02 15:15:34 +02:00
/* $OpenBSD: deattack.c,v 1.32 2015/01/20 23:14:00 deraadt Exp $ */
2000-02-24 15:29:47 +01:00
/*
* Cryptographic attack detector for ssh - source code
*
* Copyright (c) 1998 CORE SDI S.A., Buenos Aires, Argentina.
*
* All rights reserved. Redistribution and use in source and binary
* forms, with or without modification, are permitted provided that
* this copyright notice is retained.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES ARE DISCLAIMED. IN NO EVENT SHALL CORE SDI S.A. BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY OR
* CONSEQUENTIAL DAMAGES RESULTING FROM THE USE OR MISUSE OF THIS
* SOFTWARE.
*
* Ariel Futoransky <futo@core-sdi.com>
* <http://www.core-sdi.com>
*/
#include "includes.h"
2002-03-18 10:55:03 +01:00
2006-09-30 15:29:51 +02:00
#include <string.h>
#include <stdio.h>
2015-07-02 15:15:34 +02:00
#include <stdlib.h>
2006-09-30 15:29:51 +02:00
2000-02-24 15:29:47 +01:00
#include "deattack.h"
#include "crc32.h"
2015-07-02 15:15:34 +02:00
#include "sshbuf.h"
2006-09-30 15:29:51 +02:00
#include "misc.h"
/*
* CRC attack detection has a worst-case behaviour that is O(N^3) over
* the number of identical blocks in a packet. This behaviour can be
* exploited to create a limited denial of service attack.
*
* However, because we are dealing with encrypted data, identical
* blocks should only occur every 2^35 maximally-sized packets or so.
* Consequently, we can detect this DoS by looking for identical blocks
* in a packet.
*
* The parameter below determines how many identical blocks we will
* accept in a single packet, trading off between attack detection and
* likelihood of terminating a legitimate connection. A value of 32
* corresponds to an average of 2^40 messages before an attack is
* misdetected
*/
#define MAX_IDENTICAL 32
2000-02-24 15:29:47 +01:00
/* SSH Constants */
#define SSH_MAXBLOCKS (32 * 1024)
#define SSH_BLOCKSIZE (8)
/* Hashing constants */
#define HASH_MINSIZE (8 * 1024)
#define HASH_ENTRYSIZE (2)
#define HASH_FACTOR(x) ((x)*3/2)
#define HASH_UNUSEDCHAR (0xff)
#define HASH_UNUSED (0xffff)
2002-03-18 10:55:03 +01:00
#define HASH_IV (0xfffe)
2000-02-24 15:29:47 +01:00
#define HASH_MINBLOCKS (7*SSH_BLOCKSIZE)
/* Hash function (Input keys are cipher results) */
2015-07-02 15:15:34 +02:00
#define HASH(x) PEEK_U32(x)
2000-02-24 15:29:47 +01:00
#define CMP(a, b) (memcmp(a, b, SSH_BLOCKSIZE))
2000-02-24 15:29:47 +01:00
2002-03-18 10:55:03 +01:00
static void
2000-02-24 15:29:47 +01:00
crc_update(u_int32_t *a, u_int32_t b)
{
b ^= *a;
2006-09-30 15:29:51 +02:00
*a = ssh_crc32((u_char *)&b, sizeof(b));
2000-02-24 15:29:47 +01:00
}
/* detect if a block is used in a particular pattern */
2002-03-18 10:55:03 +01:00
static int
2015-07-02 15:15:34 +02:00
check_crc(const u_char *S, const u_char *buf, u_int32_t len)
2000-02-24 15:29:47 +01:00
{
u_int32_t crc;
2015-07-02 15:15:34 +02:00
const u_char *c;
2000-02-24 15:29:47 +01:00
crc = 0;
for (c = buf; c < buf + len; c += SSH_BLOCKSIZE) {
if (!CMP(S, c)) {
crc_update(&crc, 1);
crc_update(&crc, 0);
} else {
crc_update(&crc, 0);
crc_update(&crc, 0);
}
}
2015-07-02 15:15:34 +02:00
return crc == 0;
2000-02-24 15:29:47 +01:00
}
2015-07-02 15:15:34 +02:00
void
deattack_init(struct deattack_ctx *dctx)
{
bzero(dctx, sizeof(*dctx));
dctx->n = HASH_MINSIZE / HASH_ENTRYSIZE;
}
2000-02-24 15:29:47 +01:00
/* Detect a crc32 compensation attack on a packet */
int
2015-07-02 15:15:34 +02:00
detect_attack(struct deattack_ctx *dctx, const u_char *buf, u_int32_t len)
2000-02-24 15:29:47 +01:00
{
2015-07-02 15:15:34 +02:00
u_int32_t i, j, l, same;
u_int16_t *tmp;
const u_char *c, *d;
2000-02-24 15:29:47 +01:00
if (len > (SSH_MAXBLOCKS * SSH_BLOCKSIZE) ||
2015-07-02 15:15:34 +02:00
len % SSH_BLOCKSIZE != 0)
return DEATTACK_ERROR;
for (l = dctx->n; l < HASH_FACTOR(len / SSH_BLOCKSIZE); l = l << 2)
2000-02-24 15:29:47 +01:00
;
2015-07-02 15:15:34 +02:00
if (dctx->h == NULL) {
if ((dctx->h = calloc(l, HASH_ENTRYSIZE)) == NULL)
return DEATTACK_ERROR;
dctx->n = l;
2000-02-24 15:29:47 +01:00
} else {
2015-07-02 15:15:34 +02:00
if (l > dctx->n) {
if ((tmp = reallocarray(dctx->h, l, HASH_ENTRYSIZE))
== NULL) {
free(dctx->h);
dctx->h = NULL;
return DEATTACK_ERROR;
}
dctx->h = tmp;
dctx->n = l;
2000-02-24 15:29:47 +01:00
}
}
if (len <= HASH_MINBLOCKS) {
for (c = buf; c < buf + len; c += SSH_BLOCKSIZE) {
for (d = buf; d < c; d += SSH_BLOCKSIZE) {
if (!CMP(c, d)) {
2006-09-30 15:29:51 +02:00
if ((check_crc(c, buf, len)))
2015-07-02 15:15:34 +02:00
return DEATTACK_DETECTED;
2000-02-24 15:29:47 +01:00
else
break;
}
}
}
2015-07-02 15:15:34 +02:00
return DEATTACK_OK;
2000-02-24 15:29:47 +01:00
}
2015-07-02 15:15:34 +02:00
memset(dctx->h, HASH_UNUSEDCHAR, dctx->n * HASH_ENTRYSIZE);
2000-02-24 15:29:47 +01:00
2006-09-30 15:29:51 +02:00
for (c = buf, same = j = 0; c < (buf + len); c += SSH_BLOCKSIZE, j++) {
2015-07-02 15:15:34 +02:00
for (i = HASH(c) & (dctx->n - 1); dctx->h[i] != HASH_UNUSED;
i = (i + 1) & (dctx->n - 1)) {
if (!CMP(c, buf + dctx->h[i] * SSH_BLOCKSIZE)) {
2006-09-30 15:29:51 +02:00
if (++same > MAX_IDENTICAL)
2015-07-02 15:15:34 +02:00
return DEATTACK_DOS_DETECTED;
2006-09-30 15:29:51 +02:00
if (check_crc(c, buf, len))
2015-07-02 15:15:34 +02:00
return DEATTACK_DETECTED;
2000-02-24 15:29:47 +01:00
else
break;
}
}
2015-07-02 15:15:34 +02:00
dctx->h[i] = j;
2000-02-24 15:29:47 +01:00
}
2015-07-02 15:15:34 +02:00
return DEATTACK_OK;
2000-02-24 15:29:47 +01:00
}