2019-08-26 11:44:49 +00:00
|
|
|
/*
|
|
|
|
sptps.c -- Simple Peer-to-Peer Security
|
2019-08-26 11:44:52 +00:00
|
|
|
Copyright (C) 2011-2015 Guus Sliepen <guus@tinc-vpn.org>,
|
2019-08-26 11:44:49 +00:00
|
|
|
2010 Brandon L. Black <blblack@gmail.com>
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
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 along
|
|
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "system.h"
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
#include "chacha-poly1305/chacha-poly1305.h"
|
2019-08-26 11:44:49 +00:00
|
|
|
#include "crypto.h"
|
|
|
|
#include "ecdh.h"
|
|
|
|
#include "ecdsa.h"
|
|
|
|
#include "logger.h"
|
|
|
|
#include "prf.h"
|
|
|
|
#include "sptps.h"
|
|
|
|
|
|
|
|
unsigned int sptps_replaywin = 16;
|
|
|
|
|
|
|
|
/*
|
|
|
|
Nonce MUST be exchanged first (done)
|
|
|
|
Signatures MUST be done over both nonces, to guarantee the signature is fresh
|
|
|
|
Otherwise: if ECDHE key of one side is compromised, it can be reused!
|
|
|
|
|
|
|
|
Add explicit tag to beginning of structure to distinguish the client and server when signing. (done)
|
|
|
|
|
|
|
|
Sign all handshake messages up to ECDHE kex with long-term public keys. (done)
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
HMACed KEX finished message to prevent downgrade attacks and prove you have the right key material (done by virtue of Ed25519 over the whole ECDHE exchange?)
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
Explicit close message needs to be added.
|
|
|
|
|
|
|
|
Maybe do add some alert messages to give helpful error messages? Not more than TLS sends.
|
|
|
|
|
|
|
|
Use counter mode instead of OFB. (done)
|
|
|
|
|
|
|
|
Make sure ECC operations are fixed time (aka prevent side-channel attacks).
|
|
|
|
*/
|
|
|
|
|
|
|
|
void sptps_log_quiet(sptps_t *s, int s_errno, const char *format, va_list ap) {
|
2019-08-26 11:44:53 +00:00
|
|
|
(void)s;
|
|
|
|
(void)s_errno;
|
|
|
|
(void)format;
|
|
|
|
(void)ap;
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void sptps_log_stderr(sptps_t *s, int s_errno, const char *format, va_list ap) {
|
2019-08-26 11:44:53 +00:00
|
|
|
(void)s;
|
|
|
|
(void)s_errno;
|
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
vfprintf(stderr, format, ap);
|
|
|
|
fputc('\n', stderr);
|
|
|
|
}
|
|
|
|
|
|
|
|
void (*sptps_log)(sptps_t *s, int s_errno, const char *format, va_list ap) = sptps_log_stderr;
|
|
|
|
|
|
|
|
// Log an error message.
|
|
|
|
static bool error(sptps_t *s, int s_errno, const char *format, ...) {
|
2019-08-26 11:44:53 +00:00
|
|
|
(void)s;
|
|
|
|
(void)s_errno;
|
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
if(format) {
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, format);
|
|
|
|
sptps_log(s, s_errno, format, ap);
|
|
|
|
va_end(ap);
|
|
|
|
}
|
|
|
|
|
|
|
|
errno = s_errno;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void warning(sptps_t *s, const char *format, ...) {
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, format);
|
|
|
|
sptps_log(s, 0, format, ap);
|
|
|
|
va_end(ap);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send a record (datagram version, accepts all record types, handles encryption and authentication).
|
2019-08-26 11:44:51 +00:00
|
|
|
static bool send_record_priv_datagram(sptps_t *s, uint8_t type, const void *data, uint16_t len) {
|
|
|
|
char buffer[len + 21UL];
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Create header with sequence number, length and record type
|
2019-08-26 11:44:51 +00:00
|
|
|
uint32_t seqno = s->outseqno++;
|
|
|
|
uint32_t netseqno = ntohl(seqno);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
memcpy(buffer, &netseqno, 4);
|
|
|
|
buffer[4] = type;
|
|
|
|
memcpy(buffer + 5, data, len);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
if(s->outstate) {
|
|
|
|
// If first handshake has finished, encrypt and HMAC
|
2019-08-26 11:44:51 +00:00
|
|
|
chacha_poly1305_encrypt(s->outcipher, seqno, buffer + 4, len + 1, buffer + 4, NULL);
|
|
|
|
return s->send_data(s->handle, type, buffer, len + 21UL);
|
2019-08-26 11:44:49 +00:00
|
|
|
} else {
|
|
|
|
// Otherwise send as plaintext
|
2019-08-26 11:44:51 +00:00
|
|
|
return s->send_data(s->handle, type, buffer, len + 5UL);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
// Send a record (private version, accepts all record types, handles encryption and authentication).
|
2019-08-26 11:44:51 +00:00
|
|
|
static bool send_record_priv(sptps_t *s, uint8_t type, const void *data, uint16_t len) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(s->datagram) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return send_record_priv_datagram(s, type, data, len);
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
char buffer[len + 19UL];
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Create header with sequence number, length and record type
|
2019-08-26 11:44:51 +00:00
|
|
|
uint32_t seqno = s->outseqno++;
|
2019-08-26 11:44:49 +00:00
|
|
|
uint16_t netlen = htons(len);
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
memcpy(buffer, &netlen, 2);
|
|
|
|
buffer[2] = type;
|
|
|
|
memcpy(buffer + 3, data, len);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
if(s->outstate) {
|
|
|
|
// If first handshake has finished, encrypt and HMAC
|
2019-08-26 11:44:51 +00:00
|
|
|
chacha_poly1305_encrypt(s->outcipher, seqno, buffer + 2, len + 1, buffer + 2, NULL);
|
|
|
|
return s->send_data(s->handle, type, buffer, len + 19UL);
|
2019-08-26 11:44:49 +00:00
|
|
|
} else {
|
|
|
|
// Otherwise send as plaintext
|
2019-08-26 11:44:51 +00:00
|
|
|
return s->send_data(s->handle, type, buffer, len + 3UL);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send an application record.
|
2019-08-26 11:44:51 +00:00
|
|
|
bool sptps_send_record(sptps_t *s, uint8_t type, const void *data, uint16_t len) {
|
2019-08-26 11:44:49 +00:00
|
|
|
// Sanity checks: application cannot send data before handshake is finished,
|
|
|
|
// and only record types 0..127 are allowed.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!s->outstate) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EINVAL, "Handshake phase not finished yet");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(type >= SPTPS_HANDSHAKE) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EINVAL, "Invalid application record type");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
return send_record_priv(s, type, data, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send a Key EXchange record, containing a random nonce and an ECDHE public key.
|
|
|
|
static bool send_kex(sptps_t *s) {
|
|
|
|
size_t keylen = ECDH_SIZE;
|
|
|
|
|
|
|
|
// Make room for our KEX message, which we will keep around since send_sig() needs it.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(s->mykex) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
s->mykex = realloc(s->mykex, 1 + 32 + keylen);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!s->mykex) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, errno, strerror(errno));
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Set version byte to zero.
|
|
|
|
s->mykex[0] = SPTPS_VERSION;
|
|
|
|
|
|
|
|
// Create a random nonce.
|
|
|
|
randomize(s->mykex + 1, 32);
|
|
|
|
|
|
|
|
// Create a new ECDH public key.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!(s->ecdh = ecdh_generate_public(s->mykex + 1 + 32))) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to generate ECDH public key");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
return send_record_priv(s, SPTPS_HANDSHAKE, s->mykex, 1 + 32 + keylen);
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
// Send a SIGnature record, containing an Ed25519 signature over both KEX records.
|
2019-08-26 11:44:49 +00:00
|
|
|
static bool send_sig(sptps_t *s) {
|
|
|
|
size_t keylen = ECDH_SIZE;
|
2019-08-26 11:44:51 +00:00
|
|
|
size_t siglen = ecdsa_size(s->mykey);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Concatenate both KEX messages, plus tag indicating if it is from the connection originator, plus label
|
|
|
|
char msg[(1 + 32 + keylen) * 2 + 1 + s->labellen];
|
|
|
|
char sig[siglen];
|
|
|
|
|
|
|
|
msg[0] = s->initiator;
|
|
|
|
memcpy(msg + 1, s->mykex, 1 + 32 + keylen);
|
|
|
|
memcpy(msg + 1 + 33 + keylen, s->hiskex, 1 + 32 + keylen);
|
|
|
|
memcpy(msg + 1 + 2 * (33 + keylen), s->label, s->labellen);
|
|
|
|
|
|
|
|
// Sign the result.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!ecdsa_sign(s->mykey, msg, sizeof(msg), sig)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to sign SIG record");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Send the SIG exchange record.
|
2019-08-26 11:44:53 +00:00
|
|
|
return send_record_priv(s, SPTPS_HANDSHAKE, sig, sizeof(sig));
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Generate key material from the shared secret created from the ECDHE key exchange.
|
|
|
|
static bool generate_key_material(sptps_t *s, const char *shared, size_t len) {
|
|
|
|
// Initialise cipher and digest structures if necessary
|
|
|
|
if(!s->outstate) {
|
2019-08-26 11:44:51 +00:00
|
|
|
s->incipher = chacha_poly1305_init();
|
|
|
|
s->outcipher = chacha_poly1305_init();
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!s->incipher || !s->outcipher) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to open cipher");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Allocate memory for key material
|
2019-08-26 11:44:51 +00:00
|
|
|
size_t keylen = 2 * CHACHA_POLY1305_KEYLEN;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
s->key = realloc(s->key, keylen);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!s->key) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, errno, strerror(errno));
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Create the HMAC seed, which is "key expansion" + session label + server nonce + client nonce
|
|
|
|
char seed[s->labellen + 64 + 13];
|
2019-08-26 11:44:52 +00:00
|
|
|
memcpy(seed, "key expansion", 13);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
if(s->initiator) {
|
|
|
|
memcpy(seed + 13, s->mykex + 1, 32);
|
|
|
|
memcpy(seed + 45, s->hiskex + 1, 32);
|
|
|
|
} else {
|
|
|
|
memcpy(seed + 13, s->hiskex + 1, 32);
|
|
|
|
memcpy(seed + 45, s->mykex + 1, 32);
|
|
|
|
}
|
2019-08-26 11:44:53 +00:00
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
memcpy(seed + 77, s->label, s->labellen);
|
|
|
|
|
|
|
|
// Use PRF to generate the key material
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!prf(shared, len, seed, s->labellen + 64 + 13, s->key, keylen)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to generate key material");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send an ACKnowledgement record.
|
|
|
|
static bool send_ack(sptps_t *s) {
|
|
|
|
return send_record_priv(s, SPTPS_HANDSHAKE, "", 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Receive an ACKnowledgement record.
|
|
|
|
static bool receive_ack(sptps_t *s, const char *data, uint16_t len) {
|
2019-08-26 11:44:53 +00:00
|
|
|
(void)data;
|
|
|
|
|
|
|
|
if(len) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EIO, "Invalid ACK record length");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
if(s->initiator) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!chacha_poly1305_set_key(s->incipher, s->key)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to set counter");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
} else {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!chacha_poly1305_set_key(s->incipher, s->key + CHACHA_POLY1305_KEYLEN)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to set counter");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
free(s->key);
|
|
|
|
s->key = NULL;
|
|
|
|
s->instate = true;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Receive a Key EXchange record, respond by sending a SIG record.
|
|
|
|
static bool receive_kex(sptps_t *s, const char *data, uint16_t len) {
|
|
|
|
// Verify length of the HELLO record
|
2019-08-26 11:44:53 +00:00
|
|
|
if(len != 1 + 32 + ECDH_SIZE) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EIO, "Invalid KEX record length");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Ignore version number for now.
|
|
|
|
|
|
|
|
// Make a copy of the KEX message, send_sig() and receive_sig() need it
|
2019-08-26 11:44:53 +00:00
|
|
|
if(s->hiskex) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Received a second KEX message before first has been processed");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
s->hiskex = realloc(s->hiskex, len);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!s->hiskex) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, errno, strerror(errno));
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
memcpy(s->hiskex, data, len);
|
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(s->initiator) {
|
|
|
|
return send_sig(s);
|
|
|
|
} else {
|
|
|
|
return true;
|
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Receive a SIGnature record, verify it, if it passed, compute the shared secret and calculate the session keys.
|
|
|
|
static bool receive_sig(sptps_t *s, const char *data, uint16_t len) {
|
|
|
|
size_t keylen = ECDH_SIZE;
|
2019-08-26 11:44:51 +00:00
|
|
|
size_t siglen = ecdsa_size(s->hiskey);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Verify length of KEX record.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(len != siglen) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EIO, "Invalid KEX record length");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Concatenate both KEX messages, plus tag indicating if it is from the connection originator
|
|
|
|
char msg[(1 + 32 + keylen) * 2 + 1 + s->labellen];
|
|
|
|
|
|
|
|
msg[0] = !s->initiator;
|
|
|
|
memcpy(msg + 1, s->hiskex, 1 + 32 + keylen);
|
|
|
|
memcpy(msg + 1 + 33 + keylen, s->mykex, 1 + 32 + keylen);
|
|
|
|
memcpy(msg + 1 + 2 * (33 + keylen), s->label, s->labellen);
|
|
|
|
|
|
|
|
// Verify signature.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!ecdsa_verify(s->hiskey, msg, sizeof(msg), data)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EIO, "Failed to verify SIG record");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Compute shared secret.
|
|
|
|
char shared[ECDH_SHARED_SIZE];
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!ecdh_compute_shared(s->ecdh, s->hiskex + 1 + 32, shared)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to compute ECDH shared secret");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
s->ecdh = NULL;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Generate key material from shared secret.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!generate_key_material(s, shared, sizeof(shared))) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(!s->initiator && !send_sig(s)) {
|
|
|
|
return false;
|
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
free(s->mykex);
|
|
|
|
free(s->hiskex);
|
|
|
|
|
|
|
|
s->mykex = NULL;
|
|
|
|
s->hiskex = NULL;
|
|
|
|
|
|
|
|
// Send cipher change record
|
2019-08-26 11:44:53 +00:00
|
|
|
if(s->outstate && !send_ack(s)) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// TODO: only set new keys after ACK has been set/received
|
|
|
|
if(s->initiator) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!chacha_poly1305_set_key(s->outcipher, s->key + CHACHA_POLY1305_KEYLEN)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to set key");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
} else {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!chacha_poly1305_set_key(s->outcipher, s->key)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EINVAL, "Failed to set key");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Force another Key EXchange (for testing purposes).
|
|
|
|
bool sptps_force_kex(sptps_t *s) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!s->outstate || s->state != SPTPS_SECONDARY_KEX) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EINVAL, "Cannot force KEX in current state");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
s->state = SPTPS_KEX;
|
|
|
|
return send_kex(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Receive a handshake record.
|
|
|
|
static bool receive_handshake(sptps_t *s, const char *data, uint16_t len) {
|
|
|
|
// Only a few states to deal with handshaking.
|
|
|
|
switch(s->state) {
|
2019-08-26 11:44:53 +00:00
|
|
|
case SPTPS_SECONDARY_KEX:
|
|
|
|
|
|
|
|
// We receive a secondary KEX request, first respond by sending our own.
|
|
|
|
if(!send_kex(s)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Fall through
|
|
|
|
case SPTPS_KEX:
|
|
|
|
|
|
|
|
// We have sent our KEX request, we expect our peer to sent one as well.
|
|
|
|
if(!receive_kex(s, data, len)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
s->state = SPTPS_SIG;
|
|
|
|
return true;
|
|
|
|
|
|
|
|
case SPTPS_SIG:
|
|
|
|
|
|
|
|
// If we already sent our secondary public ECDH key, we expect the peer to send his.
|
|
|
|
if(!receive_sig(s, data, len)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(s->outstate) {
|
|
|
|
s->state = SPTPS_ACK;
|
|
|
|
} else {
|
|
|
|
s->outstate = true;
|
|
|
|
|
|
|
|
if(!receive_ack(s, NULL, 0)) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
s->receive_record(s->handle, SPTPS_HANDSHAKE, NULL, 0);
|
|
|
|
s->state = SPTPS_SECONDARY_KEX;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
|
|
|
case SPTPS_ACK:
|
|
|
|
|
|
|
|
// We expect a handshake message to indicate transition to the new keys.
|
|
|
|
if(!receive_ack(s, data, len)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
s->receive_record(s->handle, SPTPS_HANDSHAKE, NULL, 0);
|
|
|
|
s->state = SPTPS_SECONDARY_KEX;
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// TODO: split ACK into a VERify and ACK?
|
|
|
|
default:
|
|
|
|
return error(s, EIO, "Invalid session state %d", s->state);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
static bool sptps_check_seqno(sptps_t *s, uint32_t seqno, bool update_state) {
|
|
|
|
// Replay protection using a sliding window of configurable size.
|
|
|
|
// s->inseqno is expected sequence number
|
|
|
|
// seqno is received sequence number
|
|
|
|
// s->late[] is a circular buffer, a 1 bit means a packet has not been received yet
|
|
|
|
// The circular buffer contains bits for sequence numbers from s->inseqno - s->replaywin * 8 to (but excluding) s->inseqno.
|
|
|
|
if(s->replaywin) {
|
|
|
|
if(seqno != s->inseqno) {
|
|
|
|
if(seqno >= s->inseqno + s->replaywin * 8) {
|
|
|
|
// Prevent packets that jump far ahead of the queue from causing many others to be dropped.
|
|
|
|
bool farfuture = s->farfuture < s->replaywin >> 2;
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(update_state) {
|
2019-08-26 11:44:51 +00:00
|
|
|
s->farfuture++;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(farfuture) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return update_state ? error(s, EIO, "Packet is %d seqs in the future, dropped (%u)\n", seqno - s->inseqno, s->farfuture) : false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:51 +00:00
|
|
|
|
|
|
|
// Unless we have seen lots of them, in which case we consider the others lost.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(update_state) {
|
2019-08-26 11:44:52 +00:00
|
|
|
warning(s, "Lost %d packets\n", seqno - s->inseqno);
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(update_state) {
|
2019-08-26 11:44:51 +00:00
|
|
|
// Mark all packets in the replay window as being late.
|
|
|
|
memset(s->late, 255, s->replaywin);
|
|
|
|
}
|
2019-08-26 11:44:53 +00:00
|
|
|
} else if(seqno < s->inseqno) {
|
2019-08-26 11:44:51 +00:00
|
|
|
// If the sequence number is farther in the past than the bitmap goes, or if the packet was already received, drop it.
|
2019-08-26 11:44:53 +00:00
|
|
|
if((s->inseqno >= s->replaywin * 8 && seqno < s->inseqno - s->replaywin * 8) || !(s->late[(seqno / 8) % s->replaywin] & (1 << seqno % 8))) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return update_state ? error(s, EIO, "Received late or replayed packet, seqno %d, last received %d\n", seqno, s->inseqno) : false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
} else if(update_state) {
|
2019-08-26 11:44:51 +00:00
|
|
|
// We missed some packets. Mark them in the bitmap as being late.
|
2019-08-26 11:44:53 +00:00
|
|
|
for(uint32_t i = s->inseqno; i < seqno; i++) {
|
2019-08-26 11:44:51 +00:00
|
|
|
s->late[(i / 8) % s->replaywin] |= 1 << i % 8;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(update_state) {
|
2019-08-26 11:44:51 +00:00
|
|
|
// Mark the current packet as not being late.
|
|
|
|
s->late[(seqno / 8) % s->replaywin] &= ~(1 << seqno % 8);
|
|
|
|
s->farfuture = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(update_state) {
|
|
|
|
if(seqno >= s->inseqno) {
|
2019-08-26 11:44:51 +00:00
|
|
|
s->inseqno = seqno + 1;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:51 +00:00
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!s->inseqno) {
|
2019-08-26 11:44:51 +00:00
|
|
|
s->received = 0;
|
2019-08-26 11:44:53 +00:00
|
|
|
} else {
|
2019-08-26 11:44:51 +00:00
|
|
|
s->received++;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
// Check datagram for valid HMAC
|
2019-08-26 11:44:53 +00:00
|
|
|
bool sptps_verify_datagram(sptps_t *s, const void *vdata, size_t len) {
|
|
|
|
if(!s->instate || len < 21) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EIO, "Received short packet");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
const char *data = vdata;
|
2019-08-26 11:44:51 +00:00
|
|
|
uint32_t seqno;
|
|
|
|
memcpy(&seqno, data, 4);
|
|
|
|
seqno = ntohl(seqno);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!sptps_check_seqno(s, seqno, false)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
char buffer[len];
|
|
|
|
size_t outlen;
|
|
|
|
return chacha_poly1305_decrypt(s->incipher, seqno, data + 4, len - 4, buffer, &outlen);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Receive incoming data, datagram version.
|
|
|
|
static bool sptps_receive_data_datagram(sptps_t *s, const char *data, size_t len) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(len < (s->instate ? 21 : 5)) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EIO, "Received short packet");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
uint32_t seqno;
|
|
|
|
memcpy(&seqno, data, 4);
|
|
|
|
seqno = ntohl(seqno);
|
2019-08-26 11:44:53 +00:00
|
|
|
data += 4;
|
|
|
|
len -= 4;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
if(!s->instate) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(seqno != s->inseqno) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EIO, "Invalid packet seqno: %d != %d", seqno, s->inseqno);
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
s->inseqno = seqno + 1;
|
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
uint8_t type = *(data++);
|
|
|
|
len--;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(type != SPTPS_HANDSHAKE) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EIO, "Application record received before handshake finished");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
return receive_handshake(s, data, len);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
// Decrypt
|
2019-08-26 11:44:50 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
char buffer[len];
|
|
|
|
size_t outlen;
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!chacha_poly1305_decrypt(s->incipher, seqno, data, len, buffer, &outlen)) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EIO, "Failed to decrypt and verify packet");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!sptps_check_seqno(s, seqno, true)) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
// Append a NULL byte for safety.
|
2019-08-26 11:44:52 +00:00
|
|
|
buffer[outlen] = 0;
|
|
|
|
|
|
|
|
data = buffer;
|
|
|
|
len = outlen;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
uint8_t type = *(data++);
|
|
|
|
len--;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
if(type < SPTPS_HANDSHAKE) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!s->instate) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, EIO, "Application record received before handshake finished");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(!s->receive_record(s->handle, type, data, len)) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
} else if(type == SPTPS_HANDSHAKE) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!receive_handshake(s, data, len)) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
} else {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EIO, "Invalid record type %d", type);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Receive incoming data. Check if it contains a complete record, if so, handle it.
|
2019-08-26 11:44:53 +00:00
|
|
|
size_t sptps_receive_data(sptps_t *s, const void *vdata, size_t len) {
|
|
|
|
const char *data = vdata;
|
2019-08-26 11:44:52 +00:00
|
|
|
size_t total_read = 0;
|
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!s->state) {
|
2019-08-26 11:44:51 +00:00
|
|
|
return error(s, EIO, "Invalid session state zero");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:51 +00:00
|
|
|
|
2019-08-26 11:44:53 +00:00
|
|
|
if(s->datagram) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return sptps_receive_data_datagram(s, data, len) ? len : false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// First read the 2 length bytes.
|
|
|
|
if(s->buflen < 2) {
|
|
|
|
size_t toread = 2 - s->buflen;
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(toread > len) {
|
2019-08-26 11:44:52 +00:00
|
|
|
toread = len;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
memcpy(s->inbuf + s->buflen, data, toread);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
total_read += toread;
|
|
|
|
s->buflen += toread;
|
|
|
|
len -= toread;
|
|
|
|
data += toread;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// Exit early if we don't have the full length.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(s->buflen < 2) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return total_read;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// Get the length bytes
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
memcpy(&s->reclen, s->inbuf, 2);
|
|
|
|
s->reclen = ntohs(s->reclen);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// If we have the length bytes, ensure our buffer can hold the whole request.
|
|
|
|
s->inbuf = realloc(s->inbuf, s->reclen + 19UL);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!s->inbuf) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return error(s, errno, strerror(errno));
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// Exit early if we have no more data to process.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!len) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return total_read;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:52 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// Read up to the end of the record.
|
|
|
|
size_t toread = s->reclen + (s->instate ? 19UL : 3UL) - s->buflen;
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(toread > len) {
|
2019-08-26 11:44:52 +00:00
|
|
|
toread = len;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
memcpy(s->inbuf + s->buflen, data, toread);
|
|
|
|
total_read += toread;
|
|
|
|
s->buflen += toread;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// If we don't have a whole record, exit.
|
2019-08-26 11:44:53 +00:00
|
|
|
if(s->buflen < s->reclen + (s->instate ? 19UL : 3UL)) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return total_read;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:51 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// Update sequence number.
|
2019-08-26 11:44:51 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
uint32_t seqno = s->inseqno++;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// Check HMAC and decrypt.
|
|
|
|
if(s->instate) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!chacha_poly1305_decrypt(s->incipher, seqno, s->inbuf + 2UL, s->reclen + 17UL, s->inbuf + 2UL, NULL)) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return error(s, EINVAL, "Failed to decrypt and verify record");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:52 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
// Append a NULL byte for safety.
|
|
|
|
s->inbuf[s->reclen + 3UL] = 0;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
uint8_t type = s->inbuf[2];
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
if(type < SPTPS_HANDSHAKE) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!s->instate) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return error(s, EIO, "Application record received before handshake finished");
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(!s->receive_record(s->handle, type, s->inbuf + 3, s->reclen)) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:52 +00:00
|
|
|
} else if(type == SPTPS_HANDSHAKE) {
|
2019-08-26 11:44:53 +00:00
|
|
|
if(!receive_handshake(s, s->inbuf + 3, s->reclen)) {
|
2019-08-26 11:44:52 +00:00
|
|
|
return false;
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:52 +00:00
|
|
|
} else {
|
|
|
|
return error(s, EIO, "Invalid record type %d", type);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
s->buflen = 0;
|
|
|
|
|
|
|
|
return total_read;
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Start a SPTPS session.
|
2019-08-26 11:44:51 +00:00
|
|
|
bool sptps_start(sptps_t *s, void *handle, bool initiator, bool datagram, ecdsa_t *mykey, ecdsa_t *hiskey, const void *label, size_t labellen, send_data_t send_data, receive_record_t receive_record) {
|
2019-08-26 11:44:49 +00:00
|
|
|
// Initialise struct sptps
|
2019-08-26 11:44:53 +00:00
|
|
|
memset(s, 0, sizeof(*s));
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
s->handle = handle;
|
|
|
|
s->initiator = initiator;
|
|
|
|
s->datagram = datagram;
|
|
|
|
s->mykey = mykey;
|
|
|
|
s->hiskey = hiskey;
|
|
|
|
s->replaywin = sptps_replaywin;
|
2019-08-26 11:44:53 +00:00
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
if(s->replaywin) {
|
|
|
|
s->late = malloc(s->replaywin);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!s->late) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, errno, strerror(errno));
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
memset(s->late, 0, s->replaywin);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
s->label = malloc(labellen);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!s->label) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, errno, strerror(errno));
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
if(!datagram) {
|
|
|
|
s->inbuf = malloc(7);
|
2019-08-26 11:44:53 +00:00
|
|
|
|
|
|
|
if(!s->inbuf) {
|
2019-08-26 11:44:49 +00:00
|
|
|
return error(s, errno, strerror(errno));
|
2019-08-26 11:44:53 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
s->buflen = 0;
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(s->label, label, labellen);
|
|
|
|
s->labellen = labellen;
|
|
|
|
|
|
|
|
s->send_data = send_data;
|
|
|
|
s->receive_record = receive_record;
|
|
|
|
|
|
|
|
// Do first KEX immediately
|
|
|
|
s->state = SPTPS_KEX;
|
|
|
|
return send_kex(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Stop a SPTPS session.
|
|
|
|
bool sptps_stop(sptps_t *s) {
|
|
|
|
// Clean up any resources.
|
2019-08-26 11:44:51 +00:00
|
|
|
chacha_poly1305_exit(s->incipher);
|
|
|
|
chacha_poly1305_exit(s->outcipher);
|
2019-08-26 11:44:51 +00:00
|
|
|
ecdh_free(s->ecdh);
|
2019-08-26 11:44:49 +00:00
|
|
|
free(s->inbuf);
|
|
|
|
free(s->mykex);
|
|
|
|
free(s->hiskex);
|
|
|
|
free(s->key);
|
|
|
|
free(s->label);
|
|
|
|
free(s->late);
|
2019-08-26 11:44:53 +00:00
|
|
|
memset(s, 0, sizeof(*s));
|
2019-08-26 11:44:49 +00:00
|
|
|
return true;
|
|
|
|
}
|