| 摘要 |
A random number generator utilizes nonlinear function to obtain high generating speed, long cycle and great quality. By utilizing equation (1): xt+1=4xt(1-xt) to perform the steps of setting a binary integer having N bits (N≧2 and N is an integer) as an initial value; transforming a binary sequence having N bits into an integer of 2m) carry number having [((N-1)/m)]+1 digits (m≧1 and m is an integer; inputting to a chaos computing unit having calculating precision with N bits and calculation result with 2N bits; utilizing the chaos computing unit to generate a binary sequence d(d0d1 . . . d2N-1) with 2N bits; and setting fore-N bits of a result with 2N bits d(d0d1 . . . d2N−4 as the input value a(a0a1 . . . aN-1) required for a repetitive calculation wherein a one-to-one excluding logical calculation (ri=di {circumflex over (+)} di+N) is performed between di and di+N, (i=0, 1, . . . N-1) and can obtain a result characterized in that outputting the random number r(r0r1 . . . rn-1).
|
