Patent ID: 8655933

Claim:
A method for generating and managing random numbers, comprising steps of: an input circuit setting a binary series R with binary integer having N bits (N≧2 and N is an integer) and multi-dimensional coordinate information i for K dimensions (i 1 , . . . , ik, . . . , iK) (ik is an integer, and ik ≧0, k:1, 2, . . . , K), wherein R is a decimal portion of an initial value x 0 for a nonlinear function, x t+1 =4 x t (1−x t ) (hereinafter referred to as LMAP, 0<x t <1, t=0,1,2, . . . ), and said coordinate information i is then transformed into coordinate value of each dimension (i 1 , . . . , ik, . . . , iK) by a transforming circuit; and x 0 , i 1 , . . . , ik, . . . , iK are stored in a register; 1) according to the initial value x 0 and ik, an LMAP circuit implementing LMAP calculation having the accuracy of N bits through a fixed decimal point calculation, which is repeatedly done by chaos computing to generate N bits binary series B ik , and bits of B ik are individually constituted by b k·0 b k·1 . . . b k·N−1 , wherein b k·0 =[2×x N×i k ], b k ·1 =[2×x N×i k+1 ], . . . and b k·N−1 =[2×x N×i k+N−1 ], and [ ] represents a calculation of removing decimal portion; 2) a chaos computing circuit implementing the chaos computing on B ik as a decimal portion of the initial value x 0 after LMAP and repeatedly conducting calculation of the LMAP to generate and store an N bits binary series R i 1 , . . . , i k (when k=1, R i 1 , . . . , i k is R i 1 , . . . , i K ; and when k=K, R i 1 , . . . , i k is R i 1 , . . . , i K , wherein the bits of R i 1 , . . . , i k are individually constituted by r k·0 , r k·1 , . . . and r k·N−1 , and r k·0 =[2×x N ], r k·1 =[2×x N+1 ], . . . , r k·N−1 =[2×x 2N−1 ], which are stored in a random number register; 3) using said R i 1 , . . . , i k stored in the random number register as a decimal portion of initial value x 0 of the LMAP and storing it to said register; and a random number generation control circuit implementing the above operations 1), 2) and 3) as the order of k=1,2, . . . , K, but when k=K, operation 3) is stopped, and operation 2) is used to generate R i 1 , . . . , i K as random numbers.