crypto: aegis - Add generic AEGIS AEAD implementations

This patch adds the generic implementation of the AEGIS family of AEAD
algorithms (AEGIS-128, AEGIS-128L, and AEGIS-256). The original
authors of AEGIS are Hongjun Wu and Bart Preneel.

At the time of writing, AEGIS is one of the finalists in CAESAR, an
open competition intended to select a portfolio of alternatives to
the problematic AES-GCM:

https://competitions.cr.yp.to/caesar-submissions.html
https://competitions.cr.yp.to/round3/aegisv11.pdf

Signed-off-by: Ondrej Mosnacek <omosnacek@gmail.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>

1 files changed, 80 insertions, 0 deletions

diff --git a/crypto/aegis.h b/crypto/aegis.h
new file mode 100644
index 000000000000..f1c6900ddb80
--- /dev/null
+++ b/crypto/aegis.h
@@ -0,0 +1,80 @@
+/* SPDX-License-Identifier: GPL-2.0 */
+/*
+ * AEGIS common definitions
+ *
+ * Copyright (c) 2018 Ondrej Mosnacek <omosnacek@gmail.com>
+ * Copyright (c) 2018 Red Hat, Inc. All rights reserved.
+ *
+ * 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.
+ */
+
+#ifndef _CRYPTO_AEGIS_H
+#define _CRYPTO_AEGIS_H
+
+#include <crypto/aes.h>
+#include <linux/types.h>
+
+#define AEGIS_BLOCK_SIZE 16
+
+union aegis_block {
+        __le64 words64[AEGIS_BLOCK_SIZE / sizeof(__le64)];
+        u32 words32[AEGIS_BLOCK_SIZE / sizeof(u32)];
+        u8 bytes[AEGIS_BLOCK_SIZE];
+};
+
+#define AEGIS_BLOCK_ALIGN (__alignof__(union aegis_block))
+#define AEGIS_ALIGNED(p) IS_ALIGNED((uintptr_t)p, AEGIS_BLOCK_ALIGN)
+
+static const union aegis_block crypto_aegis_const[2] = {
+        { .words64 = {
+                cpu_to_le64(U64_C(0x0d08050302010100)),
+                cpu_to_le64(U64_C(0x6279e99059372215)),
+        } },
+        { .words64 = {
+                cpu_to_le64(U64_C(0xf12fc26d55183ddb)),
+                cpu_to_le64(U64_C(0xdd28b57342311120)),
+        } },
+};
+
+static void crypto_aegis_block_xor(union aegis_block *dst,
+                                   const union aegis_block *src)
+{
+        dst->words64[0] ^= src->words64[0];
+        dst->words64[1] ^= src->words64[1];
+}
+
+static void crypto_aegis_block_and(union aegis_block *dst,
+                                   const union aegis_block *src)
+{
+        dst->words64[0] &= src->words64[0];
+        dst->words64[1] &= src->words64[1];
+}
+
+static void crypto_aegis_aesenc(union aegis_block *dst,
+                                const union aegis_block *src,
+                                const union aegis_block *key)
+{
+        u32 *d = dst->words32;
+        const u8  *s  = src->bytes;
+        const u32 *k  = key->words32;
+        const u32 *t0 = crypto_ft_tab[0];
+        const u32 *t1 = crypto_ft_tab[1];
+        const u32 *t2 = crypto_ft_tab[2];
+        const u32 *t3 = crypto_ft_tab[3];
+        u32 d0, d1, d2, d3;
+
+        d0 = t0[s[ 0]] ^ t1[s[ 5]] ^ t2[s[10]] ^ t3[s[15]] ^ k[0];
+        d1 = t0[s[ 4]] ^ t1[s[ 9]] ^ t2[s[14]] ^ t3[s[ 3]] ^ k[1];
+        d2 = t0[s[ 8]] ^ t1[s[13]] ^ t2[s[ 2]] ^ t3[s[ 7]] ^ k[2];
+        d3 = t0[s[12]] ^ t1[s[ 1]] ^ t2[s[ 6]] ^ t3[s[11]] ^ k[3];
+
+        d[0] = d0;
+        d[1] = d1;
+        d[2] = d2;
+        d[3] = d3;
+}
+
+#endif /* _CRYPTO_AEGIS_H */