diff for duplicates of <20181015175424.97147-10-ebiggers@kernel.org> diff --git a/a/1.txt b/N1/1.txt index e830689..989c403 100644 --- a/a/1.txt +++ b/N1/1.txt @@ -1,6 +1,6 @@ From: Eric Biggers <ebiggers@google.com> -Add a generic implementation of NHPoly1305, an ε-almost-∆-universal hash +Add a generic implementation of NHPoly1305, an ?-almost-?-universal hash function used in the Adiantum encryption mode. CONFIG_NHPOLY1305 is not selectable by itself since there won't be any @@ -54,7 +54,7 @@ index 0000000000000..087ad7680dd62 @@ -0,0 +1,288 @@ +// SPDX-License-Identifier: GPL-2.0 +/* -+ * NHPoly1305 - ε-almost-∆-universal hash function for Adiantum ++ * NHPoly1305 - ?-almost-?-universal hash function for Adiantum + * + * Copyright 2018 Google LLC + */ @@ -63,15 +63,15 @@ index 0000000000000..087ad7680dd62 + * "NHPoly1305" is the main component of Adiantum hashing. + * Specifically, it is the calculation + * -+ * H_M ← Poly1305_{K_M}(NH_{K_N}(pad_{128}(M))) ++ * H_M ? Poly1305_{K_M}(NH_{K_N}(pad_{128}(M))) + * + * from the procedure in section A.5 of the Adiantum paper [1]. It is an -+ * ε-almost-∆-universal (εA∆U) hash function for equal-length inputs over -+ * Z/(2^{128}Z), where the "∆" operation is addition. It hashes 1024-byte ++ * ?-almost-?-universal (?A?U) hash function for equal-length inputs over ++ * Z/(2^{128}Z), where the "?" operation is addition. It hashes 1024-byte + * chunks of the input with the NH hash function [2], reducing the input length + * by 32x. The resulting NH digests are evaluated as a polynomial in + * GF(2^{130}-5), like in the Poly1305 MAC [3]. Note that the polynomial -+ * evaluation by itself would suffice to achieve the εA∆U property; NH is used ++ * evaluation by itself would suffice to achieve the ?A?U property; NH is used + * for performance since it's over twice as fast as Poly1305. + * + * This is *not* a cryptographic hash function; do not use it as such! @@ -335,7 +335,7 @@ index 0000000000000..087ad7680dd62 +module_init(nhpoly1305_mod_init); +module_exit(nhpoly1305_mod_exit); + -+MODULE_DESCRIPTION("NHPoly1305 ε-almost-∆-universal hash function"); ++MODULE_DESCRIPTION("NHPoly1305 ?-almost-?-universal hash function"); +MODULE_LICENSE("GPL v2"); +MODULE_AUTHOR("Eric Biggers <ebiggers@google.com>"); +MODULE_ALIAS_CRYPTO("nhpoly1305"); @@ -1649,7 +1649,7 @@ index 0000000000000..06bfb876a1563 +#define NH_PAIR_STRIDE 2 +#define NH_MESSAGE_UNIT (NH_PAIR_STRIDE * 2 * sizeof(u32)) + -+/* Num passes (Toeplitz iteration count): 4, to give ε = 2^{-128} */ ++/* Num passes (Toeplitz iteration count): 4, to give ? = 2^{-128} */ +#define NH_NUM_PASSES 4 +#define NH_HASH_BYTES (NH_NUM_PASSES * sizeof(u64)) + diff --git a/a/content_digest b/N1/content_digest index b3ca424..49d3bfd 100644 --- a/a/content_digest +++ b/N1/content_digest @@ -1,23 +1,13 @@ "ref\020181015175424.97147-1-ebiggers@kernel.org\0" - "From\0Eric Biggers <ebiggers@kernel.org>\0" + "From\0ebiggers@kernel.org (Eric Biggers)\0" "Subject\0[RFC PATCH v2 09/12] crypto: nhpoly1305 - add NHPoly1305 support\0" "Date\0Mon, 15 Oct 2018 10:54:21 -0700\0" - "To\0linux-crypto@vger.kernel.org\0" - "Cc\0linux-fscrypt@vger.kernel.org" - linux-arm-kernel@lists.infradead.org - linux-kernel@vger.kernel.org - Herbert Xu <herbert@gondor.apana.org.au> - Paul Crowley <paulcrowley@google.com> - Greg Kaiser <gkaiser@google.com> - Michael Halcrow <mhalcrow@google.com> - Jason A . Donenfeld <Jason@zx2c4.com> - Samuel Neves <samuel.c.p.neves@gmail.com> - " Tomer Ashur <tomer.ashur@esat.kuleuven.be>\0" + "To\0linux-arm-kernel@lists.infradead.org\0" "\00:1\0" "b\0" "From: Eric Biggers <ebiggers@google.com>\n" "\n" - "Add a generic implementation of NHPoly1305, an \316\265-almost-\342\210\206-universal hash\n" + "Add a generic implementation of NHPoly1305, an ?-almost-?-universal hash\n" "function used in the Adiantum encryption mode.\n" "\n" "CONFIG_NHPOLY1305 is not selectable by itself since there won't be any\n" @@ -71,7 +61,7 @@ "@@ -0,0 +1,288 @@\n" "+// SPDX-License-Identifier: GPL-2.0\n" "+/*\n" - "+ * NHPoly1305 - \316\265-almost-\342\210\206-universal hash function for Adiantum\n" + "+ * NHPoly1305 - ?-almost-?-universal hash function for Adiantum\n" "+ *\n" "+ * Copyright 2018 Google LLC\n" "+ */\n" @@ -80,15 +70,15 @@ "+ * \"NHPoly1305\" is the main component of Adiantum hashing.\n" "+ * Specifically, it is the calculation\n" "+ *\n" - "+ *\tH_M \342\206\220 Poly1305_{K_M}(NH_{K_N}(pad_{128}(M)))\n" + "+ *\tH_M ? Poly1305_{K_M}(NH_{K_N}(pad_{128}(M)))\n" "+ *\n" "+ * from the procedure in section A.5 of the Adiantum paper [1]. It is an\n" - "+ * \316\265-almost-\342\210\206-universal (\316\265A\342\210\206U) hash function for equal-length inputs over\n" - "+ * Z/(2^{128}Z), where the \"\342\210\206\" operation is addition. It hashes 1024-byte\n" + "+ * ?-almost-?-universal (?A?U) hash function for equal-length inputs over\n" + "+ * Z/(2^{128}Z), where the \"?\" operation is addition. It hashes 1024-byte\n" "+ * chunks of the input with the NH hash function [2], reducing the input length\n" "+ * by 32x. The resulting NH digests are evaluated as a polynomial in\n" "+ * GF(2^{130}-5), like in the Poly1305 MAC [3]. Note that the polynomial\n" - "+ * evaluation by itself would suffice to achieve the \316\265A\342\210\206U property; NH is used\n" + "+ * evaluation by itself would suffice to achieve the ?A?U property; NH is used\n" "+ * for performance since it's over twice as fast as Poly1305.\n" "+ *\n" "+ * This is *not* a cryptographic hash function; do not use it as such!\n" @@ -352,7 +342,7 @@ "+module_init(nhpoly1305_mod_init);\n" "+module_exit(nhpoly1305_mod_exit);\n" "+\n" - "+MODULE_DESCRIPTION(\"NHPoly1305 \316\265-almost-\342\210\206-universal hash function\");\n" + "+MODULE_DESCRIPTION(\"NHPoly1305 ?-almost-?-universal hash function\");\n" "+MODULE_LICENSE(\"GPL v2\");\n" "+MODULE_AUTHOR(\"Eric Biggers <ebiggers@google.com>\");\n" "+MODULE_ALIAS_CRYPTO(\"nhpoly1305\");\n" @@ -1666,7 +1656,7 @@ "+#define NH_PAIR_STRIDE\t\t2\n" "+#define NH_MESSAGE_UNIT\t\t(NH_PAIR_STRIDE * 2 * sizeof(u32))\n" "+\n" - "+/* Num passes (Toeplitz iteration count): 4, to give \316\265 = 2^{-128} */\n" + "+/* Num passes (Toeplitz iteration count): 4, to give ? = 2^{-128} */\n" "+#define NH_NUM_PASSES\t\t4\n" "+#define NH_HASH_BYTES\t\t(NH_NUM_PASSES * sizeof(u64))\n" "+\n" @@ -1723,4 +1713,4 @@ "-- \n" 2.19.1.331.ge82ca0e54c-goog -3fcf6af8b6c3761f3653d53bde3ab0afee2d7a36094fd168abe77d9e1c837fa9 +8ccbf5ec97becb0cef2d9d771692985ab864cc4b7bb05a5575d2d260860aca83
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.