Your question is funny, I'm curious to know how did you came to wonder that /dev/urandom could be predicted.
But more than that, this raise an interesting flaw, as Wikipedia mention it :
In 2004, Landon Curt Noll, Simon Cooper, and Mel Pleasant tested a variety of random number generators, including the /dev/random implementations in FreeBSD 5.2.1, Linux 2.4.21-20, Solaris 8 patch 108528-18, and Mac OS X 10.3.5.[7] They indicated that none of these /dev/random implementations were cryptographically secure because their outputs had uniformity flaws.
That said, I think it answers pretty well your question:
How much would that weaken a given encryption system?
I can't say how much, but I can say it would impact them significantly enough to not consider them as totally secure, because "none of these /dev/random implementations were cryptographically secure".
/dev/urandom. However, in practice that is not likely to be feasible (except possibly very soon after boot)./dev/urandom's internal state is purposely derived from values with a large amount of entropy, exactly to defend against this sort of brute-force attack. See http://security.stackexchange.com/a/3939/971. Consequently this answer seems inaccurate or misleading. – D.W. Mar 19 '15 at 22:25/dev/urandomhas been properly seeded, knowing some outputs doesn't help predict other outputs. However, if an attacker knew the outputs of/dev/urandomthat were used to create a keypair, then he would have everything you needed to re-derive that keypair himself and of course the crypto would become totally broken. (I assume the latter is not what the question is asking, but I mention it just for completeness.) – D.W. Mar 19 '15 at 22:26prandom_u32()system which is based on an LFSR. – forest Apr 12 '18 at 01:02