edhoc 1.0.1 → 1.0.2

package/external/libedhoc/externals/compact25519/src/c25519/f25519.h

@@ -0,0 +1,98 @@
+/* Arithmetic mod p = 2^255-19
+ * Daniel Beer <dlbeer@gmail.com>, 8 Jan 2014
+ *
+ * This file is in the public domain.
+ */
+
+#ifndef F25519_H_
+#define F25519_H_
+
+#include <stdint.h>
+#include <string.h>
+
+/* Field elements are represented as little-endian byte strings. All
+ * operations have timings which are independent of input data, so they
+ * can be safely used for cryptography.
+ *
+ * Computation is performed on un-normalized elements. These are byte
+ * strings which fall into the range 0 <= x < 2p. Use f25519_normalize()
+ * to convert to a value 0 <= x < p.
+ *
+ * Elements received from the outside may greater even than 2p.
+ * f25519_normalize() will correctly deal with these numbers too.
+ */
+#define F25519_SIZE  32
+
+/* Identity constants */
+#ifdef FULL_C25519_CODE
+extern const uint8_t f25519_zero[F25519_SIZE];
+#endif
+extern const uint8_t f25519_one[F25519_SIZE];
+
+/* Load a small constant */
+void f25519_load(uint8_t *x, uint32_t c);
+
+/* Copy two points */
+static inline void f25519_copy(uint8_t *x, const uint8_t *a)
+{
+	memcpy(x, a, F25519_SIZE);
+}
+
+/* Normalize a field point x < 2*p by subtracting p if necessary */
+void f25519_normalize(uint8_t *x);
+
+/* Compare two field points in constant time. Return one if equal, zero
+ * otherwise. This should be performed only on normalized values.
+ */
+uint8_t f25519_eq(const uint8_t *x, const uint8_t *y);
+
+/* Conditional copy. If condition == 0, then zero is copied to dst. If
+ * condition == 1, then one is copied to dst. Any other value results in
+ * undefined behaviour.
+ */
+void f25519_select(uint8_t *dst,
+		   const uint8_t *zero, const uint8_t *one,
+		   uint8_t condition);
+
+/* Add/subtract two field points. The three pointers are not required to
+ * be distinct.
+ */
+void f25519_add(uint8_t *r, const uint8_t *a, const uint8_t *b);
+void f25519_sub(uint8_t *r, const uint8_t *a, const uint8_t *b);
+
+/* Unary negation */
+void f25519_neg(uint8_t *r, const uint8_t *a);
+
+/* Multiply two field points. The __distinct variant is used when r is
+ * known to be in a different location to a and b.
+ */
+#ifdef FULL_C25519_CODE
+void f25519_mul(uint8_t *r, const uint8_t *a, const uint8_t *b);
+#endif
+void f25519_mul__distinct(uint8_t *r, const uint8_t *a, const uint8_t *b);
+
+/* Multiply a point by a small constant. The two pointers are not
+ * required to be distinct.
+ *
+ * The constant must be less than 2^24.
+ */
+void f25519_mul_c(uint8_t *r, const uint8_t *a, uint32_t b);
+
+/* Take the reciprocal of a field point. The __distinct variant is used
+ * when r is known to be in a different location to x.
+ */
+#ifdef FULL_C25519_CODE
+void f25519_inv(uint8_t *r, const uint8_t *x);
+#endif
+void f25519_inv__distinct(uint8_t *r, const uint8_t *x);
+
+/* Compute one of the square roots of the field element, if the element
+ * is square. The other square is -r.
+ *
+ * If the input is not square, the returned value is a valid field
+ * element, but not the correct answer. If you don't already know that
+ * your element is square, you should square the return value and test.
+ */
+void f25519_sqrt(uint8_t *r, const uint8_t *x);
+
+#endif

package/external/libedhoc/externals/compact25519/src/c25519/fprime.c

@@ -0,0 +1,226 @@
+/* Arithmetic in prime fields
+ * Daniel Beer <dlbeer@gmail.com>, 10 Jan 2014
+ *
+ * This file is in the public domain.
+ */
+
+#include "fprime.h"
+
+#ifndef COMPACT_DISABLE_ED25519
+#ifdef FULL_C25519_CODE
+const uint8_t fprime_zero[FPRIME_SIZE] = {0};
+const uint8_t fprime_one[FPRIME_SIZE] = {1};
+#endif
+
+static void raw_add(uint8_t *x, const uint8_t *p)
+{
+	uint16_t c = 0;
+	int i;
+
+	for (i = 0; i < FPRIME_SIZE; i++) {
+		c += ((uint16_t)x[i]) + ((uint16_t)p[i]);
+		x[i] = c;
+		c >>= 8;
+	}
+}
+
+static void raw_try_sub(uint8_t *x, const uint8_t *p)
+{
+	uint8_t minusp[FPRIME_SIZE];
+	uint16_t c = 0;
+	int i;
+
+	for (i = 0; i < FPRIME_SIZE; i++) {
+		c = ((uint16_t)x[i]) - ((uint16_t)p[i]) - c;
+		minusp[i] = c;
+		c = (c >> 8) & 1;
+	}
+
+	fprime_select(x, minusp, x, c);
+}
+
+/* Warning: this function is variable-time */
+static int prime_msb(const uint8_t *p)
+{
+	int i;
+	uint8_t x;
+
+	for (i = FPRIME_SIZE - 1; i >= 0; i--)
+		if (p[i])
+			break;
+
+	x = p[i];
+	i <<= 3;
+
+	while (x) {
+		x >>= 1;
+		i++;
+	}
+
+	return i - 1;
+}
+
+/* Warning: this function may be variable-time in the argument n */
+static void shift_n_bits(uint8_t *x, int n)
+{
+	uint16_t c = 0;
+	int i;
+
+	for (i = 0; i < FPRIME_SIZE; i++) {
+		c |= ((uint16_t)x[i]) << n;
+		x[i] = c;
+		c >>= 8;
+	}
+}
+
+#ifdef FULL_C25519_CODE
+void fprime_load(uint8_t *x, uint32_t c)
+{
+	unsigned int i;
+
+	for (i = 0; i < sizeof(c); i++) {
+		x[i] = c;
+		c >>= 8;
+	}
+
+	for (; i < FPRIME_SIZE; i++)
+		x[i] = 0;
+}
+#endif
+
+static inline int min_int(int a, int b)
+{
+	return a < b ? a : b;
+}
+
+void fprime_from_bytes(uint8_t *n,
+		       const uint8_t *x, size_t len,
+		       const uint8_t *modulus)
+{
+	const int preload_total = min_int(prime_msb(modulus) - 1, len << 3);
+	const int preload_bytes = preload_total >> 3;
+	const int preload_bits = preload_total & 7;
+	const int rbits = (len << 3) - preload_total;
+	int i;
+
+	memset(n, 0, FPRIME_SIZE);
+
+	for (i = 0; i < preload_bytes; i++)
+		n[i] = x[len - preload_bytes + i];
+
+	if (preload_bits) {
+		shift_n_bits(n, preload_bits);
+		n[0] |= x[len - preload_bytes - 1] >> (8 - preload_bits);
+	}
+
+	for (i = rbits - 1; i >= 0; i--) {
+		const uint8_t bit = (x[i >> 3] >> (i & 7)) & 1;
+
+		shift_n_bits(n, 1);
+		n[0] |= bit;
+		raw_try_sub(n, modulus);
+	}
+}
+
+#ifdef FULL_C25519_CODE
+void fprime_normalize(uint8_t *x, const uint8_t *modulus)
+{
+	uint8_t n[FPRIME_SIZE];
+
+	fprime_from_bytes(n, x, FPRIME_SIZE, modulus);
+	fprime_copy(x, n);
+}
+
+uint8_t fprime_eq(const uint8_t *x, const uint8_t *y)
+{
+	uint8_t sum = 0;
+	int i;
+
+	for (i = 0; i < FPRIME_SIZE; i++)
+		sum |= x[i] ^ y[i];
+
+	sum |= (sum >> 4);
+	sum |= (sum >> 2);
+	sum |= (sum >> 1);
+
+	return (sum ^ 1) & 1;
+}
+#endif
+void fprime_select(uint8_t *dst,
+		   const uint8_t *zero, const uint8_t *one,
+		   uint8_t condition)
+{
+	const uint8_t mask = -condition;
+	int i;
+
+	for (i = 0; i < FPRIME_SIZE; i++)
+		dst[i] = zero[i] ^ (mask & (one[i] ^ zero[i]));
+}
+
+void fprime_add(uint8_t *r, const uint8_t *a, const uint8_t *modulus)
+{
+	raw_add(r, a);
+	raw_try_sub(r, modulus);
+}
+
+#ifdef FULL_C25519_CODE
+void fprime_sub(uint8_t *r, const uint8_t *a, const uint8_t *modulus)
+{
+	raw_add(r, modulus);
+	raw_try_sub(r, a);
+	raw_try_sub(r, modulus);
+}
+#endif
+
+void fprime_mul(uint8_t *r, const uint8_t *a, const uint8_t *b,
+		const uint8_t *modulus)
+{
+	int i;
+
+	memset(r, 0, FPRIME_SIZE);
+
+	for (i = prime_msb(modulus); i >= 0; i--) {
+		const uint8_t bit = (b[i >> 3] >> (i & 7)) & 1;
+		uint8_t plusa[FPRIME_SIZE];
+
+		shift_n_bits(r, 1);
+		raw_try_sub(r, modulus);
+
+		fprime_copy(plusa, r);
+		fprime_add(plusa, a, modulus);
+
+		fprime_select(r, r, plusa, bit);
+	}
+}
+
+#ifdef FULL_C25519_CODE
+void fprime_inv(uint8_t *r, const uint8_t *a, const uint8_t *modulus)
+{
+	uint8_t pm2[FPRIME_SIZE];
+	uint16_t c = 2;
+	int i;
+
+	/* Compute (p-2) */
+	fprime_copy(pm2, modulus);
+	for (i = 0; i < FPRIME_SIZE; i++) {
+		c = modulus[i] - c;
+		pm2[i] = c;
+		c >>= 8;
+	}
+
+	/* Binary exponentiation */
+	fprime_load(r, 1);
+
+	for (i = prime_msb(modulus); i >= 0; i--) {
+		uint8_t r2[FPRIME_SIZE];
+
+		fprime_mul(r2, r, r, modulus);
+
+		if ((pm2[i >> 3] >> (i & 7)) & 1)
+			fprime_mul(r, r2, a, modulus);
+		else
+			fprime_copy(r, r2);
+	}
+}
+#endif
+#endif

package/external/libedhoc/externals/compact25519/src/c25519/fprime.h

@@ -0,0 +1,81 @@
+/* Arithmetic in prime fields
+ * Daniel Beer <dlbeer@gmail.com>, 10 Jan 2014
+ *
+ * This file is in the public domain.
+ */
+
+#ifndef FPRIME_H_
+#define FPRIME_H_
+
+#ifndef COMPACT_DISABLE_ED25519
+#include <stdint.h>
+#include <string.h>
+
+/* Maximum size of a field element (or a prime). Field elements are
+ * always manipulated and stored in normalized form, with 0 <= x < p.
+ * You can use normalize() to convert a denormalized bitstring to normal
+ * form.
+ *
+ * Operations are constant with respect to the value of field elements,
+ * but not with respect to the modulus.
+ *
+ * The modulus is a number p, such that 2p-1 fits in FPRIME_SIZE bytes.
+ */
+#define FPRIME_SIZE  32
+
+#ifdef FULL_C25519_CODE
+/* Useful constants */
+extern const uint8_t fprime_zero[FPRIME_SIZE];
+extern const uint8_t fprime_one[FPRIME_SIZE];
+#endif
+
+#ifdef FULL_C25519_CODE
+/* Load a small constant */
+void fprime_load(uint8_t *x, uint32_t c);
+#endif
+
+/* Load a large constant */
+void fprime_from_bytes(uint8_t *n,
+		       const uint8_t *x, size_t len,
+		       const uint8_t *modulus);
+
+/* Copy an element */
+static inline void fprime_copy(uint8_t *x, const uint8_t *a)
+{
+	memcpy(x, a, FPRIME_SIZE);
+}
+
+#ifdef FULL_C25519_CODE
+/* Normalize a field element */
+void fprime_normalize(uint8_t *x, const uint8_t *modulus);
+
+/* Compare two field points in constant time. Return one if equal, zero
+ * otherwise. This should be performed only on normalized values.
+ */
+uint8_t fprime_eq(const uint8_t *x, const uint8_t *y);
+
+#endif
+/* Conditional copy. If condition == 0, then zero is copied to dst. If
+ * condition == 1, then one is copied to dst. Any other value results in
+ * undefined behaviour.
+ */
+void fprime_select(uint8_t *dst,
+		   const uint8_t *zero, const uint8_t *one,
+		   uint8_t condition);
+
+/* Add one value to another. The two pointers must be distinct. */
+void fprime_add(uint8_t *r, const uint8_t *a, const uint8_t *modulus);
+#ifdef FULL_C25519_CODE
+void fprime_sub(uint8_t *r, const uint8_t *a, const uint8_t *modulus);
+#endif
+
+/* Multiply two values to get a third. r must be distinct from a and b */
+void fprime_mul(uint8_t *r, const uint8_t *a, const uint8_t *b,
+		const uint8_t *modulus);
+
+#ifdef FULL_C25519_CODE
+/* Compute multiplicative inverse. r must be distinct from a */
+void fprime_inv(uint8_t *r, const uint8_t *a, const uint8_t *modulus);
+#endif
+#endif
+#endif

package/external/libedhoc/externals/compact25519/src/c25519/sha512.c

@@ -0,0 +1,230 @@
+/* SHA512
+ * Daniel Beer <dlbeer@gmail.com>, 22 Apr 2014
+ *
+ * This file is in the public domain.
+ */
+
+#include "sha512.h"
+
+#if !defined(COMPACT_DISABLE_ED25519) || !defined(COMPACT_DISABLE_X25519_DERIVE)
+const struct sha512_state sha512_initial_state = { {
+	0x6a09e667f3bcc908LL, 0xbb67ae8584caa73bLL,
+	0x3c6ef372fe94f82bLL, 0xa54ff53a5f1d36f1LL,
+	0x510e527fade682d1LL, 0x9b05688c2b3e6c1fLL,
+	0x1f83d9abfb41bd6bLL, 0x5be0cd19137e2179LL,
+} };
+
+static const uint64_t round_k[80] = {
+	0x428a2f98d728ae22LL, 0x7137449123ef65cdLL,
+	0xb5c0fbcfec4d3b2fLL, 0xe9b5dba58189dbbcLL,
+	0x3956c25bf348b538LL, 0x59f111f1b605d019LL,
+	0x923f82a4af194f9bLL, 0xab1c5ed5da6d8118LL,
+	0xd807aa98a3030242LL, 0x12835b0145706fbeLL,
+	0x243185be4ee4b28cLL, 0x550c7dc3d5ffb4e2LL,
+	0x72be5d74f27b896fLL, 0x80deb1fe3b1696b1LL,
+	0x9bdc06a725c71235LL, 0xc19bf174cf692694LL,
+	0xe49b69c19ef14ad2LL, 0xefbe4786384f25e3LL,
+	0x0fc19dc68b8cd5b5LL, 0x240ca1cc77ac9c65LL,
+	0x2de92c6f592b0275LL, 0x4a7484aa6ea6e483LL,
+	0x5cb0a9dcbd41fbd4LL, 0x76f988da831153b5LL,
+	0x983e5152ee66dfabLL, 0xa831c66d2db43210LL,
+	0xb00327c898fb213fLL, 0xbf597fc7beef0ee4LL,
+	0xc6e00bf33da88fc2LL, 0xd5a79147930aa725LL,
+	0x06ca6351e003826fLL, 0x142929670a0e6e70LL,
+	0x27b70a8546d22ffcLL, 0x2e1b21385c26c926LL,
+	0x4d2c6dfc5ac42aedLL, 0x53380d139d95b3dfLL,
+	0x650a73548baf63deLL, 0x766a0abb3c77b2a8LL,
+	0x81c2c92e47edaee6LL, 0x92722c851482353bLL,
+	0xa2bfe8a14cf10364LL, 0xa81a664bbc423001LL,
+	0xc24b8b70d0f89791LL, 0xc76c51a30654be30LL,
+	0xd192e819d6ef5218LL, 0xd69906245565a910LL,
+	0xf40e35855771202aLL, 0x106aa07032bbd1b8LL,
+	0x19a4c116b8d2d0c8LL, 0x1e376c085141ab53LL,
+	0x2748774cdf8eeb99LL, 0x34b0bcb5e19b48a8LL,
+	0x391c0cb3c5c95a63LL, 0x4ed8aa4ae3418acbLL,
+	0x5b9cca4f7763e373LL, 0x682e6ff3d6b2b8a3LL,
+	0x748f82ee5defb2fcLL, 0x78a5636f43172f60LL,
+	0x84c87814a1f0ab72LL, 0x8cc702081a6439ecLL,
+	0x90befffa23631e28LL, 0xa4506cebde82bde9LL,
+	0xbef9a3f7b2c67915LL, 0xc67178f2e372532bLL,
+	0xca273eceea26619cLL, 0xd186b8c721c0c207LL,
+	0xeada7dd6cde0eb1eLL, 0xf57d4f7fee6ed178LL,
+	0x06f067aa72176fbaLL, 0x0a637dc5a2c898a6LL,
+	0x113f9804bef90daeLL, 0x1b710b35131c471bLL,
+	0x28db77f523047d84LL, 0x32caab7b40c72493LL,
+	0x3c9ebe0a15c9bebcLL, 0x431d67c49c100d4cLL,
+	0x4cc5d4becb3e42b6LL, 0x597f299cfc657e2aLL,
+	0x5fcb6fab3ad6faecLL, 0x6c44198c4a475817LL,
+};
+
+static inline uint64_t load64(const uint8_t *x)
+{
+	uint64_t r;
+
+	r = *(x++);
+	r = (r << 8) | *(x++);
+	r = (r << 8) | *(x++);
+	r = (r << 8) | *(x++);
+	r = (r << 8) | *(x++);
+	r = (r << 8) | *(x++);
+	r = (r << 8) | *(x++);
+	r = (r << 8) | *(x++);
+
+	return r;
+}
+
+static inline void store64(uint8_t *x, uint64_t v)
+{
+	x += 7;
+	*(x--) = v;
+	v >>= 8;
+	*(x--) = v;
+	v >>= 8;
+	*(x--) = v;
+	v >>= 8;
+	*(x--) = v;
+	v >>= 8;
+	*(x--) = v;
+	v >>= 8;
+	*(x--) = v;
+	v >>= 8;
+	*(x--) = v;
+	v >>= 8;
+	*(x--) = v;
+}
+
+static inline uint64_t rot64(uint64_t x, int bits)
+{
+	return (x >> bits) | (x << (64 - bits));
+}
+
+void sha512_block(struct sha512_state *s, const uint8_t *blk)
+{
+	uint64_t w[16];
+	uint64_t a, b, c, d, e, f, g, h;
+	int i;
+
+	for (i = 0; i < 16; i++) {
+		w[i] = load64(blk);
+		blk += 8;
+	}
+
+	/* Load state */
+	a = s->h[0];
+	b = s->h[1];
+	c = s->h[2];
+	d = s->h[3];
+	e = s->h[4];
+	f = s->h[5];
+	g = s->h[6];
+	h = s->h[7];
+
+	for (i = 0; i < 80; i++) {
+		/* Compute value of w[i + 16]. w[wrap(i)] is currently w[i] */
+		const uint64_t wi = w[i & 15];
+		const uint64_t wi15 = w[(i + 1) & 15];
+		const uint64_t wi2 = w[(i + 14) & 15];
+		const uint64_t wi7 = w[(i + 9) & 15];
+		const uint64_t s0 =
+			rot64(wi15, 1) ^ rot64(wi15, 8) ^ (wi15 >> 7);
+		const uint64_t s1 =
+			rot64(wi2, 19) ^ rot64(wi2, 61) ^ (wi2 >> 6);
+
+		/* Round calculations */
+		const uint64_t S0 = rot64(a, 28) ^ rot64(a, 34) ^ rot64(a, 39);
+		const uint64_t S1 = rot64(e, 14) ^ rot64(e, 18) ^ rot64(e, 41);
+		const uint64_t ch = (e & f) ^ ((~e) & g);
+		const uint64_t temp1 = h + S1 + ch + round_k[i] + wi;
+		const uint64_t maj = (a & b) ^ (a & c) ^ (b & c);
+		const uint64_t temp2 = S0 + maj;
+
+		/* Update round state */
+		h = g;
+		g = f;
+		f = e;
+		e = d + temp1;
+		d = c;
+		c = b;
+		b = a;
+		a = temp1 + temp2;
+
+		/* w[wrap(i)] becomes w[i + 16] */
+		w[i & 15] = wi + s0 + wi7 + s1;
+	}
+
+	/* Store state */
+	s->h[0] += a;
+	s->h[1] += b;
+	s->h[2] += c;
+	s->h[3] += d;
+	s->h[4] += e;
+	s->h[5] += f;
+	s->h[6] += g;
+	s->h[7] += h;
+}
+
+void sha512_final(struct sha512_state *s, const uint8_t *blk,
+		  size_t total_size)
+{
+	uint8_t temp[SHA512_BLOCK_SIZE] = {0};
+	const size_t last_size = total_size & (SHA512_BLOCK_SIZE - 1);
+
+	if (last_size)
+		memcpy(temp, blk, last_size);
+	temp[last_size] = 0x80;
+
+	if (last_size > 111) {
+		sha512_block(s, temp);
+		memset(temp, 0, sizeof(temp));
+	}
+
+	/* Note: we assume total_size fits in 61 bits */
+	store64(temp + SHA512_BLOCK_SIZE - 8, total_size << 3);
+	sha512_block(s, temp);
+}
+
+void sha512_get(const struct sha512_state *s, uint8_t *hash,
+		unsigned int offset, unsigned int len)
+{
+	int i;
+
+	if (offset > SHA512_BLOCK_SIZE)
+		return;
+
+	if (len > SHA512_BLOCK_SIZE - offset)
+		len = SHA512_BLOCK_SIZE - offset;
+
+	/* Skip whole words */
+	i = offset >> 3;
+	offset &= 7;
+
+	/* Skip/read out bytes */
+	if (offset) {
+		uint8_t tmp[8];
+		unsigned int c = 8 - offset;
+
+		if (c > len)
+			c = len;
+
+		store64(tmp, s->h[i++]);
+		memcpy(hash, tmp + offset, c);
+		len -= c;
+		hash += c;
+	}
+
+	/* Read out whole words */
+	while (len >= 8) {
+		store64(hash, s->h[i++]);
+		hash += 8;
+		len -= 8;
+	}
+
+	/* Read out bytes */
+	if (len) {
+		uint8_t tmp[8];
+
+		store64(tmp, s->h[i]);
+		memcpy(hash, tmp, len);
+	}
+}
+#endif

package/external/libedhoc/externals/compact25519/src/c25519/sha512.h

@@ -0,0 +1,54 @@
+/* SHA512
+ * Daniel Beer <dlbeer@gmail.com>, 22 Apr 2014
+ *
+ * This file is in the public domain.
+ */
+
+#ifndef SHA512_H_
+#define SHA512_H_
+
+#if !defined(COMPACT_DISABLE_ED25519) || !defined(COMPACT_DISABLE_X25519_DERIVE)
+#include <stdint.h>
+#include <stddef.h>
+#include <string.h>
+
+/* SHA512 state. State is updated as data is fed in, and then the final
+ * hash can be read out in slices.
+ *
+ * Data is fed in as a sequence of full blocks terminated by a single
+ * partial block.
+ */
+struct sha512_state {
+	uint64_t  h[8];
+};
+
+/* Initial state */
+extern const struct sha512_state sha512_initial_state;
+
+/* Set up a new context */
+static inline void sha512_init(struct sha512_state *s)
+{
+	memcpy(s, &sha512_initial_state, sizeof(*s));
+}
+
+/* Feed a full block in */
+#define SHA512_BLOCK_SIZE  128
+
+void sha512_block(struct sha512_state *s, const uint8_t *blk);
+
+/* Feed the last partial block in. The total stream size must be
+ * specified. The size of the block given is assumed to be (total_size %
+ * SHA512_BLOCK_SIZE). This might be zero, but you still need to call
+ * this function to terminate the stream.
+ */
+void sha512_final(struct sha512_state *s, const uint8_t *blk,
+		  size_t total_size);
+
+/* Fetch a slice of the hash result. */
+#define SHA512_HASH_SIZE  64
+
+void sha512_get(const struct sha512_state *s, uint8_t *hash,
+		unsigned int offset, unsigned int len);
+
+#endif
+#endif