发明名称 |
Truth table candidate reduction for cellular automata based random number generators |
摘要 |
A system and a method to reduce a search space to determine viable cellular automata based random number generators (CA-based RNGs) are presented. A CA-based RNG is where an output of each cell of the CA at time t is dependent on inputs from any cells of the CA (including perhaps itself) at time t-1. The connections (or inputs) are selected to produce high entropy such that the RNG passes a standard suite of random number of tests, such as the DIEHARD suite. As the number of inputs grow (corresponding to the neighborhood size), the number of truth tables grows dramatically. By reducing the search space of viable CA-based RNGs, high quality random number generators with higher neighborhood sizes may be found.
|
申请公布号 |
US2003097387(A1) |
申请公布日期 |
2003.05.22 |
申请号 |
US20010977985 |
申请日期 |
2001.10.17 |
申请人 |
SHACKLEFORD J. BARRY;TANAKA MOTOO |
发明人 |
SHACKLEFORD J. BARRY;TANAKA MOTOO |
分类号 |
G06F7/58;(IPC1-7):G06F1/02 |
主分类号 |
G06F7/58 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|