netdev - Re: [PATCH net] bpf: rather use get_random

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, 18 May 2016 06:20:34 -0700
From:	Eric Dumazet <eric.dumazet@...il.com>
To:	Daniel Borkmann <daniel@...earbox.net>
Cc:	davem@...emloft.net, hannes@...essinduktion.org,
	alexei.starovoitov@...il.com, netdev@...r.kernel.org
Subject: Re: [PATCH net] bpf: rather use get_random_int for randomizations

On Wed, 2016-05-18 at 14:14 +0200, Daniel Borkmann wrote:
> Start address randomization and blinding in BPF currently use
> prandom_u32(). prandom_u32() values are not exposed to unpriviledged
> user space to my knowledge, but given other kernel facilities such as
> ASLR, stack canaries, etc make use of stronger get_random_int(), we
> better make use of it here as well given blinding requests successively
> new random values. get_random_int() has minimal entropy pool depletion,
> is not cryptographically secure, but doesn't need to be for our use
> cases here.

Well, if it is not crypto secure, what is the point using it instead of
prandom_u32() ?

I do not think changing this is fundamentally changing something, it
looks like code churn or magic incantation to me.

There is little amount of entropy since the hole is constrained by
PAGE_SIZE. 

Have you had any report of an actual attack ?

If yes, we seriously need to reconsider this whole schem.