Supplementary information

Chaotic oscillation and randomnumber generation based on nanoscale optical energy transfer

Makoto Naruse,1,* Song-Ju Kim,2 Masashi Aono,3,4 Hirokazu Hori5 and Motoichi Ohtsu6

1 Photonic Network Research Institute, National Institute of Information and Communications Technology, 4-2-1 Nukui-kita, Koganei, Tokyo 184-8795, Japan

2 WPI Center for Materials Nanoarchitectonics, National Institute for Materials Science, 1-1 Namiki, Tsukuba, Ibaraki 305-0044, Japan

3 Earth-Life Science Institute, Tokyo Institute of Technology,2-12-1 Ookayama, Meguru-ku, Tokyo 152-8550, Japan

4 PRESTO, Japan Science and Technology Agency, 4-1-8 Honcho, Kawaguchi-shi, Saitama 332-0012, Japan

5 Interdisciplinary Graduate School of Medicine and Engineering, University of Yamanashi, 4-3-11 Takeda, Kofu, Yamanashi 400-8511, Japan

6 Department of Electrical Engineering and Information Systems, Graduate School of Engineering, The University of Tokyo, 2-11-16 Yayoi, Bunkyo-ku, Tokyo 113-8656, Japan

Summary of the Improved FIPS test46, 47

(1) The monobit test

1. Count the number of ones in the 2500-bit stream. Denote this quantity by X.

2. The test is passed if 1185 < X < 1315.

(2) The poker test

  1. Divide the 2500-bit stream into 625 consecutive 4-bit segments. Count and store the number of occurrences of the 16 possible 4-bit values. Denote the number of each 4-bit value as, where i ranges from 0 to 15.

2. Evaluate the following:

The test is passed if 4.6 < X< 32.8.

(3) The runs test

  1. A run is defined as a maximalsequence of consecutive bits of either all zeroes (0 run) or all ones (1 run) that are part of the 2500-bit stream. Count the number of runs (0 runs and 1 runs) in the 2500-bit stream. Denote this quantity by X.
  2. The test is passed if .Here, ,, , and (numberof 1s)/2500.

(4) The long-runs test

  1. On the sample of 2500 bits, a long run is defined to be a run of length 17 or more.
  2. The test is passed if there are no long runs.

1