# Tag Info

0

This is a very detailed description about creating random numbers and how to "distill" randomness from various sources into a single number. It is an older article, but it has its truths. A good way to get a single random number from various sources is concatenation-then-hash. Since you're doing this for fun, you don't really NEED to consider the minimum ...

1

For your questions 1 and 3, you want to know how to convert mouse movements into usable random numbers. Others have made good suggestions there. If the PuTTYGen comments are to be believed, one movement could contribute as much as 2 bits of uncertainty. As you have stated that this project is for fun, this seems like a good place to do an experiment of ...

1

Part 1 There are some methods to do it. Phrack magazine Get the last four bits from x, the last four from y, concatenate them, XOR them with the last 8 bits that you get from your system timer (or from the fastest timer you have available) are you using java? you can specify mouse movements to be a source of entropy what I would do: Get your ...

2

The PuTTYgen program, which is open source, contains the following comment in WINPGEN.C where it collects mouse movement for key generation: /* * My brief statistical tests on mouse movements * suggest that there are about 2.5 bits of * randomness in the x position, 2.5 in the y * position, and 1.7 in the message time, making * 5.7 bits of unpredictability ...

1

If you have access to microphone these papers describe a method to generate true random number. Nur Azman Abu and Zulkiflee Muslim, Random Number Generation for Cryptographic Key, Proceedings International Conference on Engineering and ICT, ICEI 2007, 27–28 November 2007, Melaka, Malaysia, Volume 1, pp 255–260. Nur Azman Abu and Zulkiflee ...

1

This paper gives (starting on page 3) a representation (described in the last paragraph of page 1) of irreducible polynomials over the binary field, and will suffice for generating the seed from sources that are less than 10000 bits long. $\:$ This paper gives a deterministic and provably efficient algorithm to find such polynomials, and can be used for ...

3

If you just need to generate random key material, I suggest a simpler solution: use the OS support for generating entropy. On Linux, read from /dev/urandom. On Windows, use CryptGenRandom. Search to find support on other platforms. If you're doing this in Javascript, read the following: Compatibility of window.crypto.getRandomValues() Generate ...

11

Evaluating a TRNG device positively requires knowing its structure, both to evaluate the actual amount of entropy it produces, and the possibility to detect a field failure. Some devices sold as TRNG are in fact a TRNG subsystem followed by a PRNG, which produces the output of the device. In that case, if the PRNG is any good, the output of the device may ...

Top 50 recent answers are included