lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Wed, 6 Mar 2024 15:54:57 -0600
From: Jeremy Linton <jeremy.linton@....com>
To: Arnd Bergmann <arnd@...db.de>, Kees Cook <keescook@...omium.org>
Cc: linux-arm-kernel@...ts.infradead.org,
 Catalin Marinas <catalin.marinas@....com>, Will Deacon <will@...nel.org>,
 "Jason A . Donenfeld" <Jason@...c4.com>,
 "Gustavo A. R. Silva" <gustavoars@...nel.org>,
 Mark Rutland <mark.rutland@....com>, Steven Rostedt <rostedt@...dmis.org>,
 Mark Brown <broonie@...nel.org>, Guo Hui <guohui@...ontech.com>,
 Manoj.Iyer@....com, linux-kernel@...r.kernel.org,
 linux-hardening@...r.kernel.org, James Yang <james.yang@....com>,
 Shiyou Huang <shiyou.huang@....com>
Subject: Re: [PATCH 1/1] arm64: syscall: Direct PRNG kstack randomization

Hi,

On 3/6/24 14:46, Arnd Bergmann wrote:
> On Wed, Mar 6, 2024, at 00:33, Kees Cook wrote:
>> On Tue, Mar 05, 2024 at 04:18:24PM -0600, Jeremy Linton wrote:
>>> The existing arm64 stack randomization uses the kernel rng to acquire
>>> 5 bits of address space randomization. This is problematic because it
>>> creates non determinism in the syscall path when the rng needs to be
>>> generated or reseeded. This shows up as large tail latencies in some
>>> benchmarks and directly affects the minimum RT latencies as seen by
>>> cyclictest.
>>>
>>> Other architectures are using timers/cycle counters for this function,
>>> which is sketchy from a randomization perspective because it should be
>>> possible to estimate this value from knowledge of the syscall return
>>> time, and from reading the current value of the timer/counters.
> 
> As I commented on the previous version, I don't want to see
> a change that only addresses one architecture like this. If you
> are convinced that using a cycle counter is a mistake, then we
> should do the same thing on the other architectures as well
> that currently use a cycle counter.

I personally tend to agree as long as we aren't creating a similar set 
of problems for those architectures as we are seeing on arm. Currently 
the kstack rng on/off choice is basically zero overhead for them.

> 
>>> +#ifdef CONFIG_RANDOMIZE_KSTACK_OFFSET
>>> +DEFINE_PER_CPU(struct rnd_state, kstackrng);
>>> +
>>> +static u16 kstack_rng(void)
>>> +{
>>> +	u32 rng = prandom_u32_state(this_cpu_ptr(&kstackrng));
>>> +
>>> +	return rng & 0x1ff;
>>> +}
>>> +
>>> +/* Should we reseed? */
>>> +static int kstack_rng_setup(unsigned int cpu)
>>> +{
>>> +	u32 rng_seed;
>>> +
>>> +	/* zero should be avoided as a seed */
>>> +	do {
>>> +		rng_seed = get_random_u32();
>>> +	} while (!rng_seed);
>>> +	prandom_seed_state(this_cpu_ptr(&kstackrng), rng_seed);
>>> +	return 0;
>>> +}
>>> +
>>> +static int kstack_init(void)
>>> +{
>>> +	int ret;
>>> +
>>> +	ret = cpuhp_setup_state(CPUHP_AP_ONLINE_DYN, "arm64/cpuinfo:kstackrandomize",
>>> +				kstack_rng_setup, NULL);
>>
>> This will run initial seeding, but don't we need to reseed this with
>> some kind of frequency?
> 
> Won't that defeat the purpose of the patch that was intended
> to make the syscall latency more predictable? At least the
> simpler approaches of reseeding from the kstack_rng()
> function itself would have this problem, deferring it to
> another context comes with a separate set of problems.

And that describes why I've not come up with an inline reseeding 
solution. Which of course isn't a problem on !arm if one just pushes a 
few bits of a cycle counter into the rnd_state every few dozen syscalls, 
or whatever. Mark R, mentioned offline the idea of just picking a few 
bits off CNTVCT as a seed, but its so slow it basically has to be used 
to fuzz a bit or two of rnd_state on some fairly long interval. Long 
enough that if someone has a solution for extracting rnd_state it might 
not add any additional security. Or that is my take, since i'm not a big 
fan of any independent counter/clock based RNG seeding (AFAIK, entropy 
from clocks requires multiple _independent_ sources).

This is a bit out of my wheelhouse, so I defer to anyone with a better 
feel or some actual data.

The best plan I have at the moment is just some deferred work to call 
kstack_rng_setup on some call or time based interval, which AFAIK isn't 
ideal for RT workloads which expect ~100% CPU isolation. Plus, that 
solution assumes we have some handle on how fast an attacker can extract 
kstackrng sufficiently to make predictions.

Again, thanks to everyone for looking at this,
Jeremy


Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ