![]() Okay, lets take a look to the /dev/urandom. If not enough unknown bits are available, wait until enough are available. When random bits are requested, return that many bits derived from the entropy pool (by a cryptographic hash function, say) and decrement the estimate of the number of random bits remaining in the pool. ![]() The bits are calculated from user-triggered events (keystroke, disk I/O, mouse clicks etc dev/random is based on the entropy pool, which is compromised by random bits that are assumed to be unknown. Okay, before characterizing the problem and explaining the workarounds, Lets first start with /dev/random. I have faced with this incident in a Weblogic 10.3.6 environment running with 64 bit jdk 7 upgdate 5 on a Redhat Linux 6.3 64 bit system.
0 Comments
Leave a Reply. |