| Algorithm 1. Mobile RNG design algorithm pseudo code. |
| 1: Start |
| 2: Entering parameters and initial condition of the chaotic system |
| 3: Determination of the value of ∆h |
| 4: Sampling with determination ∆h value |
| 5: while (least 1 M. Bit data) do |
| 6: Solving the chaotic system with RK4 |
| 7: Convert float to binary number (32 bit) |
| 8: Select the bits (LSB-16 bit) from 32 bit binary number |
| 9: end while |
| 10: The implementation of NIST Tests for 1 M. Bit data |
| 11: if test results == pass then |
| 12: Successful results (Ready tested 1 M. Bit data) |
| 13: RNG applications (Cryptology, data hiding, watermarking, etc.) |
| 14: else (test results == false) |
| 15: return the previous steps and generate bits again |
| 16: end if |
| 17: End |