2000-07-04 16:35:15 +00:00
|
|
|
/* $FreeBSD$ */
|
2001-06-11 12:39:29 +00:00
|
|
|
/* $KAME: esp_core.c,v 1.50 2000/11/02 12:27:38 itojun Exp $ */
|
2000-07-04 16:35:15 +00:00
|
|
|
|
1999-12-22 19:13:38 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the name of the project nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
#include "opt_inet.h"
|
1999-12-22 19:13:38 +00:00
|
|
|
#include "opt_inet6.h"
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
2001-06-11 12:39:29 +00:00
|
|
|
#include <sys/malloc.h>
|
1999-12-22 19:13:38 +00:00
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/domain.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/time.h>
|
2000-07-04 16:35:15 +00:00
|
|
|
#include <sys/syslog.h>
|
1999-12-22 19:13:38 +00:00
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_var.h>
|
|
|
|
#ifdef INET6
|
2000-07-04 16:35:15 +00:00
|
|
|
#include <netinet/ip6.h>
|
1999-12-22 19:13:38 +00:00
|
|
|
#include <netinet6/ip6_var.h>
|
2000-07-04 16:35:15 +00:00
|
|
|
#include <netinet/icmp6.h>
|
1999-12-22 19:13:38 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <netinet6/ipsec.h>
|
|
|
|
#ifdef INET6
|
|
|
|
#include <netinet6/ipsec6.h>
|
2000-07-04 16:35:15 +00:00
|
|
|
#endif
|
|
|
|
#include <netinet6/ah.h>
|
|
|
|
#ifdef INET6
|
1999-12-22 19:13:38 +00:00
|
|
|
#include <netinet6/ah6.h>
|
|
|
|
#endif
|
|
|
|
#include <netinet6/esp.h>
|
|
|
|
#ifdef INET6
|
|
|
|
#include <netinet6/esp6.h>
|
|
|
|
#endif
|
2001-06-11 12:39:29 +00:00
|
|
|
#include <netinet6/esp_rijndael.h>
|
1999-12-22 19:13:38 +00:00
|
|
|
#include <net/pfkeyv2.h>
|
|
|
|
#include <netkey/keydb.h>
|
2001-06-11 12:39:29 +00:00
|
|
|
#include <netkey/key.h>
|
1999-12-22 19:13:38 +00:00
|
|
|
#include <crypto/des/des.h>
|
|
|
|
#include <crypto/blowfish/blowfish.h>
|
|
|
|
#include <crypto/cast128/cast128.h>
|
|
|
|
|
|
|
|
#include <net/net_osdep.h>
|
|
|
|
|
|
|
|
static int esp_null_mature __P((struct secasvar *));
|
|
|
|
static int esp_null_decrypt __P((struct mbuf *, size_t,
|
2001-06-11 12:39:29 +00:00
|
|
|
struct secasvar *, const struct esp_algorithm *, int));
|
1999-12-22 19:13:38 +00:00
|
|
|
static int esp_null_encrypt __P((struct mbuf *, size_t, size_t,
|
2001-06-11 12:39:29 +00:00
|
|
|
struct secasvar *, const struct esp_algorithm *, int));
|
1999-12-22 19:13:38 +00:00
|
|
|
static int esp_descbc_mature __P((struct secasvar *));
|
2001-06-11 12:39:29 +00:00
|
|
|
static int esp_descbc_ivlen __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *));
|
|
|
|
static int esp_des_schedule __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *));
|
|
|
|
static int esp_des_schedlen __P((const struct esp_algorithm *));
|
|
|
|
static int esp_des_blockdecrypt __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *, u_int8_t *, u_int8_t *));
|
|
|
|
static int esp_des_blockencrypt __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *, u_int8_t *, u_int8_t *));
|
1999-12-22 19:13:38 +00:00
|
|
|
static int esp_cbc_mature __P((struct secasvar *));
|
2001-06-11 12:39:29 +00:00
|
|
|
static int esp_blowfish_schedule __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *));
|
|
|
|
static int esp_blowfish_schedlen __P((const struct esp_algorithm *));
|
|
|
|
static int esp_blowfish_blockdecrypt __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *, u_int8_t *, u_int8_t *));
|
|
|
|
static int esp_blowfish_blockencrypt __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *, u_int8_t *, u_int8_t *));
|
|
|
|
static int esp_cast128_schedule __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *));
|
|
|
|
static int esp_cast128_schedlen __P((const struct esp_algorithm *));
|
|
|
|
static int esp_cast128_blockdecrypt __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *, u_int8_t *, u_int8_t *));
|
|
|
|
static int esp_cast128_blockencrypt __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *, u_int8_t *, u_int8_t *));
|
|
|
|
static int esp_3des_schedule __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *));
|
|
|
|
static int esp_3des_schedlen __P((const struct esp_algorithm *));
|
|
|
|
static int esp_3des_blockdecrypt __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *, u_int8_t *, u_int8_t *));
|
|
|
|
static int esp_3des_blockencrypt __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *, u_int8_t *, u_int8_t *));
|
|
|
|
static int esp_common_ivlen __P((const struct esp_algorithm *,
|
|
|
|
struct secasvar *));
|
|
|
|
static int esp_cbc_decrypt __P((struct mbuf *, size_t,
|
|
|
|
struct secasvar *, const struct esp_algorithm *, int));
|
|
|
|
static int esp_cbc_encrypt __P((struct mbuf *, size_t, size_t,
|
|
|
|
struct secasvar *, const struct esp_algorithm *, int));
|
|
|
|
|
|
|
|
#define MAXIVLEN 16
|
|
|
|
|
|
|
|
static const struct esp_algorithm esp_algorithms[] = {
|
|
|
|
{ 8, -1, esp_descbc_mature, 64, 64, esp_des_schedlen,
|
|
|
|
"des-cbc",
|
|
|
|
esp_descbc_ivlen, esp_cbc_decrypt,
|
|
|
|
esp_cbc_encrypt, esp_des_schedule,
|
|
|
|
esp_des_blockdecrypt, esp_des_blockencrypt, },
|
|
|
|
{ 8, 8, esp_cbc_mature, 192, 192, esp_3des_schedlen,
|
|
|
|
"3des-cbc",
|
|
|
|
esp_common_ivlen, esp_cbc_decrypt,
|
|
|
|
esp_cbc_encrypt, esp_3des_schedule,
|
|
|
|
esp_3des_blockdecrypt, esp_3des_blockencrypt, },
|
|
|
|
{ 1, 0, esp_null_mature, 0, 2048, 0, "null",
|
|
|
|
esp_common_ivlen, esp_null_decrypt,
|
|
|
|
esp_null_encrypt, NULL, },
|
|
|
|
{ 8, 8, esp_cbc_mature, 40, 448, esp_blowfish_schedlen, "blowfish-cbc",
|
|
|
|
esp_common_ivlen, esp_cbc_decrypt,
|
|
|
|
esp_cbc_encrypt, esp_blowfish_schedule,
|
|
|
|
esp_blowfish_blockdecrypt, esp_blowfish_blockencrypt, },
|
|
|
|
{ 8, 8, esp_cbc_mature, 40, 128, esp_cast128_schedlen,
|
|
|
|
"cast128-cbc",
|
|
|
|
esp_common_ivlen, esp_cbc_decrypt,
|
|
|
|
esp_cbc_encrypt, esp_cast128_schedule,
|
|
|
|
esp_cast128_blockdecrypt, esp_cast128_blockencrypt, },
|
|
|
|
{ 16, 16, esp_cbc_mature, 128, 256, esp_rijndael_schedlen,
|
|
|
|
"rijndael-cbc",
|
|
|
|
esp_common_ivlen, esp_cbc_decrypt,
|
|
|
|
esp_cbc_encrypt, esp_rijndael_schedule,
|
|
|
|
esp_rijndael_blockdecrypt, esp_rijndael_blockencrypt },
|
1999-12-22 19:13:38 +00:00
|
|
|
};
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
const struct esp_algorithm *
|
|
|
|
esp_algorithm_lookup(idx)
|
|
|
|
int idx;
|
|
|
|
{
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
switch (idx) {
|
|
|
|
case SADB_EALG_DESCBC:
|
|
|
|
return &esp_algorithms[0];
|
|
|
|
case SADB_EALG_3DESCBC:
|
|
|
|
return &esp_algorithms[1];
|
|
|
|
case SADB_EALG_NULL:
|
|
|
|
return &esp_algorithms[2];
|
|
|
|
case SADB_X_EALG_BLOWFISHCBC:
|
|
|
|
return &esp_algorithms[3];
|
|
|
|
case SADB_X_EALG_CAST128CBC:
|
|
|
|
return &esp_algorithms[4];
|
|
|
|
case SADB_X_EALG_RIJNDAELCBC:
|
|
|
|
return &esp_algorithms[5];
|
|
|
|
default:
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
esp_max_ivlen()
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
int ivlen;
|
|
|
|
|
|
|
|
ivlen = 0;
|
|
|
|
for (idx = 0; idx < sizeof(esp_algorithms)/sizeof(esp_algorithms[0]);
|
|
|
|
idx++) {
|
|
|
|
if (esp_algorithms[idx].ivlenval > ivlen)
|
|
|
|
ivlen = esp_algorithms[idx].ivlenval;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ivlen;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
esp_schedule(algo, sav)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
int error;
|
|
|
|
|
|
|
|
/* check for key length */
|
|
|
|
if (_KEYBITS(sav->key_enc) < algo->keymin ||
|
|
|
|
_KEYBITS(sav->key_enc) > algo->keymax) {
|
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_schedule %s: unsupported key length %d: "
|
|
|
|
"needs %d to %d bits\n", algo->name, _KEYBITS(sav->key_enc),
|
|
|
|
algo->keymin, algo->keymax));
|
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* already allocated */
|
|
|
|
if (sav->sched && sav->schedlen != 0)
|
|
|
|
return 0;
|
|
|
|
/* no schedule necessary */
|
|
|
|
if (!algo->schedule || !algo->schedlen)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
sav->schedlen = (*algo->schedlen)(algo);
|
|
|
|
if (sav->schedlen < 0)
|
|
|
|
return EINVAL;
|
|
|
|
sav->sched = malloc(sav->schedlen, M_SECA, M_DONTWAIT);
|
|
|
|
if (!sav->sched) {
|
|
|
|
sav->schedlen = 0;
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = (*algo->schedule)(algo, sav);
|
|
|
|
if (error) {
|
|
|
|
ipseclog((LOG_ERR, "esp_schedule %s: error %d\n",
|
|
|
|
algo->name, error));
|
|
|
|
free(sav->sched, M_SECA);
|
|
|
|
sav->sched = NULL;
|
|
|
|
sav->schedlen = 0;
|
|
|
|
}
|
|
|
|
return error;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_null_mature(sav)
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
/* anything is okay */
|
1999-12-22 19:13:38 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
esp_null_decrypt(m, off, sav, algo, ivlen)
|
|
|
|
struct mbuf *m;
|
|
|
|
size_t off; /* offset to ESP header */
|
|
|
|
struct secasvar *sav;
|
2001-06-11 12:39:29 +00:00
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
int ivlen;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
|
1999-12-22 19:13:38 +00:00
|
|
|
return 0; /* do nothing */
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
esp_null_encrypt(m, off, plen, sav, algo, ivlen)
|
|
|
|
struct mbuf *m;
|
|
|
|
size_t off; /* offset to ESP header */
|
|
|
|
size_t plen; /* payload length (to be encrypted) */
|
|
|
|
struct secasvar *sav;
|
2001-06-11 12:39:29 +00:00
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
int ivlen;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
|
1999-12-22 19:13:38 +00:00
|
|
|
return 0; /* do nothing */
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
esp_descbc_mature(sav)
|
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
|
|
|
if (!(sav->flags & SADB_X_EXT_OLD) && (sav->flags & SADB_X_EXT_IV4B)) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR, "esp_cbc_mature: "
|
|
|
|
"algorithm incompatible with 4 octets IV length\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!sav->key_enc) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR, "esp_descbc_mature: no key is given.\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
algo = esp_algorithm_lookup(sav->alg_enc);
|
|
|
|
if (!algo) {
|
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_descbc_mature: unsupported algorithm.\n"));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (_KEYBITS(sav->key_enc) < algo->keymin ||
|
|
|
|
_KEYBITS(sav->key_enc) > algo->keymax) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_descbc_mature: invalid key length %d.\n",
|
|
|
|
_KEYBITS(sav->key_enc)));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* weak key check */
|
2001-06-11 12:39:29 +00:00
|
|
|
if (des_is_weak_key((des_cblock *)_KEYBUF(sav->key_enc))) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_descbc_mature: weak key was passed.\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_descbc_ivlen(algo, sav)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
if (!sav)
|
1999-12-22 19:13:38 +00:00
|
|
|
return 8;
|
2001-06-11 12:39:29 +00:00
|
|
|
if ((sav->flags & SADB_X_EXT_OLD) && (sav->flags & SADB_X_EXT_IV4B))
|
|
|
|
return 4;
|
|
|
|
if (!(sav->flags & SADB_X_EXT_OLD) && (sav->flags & SADB_X_EXT_DERIV))
|
|
|
|
return 4;
|
|
|
|
return 8;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_des_schedlen(algo)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
{
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
return sizeof(des_key_schedule);
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_des_schedule(algo, sav)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
if (des_key_sched((des_cblock *)_KEYBUF(sav->key_enc),
|
|
|
|
*(des_key_schedule *)sav->sched))
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
2001-06-11 12:39:29 +00:00
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
static int
|
|
|
|
esp_des_blockdecrypt(algo, sav, s, d)
|
|
|
|
const struct esp_algorithm *algo;
|
|
|
|
struct secasvar *sav;
|
|
|
|
u_int8_t *s;
|
|
|
|
u_int8_t *d;
|
|
|
|
{
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* assumption: d has a good alignment */
|
|
|
|
bcopy(s, d, sizeof(DES_LONG) * 2);
|
|
|
|
des_ecb_encrypt((des_cblock *)d, (des_cblock *)d,
|
|
|
|
*(des_key_schedule *)sav->sched, DES_DECRYPT);
|
|
|
|
return 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
static int
|
|
|
|
esp_des_blockencrypt(algo, sav, s, d)
|
|
|
|
const struct esp_algorithm *algo;
|
|
|
|
struct secasvar *sav;
|
|
|
|
u_int8_t *s;
|
|
|
|
u_int8_t *d;
|
|
|
|
{
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* assumption: d has a good alignment */
|
|
|
|
bcopy(s, d, sizeof(DES_LONG) * 2);
|
|
|
|
des_ecb_encrypt((des_cblock *)d, (des_cblock *)d,
|
|
|
|
*(des_key_schedule *)sav->sched, DES_ENCRYPT);
|
|
|
|
return 0;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
esp_cbc_mature(sav)
|
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
|
|
|
int keylen;
|
2001-06-11 12:39:29 +00:00
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
|
|
|
if (sav->flags & SADB_X_EXT_OLD) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_cbc_mature: algorithm incompatible with esp-old\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if (sav->flags & SADB_X_EXT_DERIV) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_cbc_mature: algorithm incompatible with derived\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!sav->key_enc) {
|
2001-06-11 12:39:29 +00:00
|
|
|
ipseclog((LOG_ERR, "esp_cbc_mature: no key is given.\n"));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
algo = esp_algorithm_lookup(sav->alg_enc);
|
|
|
|
if (!algo) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR,
|
2001-06-11 12:39:29 +00:00
|
|
|
"esp_cbc_mature %s: unsupported algorithm.\n", algo->name));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
1999-12-22 19:13:38 +00:00
|
|
|
keylen = sav->key_enc->sadb_key_bits;
|
|
|
|
if (keylen < algo->keymin || algo->keymax < keylen) {
|
2001-06-11 12:39:29 +00:00
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_cbc_mature %s: invalid key length %d.\n",
|
|
|
|
algo->name, sav->key_enc->sadb_key_bits));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
switch (sav->alg_enc) {
|
|
|
|
case SADB_EALG_3DESCBC:
|
|
|
|
/* weak key check */
|
2001-06-11 12:39:29 +00:00
|
|
|
if (des_is_weak_key((des_cblock *)_KEYBUF(sav->key_enc)) ||
|
|
|
|
des_is_weak_key((des_cblock *)(_KEYBUF(sav->key_enc) + 8)) ||
|
|
|
|
des_is_weak_key((des_cblock *)(_KEYBUF(sav->key_enc) + 16))) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR,
|
2001-06-11 12:39:29 +00:00
|
|
|
"esp_cbc_mature %s: weak key was passed.\n",
|
|
|
|
algo->name));
|
1999-12-22 19:13:38 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
break;
|
2001-06-11 12:39:29 +00:00
|
|
|
case SADB_X_EALG_BLOWFISHCBC:
|
|
|
|
case SADB_X_EALG_CAST128CBC:
|
|
|
|
break;
|
|
|
|
case SADB_X_EALG_RIJNDAELCBC:
|
|
|
|
/* allows specific key sizes only */
|
|
|
|
if (!(keylen == 128 || keylen == 192 || keylen == 256)) {
|
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_cbc_mature %s: invalid key length %d.\n",
|
|
|
|
algo->name, keylen));
|
|
|
|
return 1;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_blowfish_schedlen(algo)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
{
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
return sizeof(BF_KEY);
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_blowfish_schedule(algo, sav)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
BF_set_key((BF_KEY *)sav->sched, _KEYLEN(sav->key_enc),
|
|
|
|
_KEYBUF(sav->key_enc));
|
|
|
|
return 0;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_blowfish_blockdecrypt(algo, sav, s, d)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
2001-06-11 12:39:29 +00:00
|
|
|
u_int8_t *s;
|
|
|
|
u_int8_t *d;
|
1999-12-22 19:13:38 +00:00
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
/* HOLY COW! BF_encrypt() takes values in host byteorder */
|
|
|
|
BF_LONG t[2];
|
|
|
|
|
|
|
|
bcopy(s, t, sizeof(t));
|
|
|
|
t[0] = ntohl(t[0]);
|
|
|
|
t[1] = ntohl(t[1]);
|
|
|
|
BF_encrypt(t, (BF_KEY *)sav->sched, BF_DECRYPT);
|
|
|
|
t[0] = htonl(t[0]);
|
|
|
|
t[1] = htonl(t[1]);
|
|
|
|
bcopy(t, d, sizeof(t));
|
|
|
|
return 0;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_blowfish_blockencrypt(algo, sav, s, d)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
2001-06-11 12:39:29 +00:00
|
|
|
u_int8_t *s;
|
|
|
|
u_int8_t *d;
|
1999-12-22 19:13:38 +00:00
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
/* HOLY COW! BF_encrypt() takes values in host byteorder */
|
|
|
|
BF_LONG t[2];
|
|
|
|
|
|
|
|
bcopy(s, t, sizeof(t));
|
|
|
|
t[0] = ntohl(t[0]);
|
|
|
|
t[1] = ntohl(t[1]);
|
|
|
|
BF_encrypt(t, (BF_KEY *)sav->sched, BF_ENCRYPT);
|
|
|
|
t[0] = htonl(t[0]);
|
|
|
|
t[1] = htonl(t[1]);
|
|
|
|
bcopy(t, d, sizeof(t));
|
|
|
|
return 0;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_cast128_schedlen(algo)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
{
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
return sizeof(u_int32_t) * 32;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
static int
|
|
|
|
esp_cast128_schedule(algo, sav)
|
|
|
|
const struct esp_algorithm *algo;
|
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
set_cast128_subkey((u_int32_t *)sav->sched, _KEYBUF(sav->key_enc));
|
|
|
|
return 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
static int
|
|
|
|
esp_cast128_blockdecrypt(algo, sav, s, d)
|
|
|
|
const struct esp_algorithm *algo;
|
|
|
|
struct secasvar *sav;
|
|
|
|
u_int8_t *s;
|
|
|
|
u_int8_t *d;
|
|
|
|
{
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
if (_KEYLEN(sav->key_enc) <= 80 / 8)
|
|
|
|
cast128_decrypt_round12(d, s, (u_int32_t *)sav->sched);
|
|
|
|
else
|
|
|
|
cast128_decrypt_round16(d, s, (u_int32_t *)sav->sched);
|
|
|
|
return 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
static int
|
|
|
|
esp_cast128_blockencrypt(algo, sav, s, d)
|
|
|
|
const struct esp_algorithm *algo;
|
|
|
|
struct secasvar *sav;
|
|
|
|
u_int8_t *s;
|
|
|
|
u_int8_t *d;
|
|
|
|
{
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
if (_KEYLEN(sav->key_enc) <= 80 / 8)
|
|
|
|
cast128_encrypt_round12(d, s, (u_int32_t *)sav->sched);
|
|
|
|
else
|
|
|
|
cast128_encrypt_round16(d, s, (u_int32_t *)sav->sched);
|
|
|
|
return 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
static int
|
|
|
|
esp_3des_schedlen(algo)
|
|
|
|
const struct esp_algorithm *algo;
|
|
|
|
{
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
return sizeof(des_key_schedule) * 3;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_3des_schedule(algo, sav)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
2000-07-04 16:35:15 +00:00
|
|
|
int error;
|
2001-06-11 12:39:29 +00:00
|
|
|
des_key_schedule *p;
|
|
|
|
int i;
|
|
|
|
char *k;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
p = (des_key_schedule *)sav->sched;
|
|
|
|
k = _KEYBUF(sav->key_enc);
|
|
|
|
for (i = 0; i < 3; i++) {
|
|
|
|
error = des_key_sched((des_cblock *)(k + 8 * i), p[i]);
|
|
|
|
if (error)
|
|
|
|
return EINVAL;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
return 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
static int
|
|
|
|
esp_3des_blockdecrypt(algo, sav, s, d)
|
|
|
|
const struct esp_algorithm *algo;
|
|
|
|
struct secasvar *sav;
|
|
|
|
u_int8_t *s;
|
|
|
|
u_int8_t *d;
|
|
|
|
{
|
|
|
|
des_key_schedule *p;
|
|
|
|
|
|
|
|
/* assumption: d has a good alignment */
|
|
|
|
p = (des_key_schedule *)sav->sched;
|
|
|
|
bcopy(s, d, sizeof(DES_LONG) * 2);
|
|
|
|
des_ecb_encrypt((des_cblock *)d, (des_cblock *)d, p[2], DES_DECRYPT);
|
|
|
|
des_ecb_encrypt((des_cblock *)d, (des_cblock *)d, p[1], DES_ENCRYPT);
|
|
|
|
des_ecb_encrypt((des_cblock *)d, (des_cblock *)d, p[0], DES_DECRYPT);
|
|
|
|
return 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
static int
|
|
|
|
esp_3des_blockencrypt(algo, sav, s, d)
|
|
|
|
const struct esp_algorithm *algo;
|
|
|
|
struct secasvar *sav;
|
|
|
|
u_int8_t *s;
|
|
|
|
u_int8_t *d;
|
|
|
|
{
|
|
|
|
des_key_schedule *p;
|
|
|
|
|
|
|
|
/* assumption: d has a good alignment */
|
|
|
|
p = (des_key_schedule *)sav->sched;
|
|
|
|
bcopy(s, d, sizeof(DES_LONG) * 2);
|
|
|
|
des_ecb_encrypt((des_cblock *)d, (des_cblock *)d, p[0], DES_ENCRYPT);
|
|
|
|
des_ecb_encrypt((des_cblock *)d, (des_cblock *)d, p[1], DES_DECRYPT);
|
|
|
|
des_ecb_encrypt((des_cblock *)d, (des_cblock *)d, p[2], DES_ENCRYPT);
|
|
|
|
return 0;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_common_ivlen(algo, sav)
|
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
struct secasvar *sav;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
if (!algo)
|
|
|
|
panic("esp_common_ivlen: unknown algorithm");
|
|
|
|
return algo->ivlenval;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_cbc_decrypt(m, off, sav, algo, ivlen)
|
1999-12-22 19:13:38 +00:00
|
|
|
struct mbuf *m;
|
|
|
|
size_t off;
|
|
|
|
struct secasvar *sav;
|
2001-06-11 12:39:29 +00:00
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
int ivlen;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
struct mbuf *s;
|
|
|
|
struct mbuf *d, *d0, *dp;
|
|
|
|
int soff, doff; /*offset from the head of chain, to head of this mbuf */
|
|
|
|
int sn, dn; /*offset from the head of the mbuf, to meat */
|
|
|
|
size_t ivoff, bodyoff;
|
|
|
|
u_int8_t iv[MAXIVLEN], *ivp;
|
|
|
|
u_int8_t sbuf[MAXIVLEN], *sp;
|
|
|
|
u_int8_t *p, *q;
|
|
|
|
struct mbuf *scut;
|
|
|
|
int scutoff;
|
|
|
|
int i;
|
|
|
|
int blocklen;
|
|
|
|
int derived;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
if (ivlen != sav->ivlen || ivlen > sizeof(iv)) {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_decrypt %s: "
|
|
|
|
"unsupported ivlen %d\n", algo->name, ivlen));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* assumes blocklen == padbound */
|
|
|
|
blocklen = algo->padbound;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (blocklen > sizeof(iv)) {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_decrypt %s: "
|
|
|
|
"unsupported blocklen %d\n", algo->name, blocklen));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
#endif
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
if (sav->flags & SADB_X_EXT_OLD) {
|
|
|
|
/* RFC 1827 */
|
|
|
|
ivoff = off + sizeof(struct esp);
|
|
|
|
bodyoff = off + sizeof(struct esp) + ivlen;
|
|
|
|
derived = 0;
|
|
|
|
} else {
|
|
|
|
/* RFC 2406 */
|
|
|
|
if (sav->flags & SADB_X_EXT_DERIV) {
|
|
|
|
/*
|
|
|
|
* draft-ietf-ipsec-ciph-des-derived-00.txt
|
|
|
|
* uses sequence number field as IV field.
|
|
|
|
*/
|
|
|
|
ivoff = off + sizeof(struct esp);
|
|
|
|
bodyoff = off + sizeof(struct esp) + sizeof(u_int32_t);
|
|
|
|
ivlen = sizeof(u_int32_t);
|
|
|
|
derived = 1;
|
|
|
|
} else {
|
|
|
|
ivoff = off + sizeof(struct newesp);
|
|
|
|
bodyoff = off + sizeof(struct newesp) + ivlen;
|
|
|
|
derived = 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* grab iv */
|
|
|
|
m_copydata(m, ivoff, ivlen, iv);
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* extend iv */
|
|
|
|
if (ivlen == blocklen)
|
|
|
|
;
|
|
|
|
else if (ivlen == 4 && blocklen == 8) {
|
|
|
|
bcopy(&iv[0], &iv[4], 4);
|
|
|
|
iv[4] ^= 0xff;
|
|
|
|
iv[5] ^= 0xff;
|
|
|
|
iv[6] ^= 0xff;
|
|
|
|
iv[7] ^= 0xff;
|
|
|
|
} else {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_encrypt %s: "
|
|
|
|
"unsupported ivlen/blocklen: %d %d\n",
|
|
|
|
algo->name, ivlen, blocklen));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
if (m->m_pkthdr.len < bodyoff) {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_decrypt %s: bad len %d/%lu\n",
|
|
|
|
algo->name, m->m_pkthdr.len, (unsigned long)bodyoff));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
if ((m->m_pkthdr.len - bodyoff) % blocklen) {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_decrypt %s: "
|
|
|
|
"payload length must be multiple of %d\n",
|
|
|
|
algo->name, blocklen));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
s = m;
|
|
|
|
d = d0 = dp = NULL;
|
|
|
|
soff = doff = sn = dn = 0;
|
|
|
|
ivp = sp = NULL;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* skip bodyoff */
|
|
|
|
while (soff < bodyoff) {
|
|
|
|
if (soff + s->m_len > bodyoff) {
|
|
|
|
sn = bodyoff - soff;
|
|
|
|
break;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
soff += s->m_len;
|
|
|
|
s = s->m_next;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
scut = s;
|
|
|
|
scutoff = sn;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* skip over empty mbuf */
|
|
|
|
while (s && s->m_len == 0)
|
|
|
|
s = s->m_next;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
while (soff < m->m_pkthdr.len) {
|
|
|
|
/* source */
|
|
|
|
if (sn + blocklen <= s->m_len) {
|
|
|
|
/* body is continuous */
|
|
|
|
sp = mtod(s, u_int8_t *) + sn;
|
|
|
|
} else {
|
|
|
|
/* body is non-continuous */
|
|
|
|
m_copydata(s, sn, blocklen, sbuf);
|
|
|
|
sp = sbuf;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* destination */
|
|
|
|
if (!d || dn + blocklen > d->m_len) {
|
|
|
|
if (d)
|
|
|
|
dp = d;
|
|
|
|
MGET(d, M_DONTWAIT, MT_DATA);
|
|
|
|
i = m->m_pkthdr.len - (soff + sn);
|
|
|
|
if (d && i > MLEN) {
|
|
|
|
MCLGET(d, M_DONTWAIT);
|
|
|
|
if ((d->m_flags & M_EXT) == 0) {
|
|
|
|
m_free(d);
|
|
|
|
d = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!d) {
|
|
|
|
m_freem(m);
|
|
|
|
if (d0)
|
|
|
|
m_freem(d0);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
|
|
|
if (!d0)
|
|
|
|
d0 = d;
|
|
|
|
if (dp)
|
|
|
|
dp->m_next = d;
|
|
|
|
d->m_len = 0;
|
|
|
|
d->m_len = (M_TRAILINGSPACE(d) / blocklen) * blocklen;
|
|
|
|
if (d->m_len > i)
|
|
|
|
d->m_len = i;
|
|
|
|
dn = 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* decrypt */
|
|
|
|
(*algo->blockdecrypt)(algo, sav, sp, mtod(d, u_int8_t *) + dn);
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* xor */
|
|
|
|
p = ivp ? ivp : iv;
|
|
|
|
q = mtod(d, u_int8_t *) + dn;
|
|
|
|
for (i = 0; i < blocklen; i++)
|
|
|
|
q[i] ^= p[i];
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* next iv */
|
|
|
|
if (sp == sbuf) {
|
|
|
|
bcopy(sbuf, iv, blocklen);
|
|
|
|
ivp = NULL;
|
|
|
|
} else
|
|
|
|
ivp = sp;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
sn += blocklen;
|
|
|
|
dn += blocklen;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* find the next source block */
|
|
|
|
while (s && sn >= s->m_len) {
|
|
|
|
sn -= s->m_len;
|
|
|
|
soff += s->m_len;
|
|
|
|
s = s->m_next;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* skip over empty mbuf */
|
|
|
|
while (s && s->m_len == 0)
|
|
|
|
s = s->m_next;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
m_freem(scut->m_next);
|
|
|
|
scut->m_len = scutoff;
|
|
|
|
scut->m_next = d0;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* just in case */
|
|
|
|
bzero(iv, sizeof(iv));
|
|
|
|
bzero(sbuf, sizeof(sbuf));
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
return 0;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2001-06-11 12:39:29 +00:00
|
|
|
esp_cbc_encrypt(m, off, plen, sav, algo, ivlen)
|
1999-12-22 19:13:38 +00:00
|
|
|
struct mbuf *m;
|
|
|
|
size_t off;
|
|
|
|
size_t plen;
|
|
|
|
struct secasvar *sav;
|
2001-06-11 12:39:29 +00:00
|
|
|
const struct esp_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
int ivlen;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
struct mbuf *s;
|
|
|
|
struct mbuf *d, *d0, *dp;
|
|
|
|
int soff, doff; /*offset from the head of chain, to head of this mbuf */
|
|
|
|
int sn, dn; /*offset from the head of the mbuf, to meat */
|
|
|
|
size_t ivoff, bodyoff;
|
|
|
|
u_int8_t iv[MAXIVLEN], *ivp;
|
|
|
|
u_int8_t sbuf[MAXIVLEN], *sp;
|
|
|
|
u_int8_t *p, *q;
|
|
|
|
struct mbuf *scut;
|
|
|
|
int scutoff;
|
|
|
|
int i;
|
|
|
|
int blocklen;
|
|
|
|
int derived;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
if (ivlen != sav->ivlen || ivlen > sizeof(iv)) {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_encrypt %s: "
|
|
|
|
"unsupported ivlen %d\n", algo->name, ivlen));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
/* assumes blocklen == padbound */
|
|
|
|
blocklen = algo->padbound;
|
|
|
|
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (blocklen > sizeof(iv)) {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_encrypt %s: "
|
|
|
|
"unsupported blocklen %d\n", algo->name, blocklen));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
if (sav->flags & SADB_X_EXT_OLD) {
|
|
|
|
/* RFC 1827 */
|
|
|
|
ivoff = off + sizeof(struct esp);
|
|
|
|
bodyoff = off + sizeof(struct esp) + ivlen;
|
|
|
|
derived = 0;
|
|
|
|
} else {
|
|
|
|
/* RFC 2406 */
|
|
|
|
if (sav->flags & SADB_X_EXT_DERIV) {
|
|
|
|
/*
|
|
|
|
* draft-ietf-ipsec-ciph-des-derived-00.txt
|
|
|
|
* uses sequence number field as IV field.
|
|
|
|
*/
|
|
|
|
ivoff = off + sizeof(struct esp);
|
|
|
|
bodyoff = off + sizeof(struct esp) + sizeof(u_int32_t);
|
|
|
|
ivlen = sizeof(u_int32_t);
|
|
|
|
derived = 1;
|
|
|
|
} else {
|
|
|
|
ivoff = off + sizeof(struct newesp);
|
|
|
|
bodyoff = off + sizeof(struct newesp) + ivlen;
|
|
|
|
derived = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* put iv into the packet. if we are in derived mode, use seqno. */
|
|
|
|
if (derived)
|
|
|
|
m_copydata(m, ivoff, ivlen, iv);
|
|
|
|
else {
|
|
|
|
bcopy(sav->iv, iv, ivlen);
|
|
|
|
/* maybe it is better to overwrite dest, not source */
|
|
|
|
m_copyback(m, ivoff, ivlen, iv);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* extend iv */
|
|
|
|
if (ivlen == blocklen)
|
|
|
|
;
|
|
|
|
else if (ivlen == 4 && blocklen == 8) {
|
|
|
|
bcopy(&iv[0], &iv[4], 4);
|
|
|
|
iv[4] ^= 0xff;
|
|
|
|
iv[5] ^= 0xff;
|
|
|
|
iv[6] ^= 0xff;
|
|
|
|
iv[7] ^= 0xff;
|
|
|
|
} else {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_encrypt %s: "
|
|
|
|
"unsupported ivlen/blocklen: %d %d\n",
|
|
|
|
algo->name, ivlen, blocklen));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
if (m->m_pkthdr.len < bodyoff) {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_encrypt %s: bad len %d/%lu\n",
|
|
|
|
algo->name, m->m_pkthdr.len, (unsigned long)bodyoff));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
if ((m->m_pkthdr.len - bodyoff) % blocklen) {
|
|
|
|
ipseclog((LOG_ERR, "esp_cbc_encrypt %s: "
|
|
|
|
"payload length must be multiple of %lu\n",
|
|
|
|
algo->name, (unsigned long)algo->padbound));
|
|
|
|
m_freem(m);
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
s = m;
|
|
|
|
d = d0 = dp = NULL;
|
|
|
|
soff = doff = sn = dn = 0;
|
|
|
|
ivp = sp = NULL;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* skip bodyoff */
|
|
|
|
while (soff < bodyoff) {
|
|
|
|
if (soff + s->m_len > bodyoff) {
|
|
|
|
sn = bodyoff - soff;
|
|
|
|
break;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
soff += s->m_len;
|
|
|
|
s = s->m_next;
|
|
|
|
}
|
|
|
|
scut = s;
|
|
|
|
scutoff = sn;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* skip over empty mbuf */
|
|
|
|
while (s && s->m_len == 0)
|
|
|
|
s = s->m_next;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
while (soff < m->m_pkthdr.len) {
|
|
|
|
/* source */
|
|
|
|
if (sn + blocklen <= s->m_len) {
|
|
|
|
/* body is continuous */
|
|
|
|
sp = mtod(s, u_int8_t *) + sn;
|
|
|
|
} else {
|
|
|
|
/* body is non-continuous */
|
|
|
|
m_copydata(s, sn, blocklen, sbuf);
|
|
|
|
sp = sbuf;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* destination */
|
|
|
|
if (!d || dn + blocklen > d->m_len) {
|
|
|
|
if (d)
|
|
|
|
dp = d;
|
|
|
|
MGET(d, M_DONTWAIT, MT_DATA);
|
|
|
|
i = m->m_pkthdr.len - (soff + sn);
|
|
|
|
if (d && i > MLEN) {
|
|
|
|
MCLGET(d, M_DONTWAIT);
|
|
|
|
if ((d->m_flags & M_EXT) == 0) {
|
|
|
|
m_free(d);
|
|
|
|
d = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!d) {
|
|
|
|
m_freem(m);
|
|
|
|
if (d0)
|
|
|
|
m_freem(d0);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
|
|
|
if (!d0)
|
|
|
|
d0 = d;
|
|
|
|
if (dp)
|
|
|
|
dp->m_next = d;
|
|
|
|
d->m_len = 0;
|
|
|
|
d->m_len = (M_TRAILINGSPACE(d) / blocklen) * blocklen;
|
|
|
|
if (d->m_len > i)
|
|
|
|
d->m_len = i;
|
|
|
|
dn = 0;
|
|
|
|
}
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* xor */
|
|
|
|
p = ivp ? ivp : iv;
|
|
|
|
q = sp;
|
|
|
|
for (i = 0; i < blocklen; i++)
|
|
|
|
q[i] ^= p[i];
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* encrypt */
|
|
|
|
(*algo->blockencrypt)(algo, sav, sp, mtod(d, u_int8_t *) + dn);
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* next iv */
|
|
|
|
ivp = mtod(d, u_int8_t *) + dn;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
sn += blocklen;
|
|
|
|
dn += blocklen;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/* find the next source block */
|
|
|
|
while (s && sn >= s->m_len) {
|
|
|
|
sn -= s->m_len;
|
|
|
|
soff += s->m_len;
|
|
|
|
s = s->m_next;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
/* skip over empty mbuf */
|
|
|
|
while (s && s->m_len == 0)
|
|
|
|
s = s->m_next;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
m_freem(scut->m_next);
|
|
|
|
scut->m_len = scutoff;
|
|
|
|
scut->m_next = d0;
|
|
|
|
|
|
|
|
/* just in case */
|
|
|
|
bzero(iv, sizeof(iv));
|
|
|
|
bzero(sbuf, sizeof(sbuf));
|
|
|
|
|
|
|
|
key_sa_stir_iv(sav);
|
|
|
|
|
|
|
|
return 0;
|
1999-12-22 19:13:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*------------------------------------------------------------*/
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
/* does not free m0 on error */
|
1999-12-22 19:13:38 +00:00
|
|
|
int
|
|
|
|
esp_auth(m0, skip, length, sav, sum)
|
|
|
|
struct mbuf *m0;
|
|
|
|
size_t skip; /* offset to ESP header */
|
|
|
|
size_t length; /* payload length */
|
|
|
|
struct secasvar *sav;
|
|
|
|
u_char *sum;
|
|
|
|
{
|
|
|
|
struct mbuf *m;
|
|
|
|
size_t off;
|
|
|
|
struct ah_algorithm_state s;
|
|
|
|
u_char sumbuf[AH_MAXSUMSIZE];
|
2001-06-11 12:39:29 +00:00
|
|
|
const struct ah_algorithm *algo;
|
1999-12-22 19:13:38 +00:00
|
|
|
size_t siz;
|
2000-07-04 16:35:15 +00:00
|
|
|
int error;
|
1999-12-22 19:13:38 +00:00
|
|
|
|
|
|
|
/* sanity checks */
|
|
|
|
if (m0->m_pkthdr.len < skip) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_DEBUG, "esp_auth: mbuf length < skip\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
if (m0->m_pkthdr.len < skip + length) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_DEBUG,
|
|
|
|
"esp_auth: mbuf length < skip + length\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* length of esp part (excluding authentication data) must be 4n,
|
|
|
|
* since nexthdr must be at offset 4n+3.
|
|
|
|
*/
|
|
|
|
if (length % 4) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR, "esp_auth: length is not multiple of 4\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
if (!sav) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_DEBUG, "esp_auth: NULL SA passed\n"));
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
algo = ah_algorithm_lookup(sav->alg_auth);
|
|
|
|
if (!algo) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_ERR,
|
|
|
|
"esp_auth: bad ESP auth algorithm passed: %d\n",
|
|
|
|
sav->alg_auth));
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
m = m0;
|
|
|
|
off = 0;
|
|
|
|
|
|
|
|
siz = (((*algo->sumsiz)(sav) + 3) & ~(4 - 1));
|
|
|
|
if (sizeof(sumbuf) < siz) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ipseclog((LOG_DEBUG,
|
|
|
|
"esp_auth: AH_MAXSUMSIZE is too small: siz=%lu\n",
|
|
|
|
(u_long)siz));
|
1999-12-22 19:13:38 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* skip the header */
|
|
|
|
while (skip) {
|
|
|
|
if (!m)
|
|
|
|
panic("mbuf chain?");
|
|
|
|
if (m->m_len <= skip) {
|
|
|
|
skip -= m->m_len;
|
|
|
|
m = m->m_next;
|
|
|
|
off = 0;
|
|
|
|
} else {
|
|
|
|
off = skip;
|
|
|
|
skip = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
error = (*algo->init)(&s, sav);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
1999-12-22 19:13:38 +00:00
|
|
|
while (0 < length) {
|
|
|
|
if (!m)
|
|
|
|
panic("mbuf chain?");
|
|
|
|
|
|
|
|
if (m->m_len - off < length) {
|
|
|
|
(*algo->update)(&s, mtod(m, u_char *) + off,
|
|
|
|
m->m_len - off);
|
|
|
|
length -= m->m_len - off;
|
|
|
|
m = m->m_next;
|
|
|
|
off = 0;
|
|
|
|
} else {
|
|
|
|
(*algo->update)(&s, mtod(m, u_char *) + off, length);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
(*algo->result)(&s, sumbuf);
|
|
|
|
bcopy(sumbuf, sum, siz); /*XXX*/
|
2000-07-04 16:35:15 +00:00
|
|
|
|
1999-12-22 19:13:38 +00:00
|
|
|
return 0;
|
|
|
|
}
|