15

Randomness is a measurable, statistical property of a set of values. It doesn't mean the same as "hard for a human to guess." Your sample string is hard for a human to guess, but it isn't very random. There is a tool called "ent" for most Unix systems that can quantify the randomness, by some measures, of a file. Available here: https://...


6

PRGs get an input (seed) and generates a larger output value than the input. Indeed. The standard definition of a PRG makes it a deterministic polynomial-time algorithm with input a seed in $\{0,1\}^n$ and output in $\{0,1\}^{\ell(n)}$ with $\forall n, \ell(n)>n$; and an other characteristic (pseudorandomness). is it possible that some outputs will ...


3

The usual definition for the Blum-Blum-Shub (BBS) generator goes as follows: Let $N$ be a Blum-Integer of unknown factorization. Let $j$ be the "extraction rate". Let $x_0$ be a uniformly random non-negative integer smaller than $N$. Define $x_{i+1}=x_{i}^2\bmod N$. For a request of $M=jk$ random bits, compute all $x_i$ up until at least $x_k$ and ...


2

I only found this: n sollte hinreichend groß sein; für kryptografische Anwendung mindestens etwa 200 Dezimalstellen. (German Wikipedia) which translated means as much as n should be sufficiently large; for cryptographic application at least about 200 decimal digits. This was added in 15th September 2008 before that it has been 100 digits. So I would ...


2

Yes, this is possible, see for example this paper from ETH Zurich and Carnegie Mellon University. We propose D-RaNGe, a mechanism for extracting true random numbers with high throughput from unmodied commodity DRAM devices on any system that allows ma- nipulation of DRAM timing parameters in the memory con- troller. D-RaNGe harvests fully non-deterministic ...


Only top voted, non community-wiki answers of a minimum length are eligible