From: Eric Biggers <ebiggers@kernel.org>
To: "Jason A. Donenfeld" <Jason@zx2c4.com>
Cc: linux-kernel@vger.kernel.org, linux-crypto@vger.kernel.org,
Theodore Ts'o <tytso@mit.edu>,
Dominik Brodowski <linux@dominikbrodowski.net>,
Greg Kroah-Hartman <gregkh@linuxfoundation.org>,
Jean-Philippe Aumasson <jeanphilippe.aumasson@gmail.com>
Subject: Re: [PATCH v2 3/4] random: use linear min-entropy accumulation crediting
Date: Fri, 4 Feb 2022 23:00:30 -0800 [thread overview]
Message-ID: <Yf4gjpiGmKzZCnwi@sol.localdomain> (raw)
In-Reply-To: <20220204135325.8327-4-Jason@zx2c4.com>
On Fri, Feb 04, 2022 at 02:53:24PM +0100, Jason A. Donenfeld wrote:
> What if we're wrong and the above is nonsense? It's not, but let's
> assume we don't want the actual _behavior_ of the code to change much.
> Currently that behavior is not extracting from the input pool until it
> has 128 bits of entropy in it. With the old algorithm, we'd hit that
> magic 128 number after roughly 256 calls to credit_entropy_bits(1). So,
> we can retain more or less the old behavior by waiting to extract from
> the input pool until it hits 256 bits of entropy using the new code. For
> people concerned about this change, it means that there's not that much
> practical behavioral change. And for folks actually trying to model
> the behavior rigorously, it means that we have an even higher margin
> against attacks.
I tested this, and it actually was 205 calls prior to patch 1 in this series,
and 267 calls after patch 1. That's in contrast to 256 calls after this patch.
Not a big difference, but this is going to result in ~25% more single-bit calls
being needed compared to the old version. It's unclear whether you're arguing
that's basically the same, or whether you thought it was a smaller difference.
> +enum {
> POOL_BITS = BLAKE2S_HASH_SIZE * 8,
> - POOL_BITSHIFT = ilog2(POOL_BITS),
> - POOL_MIN_BITS = POOL_BITS / 2,
> -
> - /* To allow fractional bits to be tracked, the entropy_count field is
> - * denominated in units of 1/8th bits. */
> - POOL_ENTROPY_SHIFT = 3,
> -#define POOL_ENTROPY_BITS() (input_pool.entropy_count >> POOL_ENTROPY_SHIFT)
> - POOL_FRACBITS = POOL_BITS << POOL_ENTROPY_SHIFT,
> - POOL_MIN_FRACBITS = POOL_MIN_BITS << POOL_ENTROPY_SHIFT
> + POOL_MIN_BITS = POOL_BITS /* No point in settling for less. */
> };
Doesn't the default value of random_write_wakeup_bits need to be increased to
this value? Otherwise, the pool can get stuck with entropy_count greater than
or equal to random_write_wakeup_bits (192) but less than POOL_MIN_BITS (256).
In fact, the only correct value of random_write_wakeup_bits will be 256, i.e.
the entire pool. Perhaps it should no longer be configurable via /proc/sys?
Note that there's also an off-by one bug that will need to be fixed:
add_hwgenerator_randomness() checks entropy_count <= random_write_wakeup_bits
rather than entropy_count < random_write_wakeup_bits as random_poll() does.
Also: given all these considerations, perhaps the increase in POOL_MIN_BITS is
best done in a separate patch?
> + do {
> + entropy_count = orig = READ_ONCE(input_pool.entropy_count);
> + entropy_count = min(POOL_BITS, entropy_count + nbits);
> + } while (cmpxchg(&input_pool.entropy_count, orig, entropy_count) != orig);
This can be simplified slightly:
do {
orig = READ_ONCE(input_pool.entropy_count);
entropy_count = min(POOL_BITS, orig + nbits);
} while (cmpxchg(&input_pool.entropy_count, orig, entropy_count) != orig);
- Eric
next prev parent reply other threads:[~2022-02-05 7:00 UTC|newest]
Thread overview: 13+ messages / expand[flat|nested] mbox.gz Atom feed top
2022-02-04 13:53 [PATCH v2 0/4] random: use computational hash for entropy extraction, and related fixes Jason A. Donenfeld
2022-02-04 13:53 ` [PATCH v2 1/4] random: use computational hash for entropy extraction Jason A. Donenfeld
2022-02-05 8:23 ` Dominik Brodowski
2022-02-05 11:42 ` Jason A. Donenfeld
2022-02-05 11:43 ` Jason A. Donenfeld
2022-02-07 14:24 ` Jason A. Donenfeld
2022-02-04 13:53 ` [PATCH v2 2/4] random: simplify entropy debiting Jason A. Donenfeld
2022-02-05 7:18 ` Dominik Brodowski
2022-02-04 13:53 ` [PATCH v2 3/4] random: use linear min-entropy accumulation crediting Jason A. Donenfeld
2022-02-05 7:00 ` Eric Biggers [this message]
2022-02-05 12:54 ` Jason A. Donenfeld
2022-02-04 13:53 ` [PATCH v2 4/4] random: make credit_entropy_bits() always safe Jason A. Donenfeld
2022-02-05 7:21 ` Dominik Brodowski
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=Yf4gjpiGmKzZCnwi@sol.localdomain \
--to=ebiggers@kernel.org \
--cc=Jason@zx2c4.com \
--cc=gregkh@linuxfoundation.org \
--cc=jeanphilippe.aumasson@gmail.com \
--cc=linux-crypto@vger.kernel.org \
--cc=linux-kernel@vger.kernel.org \
--cc=linux@dominikbrodowski.net \
--cc=tytso@mit.edu \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox
all inboxes | Powered by JetHome®