Printer Friendly

True Random Number Generation from Bioelectrical and Physical Signals.

1. Introduction

Random numbers are needed in some areas in computer science, such as authentication, secret key generation, game theory, and simulations. In these applications, particularly numbers should have good statistical properties and be unpredictable and nonreproducible. The number generation in the literature is performed in two different ways as deterministic and nondeterministic [1, 2]. PRNGs (Pseudo Random Number Generators), which are deterministic random number generators, generate numbers with fast, easy, inexpensive, and hardware independent solutions. The statistical qualities of these numbers produced are close to the ideal. PRNGs must meet the requirements specified in Table 1 to be used especially for authentication and key generation [3-5]. Therefore, nondeterministic functions are added to the output functions of PRNGs to guarantee these requirements.

TRNGs (True Random Number Generators), which are nondeterministic random number generators, present slower, more expensive, and hardware-dependent solutions compared to PRNGs. Contrary to PRNGs, there is no need to include extra components in the TRNG system designs for R2, R3, and R4 requirements. Because of the unpredictability of random numbers generated by the use of high noise sources with high entropy in TRNGs, it is assumed that the R2 requirement is met. If the R2 requirement is satisfied, then it is assumed that the R3 and R4 requirements are also satisfied. To meet the R1 requirement in TRNGs, postprocessing techniques are applied on the random numbers obtained by sampling from noise sources. This eliminates the statistical weaknesses of random numbers at the output of the TRNG. In addition, postprocessing techniques eliminate potential weaknesses and make TRNG designs strong and flexible [6, 7].

Recently, there have been studies performed on random number generation from human-based noise sources [8-12]. Elham et al. showed that two different people would produce different random numbers and that these numbers could be used as biometric signatures [8]. Xingyuan et al. proposed a TRNG structure using a one-dimensional chaotic map based on mouse movements. The proposed structure showed that NIST tests were successful and could be used on personal PCs [9]. Hu et al. performed real random number generation by observing mouse movements of computer users. The statistical properties of the binary number generators generated from mouse movements of three different users were examined by the NIST test suite. Three chaos-based approaches were proposed to eliminate similar motions generated by the same user. Successful results were also achieved with these approaches [10]. Rahimi et al. used two different ECG signals for the cryptographic key generation and suggested two different approaches. The security analyses of keys obtained by both approaches were tested with distinctiveness, randomness, temporal variance, and NIST and successful results were obtained [11]. In the study performed by Chen et al. [12], random number generation was done from ECG signals and the analysis was tested by NIST test suite. It was revealed by the authors that the PRNG-based generated numbers had more successful results in classical PRNG structures. Dang et al. showed the possibility of random number generation from EEG signals. Four different EEG datasets were used to illustrate the use of obtained numbers in cryptography applications and their statistical properties were analyzed with the NIST test suite. In this PRNG-based approach, the samples consisting of EEG signals were transformed into 0 and 1 number generators. Mathematical definitions of the structure using modular arithmetic for the transformation of number generators were given. In the study, it was shown that EEG signals could be used for random number generation. The NIST test suite was used for this purpose and a success of higher than 99% was achieved [13]. In a study carried out by Chen et al. [14], the authors showed that EEG signals agreed with Gaussian distribution and also revealed whether random number could be generated from signals. They used the EEG signals obtained from both healthy and sick people for the PRNG number generation. They used NIST test suite for statistical analysis and they failed some tests. It was shown as a result of the study that the generated numbers could be used as a PRN. In a study done by Chen et al. [15], random number generation was performed by using white noise signals taken from MPEG-1, WEBCAM, and IPCAM video files and it was emphasized that successful results were obtained from statistical tests. Buhanuponp et al. proposed a new encoding method for random number generation using EEG signals. This number generator, which can be used in low cost and real applications, is based on TRNG. A success of 99.47% was obtained from statistical tests. It was revealed that it was possible to do simple and fast bit generation by encoding method [16]. The summary of the literature methods used for random number generation is shown in Table 2.

In this article, it was shown that it was possible to generate real random numbers from personally identifiable bioelectrical signals (EEG, EMG, and EOG) and physical information (blood volume pulse, GSR (Galvanic Skin Response), and respiration). The accuracy of random numbers obtained was analyzed by NIST SP 800-22, scale index, and autocorrelation tests that are commonly used in the literature and the results are given in tables. The contributions made to the literature in this article can be summarized as follows:

(1) It was shown that it was possible to generate personally identifiable random numbers.

(2) Random numbers were generated with the TRNG structure.

(3) It was revealed that random numbers can be generated by not only bioelectrical signals but also physical signals.

(4) The analyses of statistical properties were performed and successful results were obtained. Analyses were also performed by scale index and autocorrelation tests in addition to the NIST test.

The article is organized as follows to achieve the aim.

In the second section, the structures and properties of PRNG and TRNG are briefly explained. Moreover, the comparisons of these two structures are presented in tabular form. In the third section, bioelectrical and physical signals are briefly described and the properties of signals and the dataset used in the study are given. In the fourth section, the proposed TRNG structure, the normalization for number generation, and sampling and postprocessing operations are presented. The tests used for the statistical analysis of the numbers and the results obtained are tabulated in Section 5. In the last section of the article, the results are discussed and the suggestions are made about future works.

2. Random Number Generation Methods

Random numbers are widely used in areas such as cryptography and data transmission, luck games, secure communication, simulation, and game programming, where key generation is important. Random number generators can be divided into two classes: TRNG (True Random Number Generator) and PRNG (Pseudo Random Number Generator). Random numbers can be generated as hardware and software. The random numbers generated by the software can be defined by a specific mathematical model. On the other hand, it is possible to generate numbers by hardware with the help of noise source whose behavior cannot be predicted. Figure 1 shows the classification of random number generation.

2.1. PRNG. The general design architecture of PRNG is shown in Figure 2. [r.sub.1],[r.sub.2],... [r.sub.n] [member of] R represents random number generator while [S.sub.n] [member of] S indicates the internal states of pure PRNG and [P.sub.s] is defined as the probability distribution of random seed. PRNG generates [r.sub.n] random number from the current [S.sub.n] state provided that [PSI]: S [right arrow] R output function will be [r.sub.n] = [PSI]([S.sub.n]). After that, using [PHI] transition function, [S.sub.n] state is updated as [S.sub.n+1]= [PHI]([S.sub.n]). [S.sub.0] represents the first internal state and [S.sub.1] value corresponds to the seed value of [S.sub.0] state and the equation [S.sub.1=] [PHI]([S.sub.0]) is generated [18]. In short, these generators need the starting parameters also known as seed. Random number generators with good quality statistics are generated by expanding these parameters with deterministic ways [19].

2.2. TRNG. The general design architecture of TRNG is shown in Figure 3. The values obtained by sampling noise sources are called digitalized analog signals (DAS). DAS random numbers correspond to a particular case of pure random numbers and they are subjected to algorithmic postprocessing to reduce their potential weaknesses. During this application, however, the output bit rate is reduced and the operating speed decreases.

The structural comparison of PRNG and TRNG number generators is shown in Table 3. According to Table 3, PRNGs generate fast, easily designable, and periodic numbers. On the other hand, TRNGs generate unpredictable, entropy dependent, and nonperiodic numbers. Beside these advantages, they are disadvantageous compared to PRNGs because they are hardware dependent and operate slowly.

3. Bioelectrical and Physical Signals

Bioelectrical signals are low amplitude noises between 100 [micro]V and 1 mV and are taken from the body through electrodes. The frequency spectra of such signals are in the low frequency range of 0.1 Hz ~ 2000 Hz. The amplitude and frequency characteristics of different bio electrical signals taken from the body are shown in Table 4.

During brain activity, continuous rhythmic electrical potentials are produced and also electrical signals are generated due to receptor activity. The recording of these electrical signals with the electrodes embedded in the skull is called electroencephalography (EEG). The amplitudes of EEG waves range from 5 to 400 [micro]V and their frequencies change between 0.5 and 100 Hz. EEG signals are taken according to Extended International 10-20 system.

Electromyography (EMG) is a neurological examination method based on examining the electrical potentials of nerves and muscles. EMG is made in two ways by using surface electrodes and needle electrodes. In the tests using surface electrodes, electrodes are bonded to the skin surface. Superficial EMG can help monitor muscle and nerve disorders. In the tests using needle electrodes, needle electrodes are pricked into muscle tissue and electrical signals are recorded on muscle fibers. The amplitudes of EMG waves change between 100 [micro]V and 1 mV and their frequencies range from 10 to 500 Hz.

Electrooculogram (EOG) signals are corneal-retinal signals between the cornea and retina formed by eye movements and caused by hyperpolarization and depolarization. EOG signals are taken with the help of electrodes placed around eyes. The EOG signals are in the frequency band of about 0.1-10 Hz and their amplitudes are about 0.001-100 mV. Horizontal and vertical EOG signals vary with eye movement. One degree of movement causes a variation of 16 [micro]V in horizontal amplitude and 14 [micro]V in vertical amplitude.

Among physical signals, the blood volume pulse (BVP) is used to measure heart rate. BVP measurement is obtained using a photoplethysmography (PPG) sensor. This sensor measures changes in blood volume corresponding to changes in heart rate in arteries and capillaries and blood flow. The GSR signal is one of the most sensitive indicators of emotional stimulation to show whether individuals are under stress. It gives information about the conductivity of the skin. Another physical signal, respiration, is caused by the difference between breathing air and exhaling air. With the temperature converter, the heat exchange during respiration is converted into electrical activity.

Figure 4 shows the samples bioelectrical and physical signals in the BNCIHORIZON2020 database. In this figure, the six rows of signals from top to bottom are samples EEG, EOG, EMG, GSR, and blood pressure respiration signals from the datasets A, B, C, D, E, and F, respectively. Table 5 shows mean and standard deviation of bioelectrical and physical signals.

4. Personally Identifiable Number Generation from Bioelectrical and Physical Signals

In this study, to generate TRNG-based random numbers, bioelectrical and physical signals obtained from BNCIHORIZON2020 database were used. The overall number of the databases used is fifteen. These data are four EEG, four EMG, four EOG, one blood volume pulse, one GSR (Galvanic Skin Response), and one respiration. For EEG data, the signals in the database were recorded using thirty-two Ag/AgCl active electrodes with a sampling frequency of 512 Hz according to Extended International 10-20 system. EOG and EMG signals were recorded over the left and right flexor digitorum profundus. GSR, blood volume pulse, and respiration data were recorded simultaneously with bioelectrical signals.

Real random number generation from these data includes three steps, as shown in Figure 5. These steps are normalization, digitization (sampler), and postprocessing.

In normalization, all data obtained from noise sources (raw signals) first should be transformed into binary number system. To achieve this, the operations given with their mathematical explanations below are applied. Let each signal obtained from individuals be x=[([x.sub.1],[x.sub.2],...[x.sub.n]).sup.T] . Each sample is expressed as 5 bits by using modular arithmetic as shown in

[y.sub.i] = [x.sub.i] mod 32 for i [member of] [1, n]. (1)

To produce 0 and 1 from 5-bit [y.sub.i] generators, [z.sub.i] generator is obtained according to (2). Each element of [z.sub.i] generator is in a range of [0-5].

[mathematical expression not reproducible]. (2)

Lastly, [b.sub.i] random binary generator is obtained by using [z.sub.i] generator with the help of (3). The algorithm of normalization is given below.

[b.sub.i] = [z.sub.i] mod 2 for i [member of] [1, n]. (3)

After this step, sampling is applied to [b.sub.i] generator obtained from bioelectrical and physical signals that are used as the noise source. Periodic and nonperiodic signals are used in the literature for sampling [17, 20]. In this article, logistic map presenting nonperiodic behavior was used for sampling. Logistic map presenting chaotic behavior is defined as

[a.sub.i+1] = r x [a.sub.i] x (1 - [a.sub.i]) i = 0,1,2,... (4)

where r is the system parameter, [a.sub.1] is the seed or initial value, and i is the number of iterations. The numbers produced by logistic map and in a range of [0,1] are real. Let these numbers be [a.sub.1], [a.sub.2], [a.sub.3].... The expression "[a.sub.i] >=0.5" produced at the ith iteration indicates that the output of logistic map is assumed to be 1; otherwise it is 0. For r=3.91 and [a.sub.1]=0.2, first fifteen values are 0.2, 0.625, 0.916, 0.301, 0.823, 0.568, 0.959, 0.153, 0.508,0.977,0.087,0.311,0.837,0.533, and 0.973. The produced sampling signal will be as follows: 0,1,1,0,1,1,1,0,1,1,0,0,1,1,1. When the sampling signal becomes 1, then [d.sub.j]=[b.sub.i] is satisfied. When it is 0, [b.sub.i] signal is neglected. This phenomenon is illustrated in Table 6. Sampling operation is given in Algorithm 2.

Postprocessing is applied to improve statistical properties of sampled random number generators. XOR, Von Neumann, LFSR, and Hash function structures are commonly used in the literature for postprocessing [21, 28]. In this study, XOR postprocessing was used. When sequential numbers are 0,1 and 1,0 with XOR in the random number generator, real random number is assumed to be 1 and otherwise 0. When XOR postprocessing is applied to the sampled 1110110010 number generator obtained in Table 5, the number generator obtained will be 01001.The algorithm for postprocessing is given in Algorithm 3.

5. Statistical Analysis of Random Numbers

NIST SP 800-22, scale index, and autocorrelation tests--commonly used in the literature--were used for the statistical analysis of generated random numbers.

5.1. NIST SP 800-22 Statistical Test Suite. NIST SP 800-22 is a test commonly used for statistical analysis of the numbers obtained from TRNG, PRNG, Physical Unclonable Function (PUF), and their hybrid generators [21-23]. NIST test suite includes fifteen tests and the parameters of each test are given in the related study [29]. The a value known as the level of significance is one of the most important parameters in the test. The selection of a as 0 indicates that the randomness of numbers to be tested has a confidence value of 99%. Another parameter is p value and it is known as the measure of randomness. If this value is equal to 1, numbers are said to have perfect randomness. If p value becomes 0, numbers are not random. The [alpha] value of personally identifiable random numbers to be used for key and verification applications should be appropriately selected. For each test, if p value is greater than or equal to a value, then the test is successful. Otherwise the test becomes unsuccessful; i.e., the numbers generated are not random. Generally, a is selected from [0.001, 0.01] range.

NIST test suite analysis results of personally identifiable random numbers obtained from bioelectrical and physical signals in the dataset are shown in Tables 7 and 8, respectively. As can be seen from tables, all data used was successful in the NIST test because their p value was higher than 0.01.

5.2. Scale Index Test. The scale index test was applied for statistical analysis of numbers. The scale index technique was proposed by Benitez [30]. This technique was used to determine the information about the degree of nonperiodicity of a signal or generated number series. In literature, for determining the periodicity of TRNG and PRNG, the scale index test was used [24,25]. The scale index was based on the continuous wavelet transform and wavelet multiresolution analyses. The scales s andf at time u in the continuous wavelet transform (CWT) and scalogram were shown as given in equations (5) and (6) [22]. One has

[W.sub.f](u, s) := <f, [[psi].sub.u,s]> = [[integral].sup.+[infinity]1.sub.-[infinity]f(t)[[psi].sup.*u,s](t)dt (5)

(s) := [parallel]W/(u,s)[parallel] = ([[integral].sup.+[infinity].sub.-[infinity]][[absolute value of Wf(u,s)].sup.2]du) (6)

The continuous wavelet transform's energy of f at a scale s was illustrated as S(s). Equation (7) shows the inner scalogram of f at a scale s.

[S.sup.in](s) := [[parallel]Wf(u,s)[parallel].sub.j(s)] = [([[integral].sup.d(s).sub.c(s)][[absolute value of Wf(u,s)].sup.2]du).sup.2] (7)

where J(s) = [c(s),d(s)] [subset or equal to] I is the maximal subinterval in I for which the support of [[psi].sub.u,s] is included in I for all u [member of] j(s). Considering that the length of J (s) depends on the scale s, the values of the inner scalogram at different scales cannot be compared. The normalized [s.sup.in] is defined as shown in

[[bar.s].sup.in](s) = [s.sup.in](s)/[(d(s)-c(s)).sup.1/2]. (8)

Equation (9) shows the scale index of f in the scale interval [[s.sub.0], [s.sub.1]].

[i.sub.scale] := S([s.sub.min])/S([s.sub.min]). (9)

The degree of nonperiodicity of bioelectrical and physical magnitudes was determined by the scale index test whose details were explained above. Table 9 shows obtained scale index values.

The scale index value [i.sub.scale] should be in the range of 0 [less than or equal to] [i.sub.scale] [less than or equal to] 1. If the scale value obtained from the generated system is 0 or near 0, then the system is defined as periodic and if 1 or near to 1, then it is defined as nonperiodic. According to Table 8, it was observed that the results obtained from both bioelectrical and physical signals were successful in scale index test and they were close to 1.

5.3. Autocorrelation Test. Finally, to observe the variations of 0 and 1 s in the generated random numbers the autocorrelation test was used [26, 27].

Equation (10) shows the mathematical definitions of the test [31].

A(d) = [n-d-1.summation over (i=0)][b.sub.i][direct sum][b.sub.i+d] (10)

where [direct sum] is the XOR operator, n is the length of the generated number sequences, and [b.sub.i] represents the number sequence. The d value is the constant integer and between [1,(n/2)]. Equation (11) shows the relationship between 0 and 1s.

X5 = 2[A(d)-(n-d)/2]/[square root of n-d]. (11)

For [alpha] = 0.05, if [absolute value of X5] < 1.6449, then the test is successful.

Autocorrelation test was used to determine 0-1 change in the random numbers obtained from both bioelectrical and physical magnitudes. Table 10 shows autocorrelation test results. As seen in Table 9, for each dataset, |X5| value is in the specified interval. Thus, random numbers obtained from both bioelectrical and physical signals were successful in autocorrelation test.
Algorithm 1: Normalization procedure.

x = [([x.sub.1],[x.sub.2],...,[x.sub.n]).sup.T]   //Data set
for i=l to n
    [y.sub.i]=[x.sub.i] mod (32)         // [y.sub.i] between [0-31]
    convert [y.sub.i] to binary format
    [z.sub.i]=0
     for k=1 to 5
         [z.sub.i]=[z.sub.i] + [y.sub.i,k]
    end
    [b.sub.i] = [z.sub.i] mod (2)        //normalized 0-1 data
end


6. Discussion and Conclusion

Random numbers have been generated in the literature from bioelectrical signals such as EEG. These numbers have the PRNG structure. However, the statistical properties of the numbers generated from EEG signals are not good. In this article, the TRNG structure using bioelectrical and physical signals as a source of randomness was proposed. Although the taken signals are periodic, the level of noise that would emerge from any source on the signal causes the signal to be nonperiodic. In this case, the random numbers to be generated are unpredictable. Personally identifiable random numbers were generated from the obtained raw signals using normalization (see Algorithm 1), sampling, and postprocessing operations. The process is faster than the TRNG structures in the literature because of the simple structure of normalization, sampling, and postprocessing. NIST SP 800-22 test was used to show that the statistical properties of the generated numbers were improved; scale index test was used to reveal the level of nonperiodicity and autocorrelation tests were used to observe 0 and 1 change of numbers. All test results were presented in tabular form and all results were found to be successful. The results indicate that TRN generation from bioelectrical and physical signals obtained from the human body is possible.
Algorithm 2: Sampler procedure.

Set the initial value: [a.sub.1]=0.2, r=3.91, [c.sub.1]=0
for i=1 to n
    [a.sub.i+1]=[a.sub.i]xrx(1-[a.sub.i])   //[a.sub.i] between [0-1]
    if [a.sub.i] [greater than or equal to] 0.5 then
        [c.sub.i]=1
    else
        [c.sub.i]=0
    end if
end
j=1
for =1 to n
    if [c.sub.i]==1 then
       [d.sub.j] = [b.sub.i]             //[d.sub.j]: sampled number
       j=j+1
    end if
end

Algorithm 3: Postprocessing procedure.

Set the n t al value: k=1
for i=1 toj-1, update i=i+2
    [number.sub.k]=[d.sub.i] XOR [d.sub.i+1]
    k=k+1
end


Thus, the obtained random numbers are suitable for use in different areas, such as key generation, authentication, games of chance, simulation, and game programming. It is possible to carry out various studies on random number generation using these bioelectrical and physical signals as well as different types of signals like EGG and ECG. The present study will be the basis for random number generation using such signals.

https://doi.org/10.1155/2018/3579275

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

References

[1] M. Bakiri, C. Guyeux, J.-F. Couchot, and A. K. Oudjida, "Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses," Computer Science Review, vol. 27, pp. 135-153, 2018.

[2] J. Li, J. Zheng, and P. Whitlock, "Efficient deterministic and non-deterministic pseudorandom number generation," Mathematics and Computers in Simulation, vol. 143, pp. 114-124, 2018.

[3] T. Tuncer, "The implementation of chaos-based PUF designs in field programmable gate array," Nonlinear Dynamics, vol. 86, no. 2, pp. 975-986, 2016.

[4] F. Ozkaynak, "Cryptographically secure random number generator with chaotic additional input," Nonlinear Dynamics, vol. 78, no. 3, pp. 2015-2020, 2014.

[5] T. Tuncer, "Implementation of duplicate TRNG on FPGA by using two different randomness source," Elektronika ir Elektrotechnika, vol. 21, no. 4, pp. 35-39, 2015.

[6] M. Dichtl, Bad and Good Ways of Post-processing Biased Physical Random Numbers, vol. 4593 of Lecture Notes in Computer Science, Springer, Berlin, Germany, 2007.

[7] E. Avaroglu, T. Tuncer, A. B. Ozer, and M. Turk, "A new method for hybrid pseudo random number generator," Journal of Microelectronics, Electronic Components and Materials, vol. 4, no. 4, pp. 303-311, 2014.

[8] E. Jokar and M. Mikaili, "Assessment of Human Random Number Generation for Biometric Verification," Journal of Medical Signals and Sensors, vol. 2, no. 2, pp. 82-87, 2012.

[9] W. Xingyuan, Q. Xue, and T. Lin, "A novel true random number generator based on mouse movement and a one-dimensional chaotic map," Mathematical Problems in Engineering, vol. 2012, Article ID 931802, 9 pages, 2012.

[10] Y. Hu, X. Liao, K.-W. Wong, and Q. Zhou, "A true random number generator based on mouse movement and chaotic cryptography," Chaos, Solitons & Fractals, vol. 40, no. 5, pp. 2286-2293, 2009.

[11] S. R. Moosavi, E. Nigussie, S. Virtanen, and J. Isoaho, "Cryptographic key generation using ECG signal," in Proceedings of the 14th IEEE Annual Consumer Communications and Networking Conference, CCNC 2017, pp. 1024-1031, usa, January 2017.

[12] X. Chen, Y. Zhang, G. Zhang, and Y. Zhang, "Evaluation of ECG random number generator for wireless body sensor networks security," in Proceedings of the 2012 5th International Conference on Biomedical Engineering and Informatics, BMEI 2012, pp. 1308-1311, October 2012.

[13] D. Nguyen, D. Tran, W. Ma, and K. Nguyen, "EEG-Based random number generators," Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 10394, pp. 248-256, 2017.

[14] G. Chen, "Are electroencephalogram (EEG) signals pseudorandom number generators?" Journal of Computational and Applied Mathematics, vol. 268, pp. 1-4, 2014.

[15] I.-T. Chen, "Random numbers generated from audio and video sources," Mathematical Problems in Engineering, vol. 2013, Article ID 285373, 7 pages, 2013.

[16] B. Petchlert and H. Hasegawa, "Using a low-cost electroencephalogram (EEG) directly as random number generator," in Proceedings of the 3rd IIAI International Conference on Advanced Applied Informatics, IIAI-AAI 2014, pp. 470-474, September 2014.

[17] T. Tuncer, E. Avaroglu, M. Turk, and A. B. Ozer, "Implementation of non-periodic sampling true random number generator on fpga," Informacije Midem, vol. 44, no. 4, pp. 296-302, 2014.

[18] E. Avaroglu, I. Koyuncu, A. B. (Ozer et al., "Hybrid pseudorandom number generator for cryptographic systems," Nonlinear Dynamics, vol. 82, no. 1-2, pp. 239-248, 2015.

[19] A. A. Maaita and H. A. A. ALSewadi, "Deterministic Random Number Generator Algorithm for Cryptosystem Keys," World Academy of Science, Engineering and Technology International Journal of Computer and Information Engineering, vol. 9, no. 4, 2015.

[20] E. Avaroglu, T. Tuncer, A. B. (Ozer, B. Ergen, and M. Turk, "A novel chaos-based post-processing for TRNG," Nonlinear Dynamics, vol. 81, no. 1-2, pp. 189-199, 2015.

[21] S. Buchovecka, R. Lorencz, F. Kodytek, and J. Bucek, "True random number generator based on ring oscillator PUF circuit," Microprocessors and Microsystems, vol. 53, pp. 33-41,2017

[22] I. Cicek, A. E. Pusane, and G. Dundar, "A novel design method for discrete time chaos based true random number generators," Integration, the VLSI Journal, vol. 47, no. 1, pp. 38-47, 2014.

[23] S. Chen, B. Li, and C. Zhou, "FPGA implementation of SRAM PUFs based cryptographically secure pseudo-random number generator," Microprocessors and Microsystems, vol. 59, pp. 57-68, 2018.

[24] Y. Yang and Q. Zhao, "Novel pseudo-random number generator based on quantum random walks," Scientific Reports, vol. 6, no. 1, 2016.

[25] B. Karakaya, V. Celik, and A. Gulten, "Chaotic cellular neural network-based true random number generator," International Journal of Circuit Theory and Applications, vol. 45, no. 11, pp. 1885-1897, 2017.

[26] J. J. Chan, P. Thulasiraman, G. Thomas, and R. Thulasiram, "Ensuring Quality of Random Numbers from TRNG: Design and Evaluation of Post-Processing Using Genetic Algorithm," Journal of Computer and Communications, vol. 04, no. 04, pp. 73-92, 2016.

[27] X. Chen, L. Wang, B. Li et al., "Modeling Random Telegraph Noise as a Randomness Source and its Application in True Random Number Generation," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 35, no. 9, pp. 1435-1448, 2016.

[28] V. Rozic, B. Yang, W. Dehaene, and I. Verbauwhede, "Iterating von Neumann's post-processing under hardware constraints," in Proceedings of the 2016 IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2016, pp. 37-42, May 2016.

[29] NIST Special Publication 800-22,2001. http://csrc.nist.gov/rng/ rng2.html.

[30] R. Benitez, V. J. Bolos, and M. E. Ramirez, "A wavelet-based tool for studying non-periodicity," Computers & Mathematics with Applications. An International Journal, vol. 60, no. 3, pp. 634-641, 2010.

[31] A. J. Menezes, P. C. van Oorschot, andS. A. Vanstone, Handbook of Applied Cryptography, CRC Press, New York, NY, USA, 1996.

Seda Arslan Tuncer (iD)(1) and Turgay Kaya (iD)(2)

(1) Department of Software Engineering, Faculty of Engineering, Firat University, 23119 Elazig Turkey

(2) Department of Electrical-Electronics Engineering, Faculty of Engineering, Firat University, 23119 Elazig, Turkey

Correspondence should be addressed to Seda Arslan Tuncer; satuncer@firat.edu.tr

Received 26 March 2018; Accepted 3 June 2018; Published 2 July 2018

Academic Editor: Yongqing Yang

Caption: Figure 1: Random number generator classes.

Caption: Figure 2: The general design architecture of PRNG.

Caption: Figure 3: Block structure of TRNG.

Caption: Figure 4: Bioelectrical and physical signals from database.

Caption: Figure 5: The steps of number generation.
Table 1: Requirements for random numbers.

Requirement   Explanation

R1            RNGs must generate random numbers having good
              statistical properties at the output to be used in
              cryptographic applications.

R2            In case of the attacker knows the sub-generators of
              random numbers, it must not be allowed to calculate or
              predict premise and consecutive random numbers with
              high accuracy.

R3            It must not be possible to predict or calculate
              previously generated random numbers with high accuracy
              by considering the known current internal state value
              of a RNG or without requiring its internal state
              information.

R4            It must not be possible to predict or
              calculate subsequent random numbers with high accuracy
              by considering the known current internal state value
              of a RNG or without requiring its internal state
              information.

Table 2: Properties of random generation methods.

References   Implementation type     Noise Source

[2]                 PRNG           MARC-bb Algorithm

[3]                 TRNG                jitter

[4]                 PRNG                 Chaos
[5,17]              TRNG                jitter
[7]               PRNG&TRNG        Chaos and jitter
[9]                 TRNG            Chaotic signal
[10]                TRNG            Mouse movement
[11,12]             PRNG                  ECG
[13]                PRNG                  EEG
[14]                PRNG                  EEG
[15]            TRNG (AVRNG)        Audio and Video
[16]                TRNG                  EEG
[18]              TRNG&PRNG         Chaotic signal
[19]                PRNG           Boolean function
[20]                TRNG            Chaotic signal
[21, 22]            TRNG                jitter
[23]                PRNG                jitter
[24]                PRNG             chaotic maps
[25]                TRNG             chaotic maps
[26]                TRNG              Intel DRNG
[27]                TRNG            Telegraph Noise

References           Tests                 Performance

[2]                 TestUOl                  success
                     NIST,
[3]              scale index,                success
                Autocorrelation
[4]                  NIST                    success
[5,17]               NIST            success (for some test)
[7]                  NIST                    success
[9]                  NIST                    success
[10]                 NIST                    success
[11,12]              NIST                    success
[13]                 NIST                    success
[14]                 NIST            success (for some test)
[15]                 NIST                    success
[16]                 NIST                    success
[18]              NIST, FIPS                 success
[19]                 NIST            success (for some test)
[20]          NIST,TESTU01, scale            success
                     index
[21, 22]             NIST                    success
[23]                 NIST                    success
[24]                 NIST,                   success
                  scale index
[25]                 NIST,                   success
                  scale index
[26]               TestU01,                  success
                Autocorrelation
[27]         NIST, Autocorrelation           success

Table 3: Comparison of TRNG and PRNG.

                                       TRNG

Realization type                 Hardware required
Periodicity                          Aperiodic
Ease of application                   Complex
  of design cycle
Efficiency                             Weak
Change of theoretical     Constant (independent of time)
  calculation limit
Cryptographic security          R1, R2 requirement
  requirement

                                          PRNG

Realization type                        Optional
Periodicity                             Periodic
Ease of application       Easy because of standard structures
  of design cycle
Efficiency                              Perfect
Change of theoretical              Dependent on time
  calculation limit
Cryptographic security      R1, R2, R3, and R4 requirements
  requirement

Table 4: Bioelectrical signals and their properties.

Signal Type                    Amplitude       Frequency

EEG Electroencephalogram    2-100 [micro]V     0.5-50 Hz
EMG Electromyogram         100 [micro]V-1 mV   10- 500Hz
EOG Electrooculography       0.001-100 mV      0.1-10 Hz

Table 5: Bioelectrical signals and their properties.

Features                   EEG              EMG        EOG      GSR

Mean                 -1.26x[10.sup.4]   -1.825 x1O4   3.104    150.11
Standard deviation   6.98x[10.sup.3]    6.862 x1O3    10.652   1.999

Features             Blood Pressure      Respiration

Mean                  -1.085 x1O5     -1.397 x[l0.sup.5]
Standard deviation     3.75 x1O3      1.544 x[l0.sup.4]

Table 6: Obtaining the sampled signal.

Signals                                   Obtained Bits

[b.sub.i] (Normalized signals)    0,1,1,1,1,0,1,0,1,0,0,1,0,1,0
[c.sub.i] (Sampled signal         0,1,1,0,1,1,1,0,1,1,0,0,1,1,1
  obtained from Logistic map)
[d.sub.i] (Sampled signal)             1,1, 1,0,1 1,0 0,1,0

Table 7: NIST test results obtained from bioelectrical signals.

Test Type                             EEG1     EEG2     EEG3     EEG4

Frequency Monobit                    0.4564   0.016    0.539    0.784
Frequency Test within a Block        0.492    0.184    0.252    0.744
Runs                                 0.445    0.221    0.358    0.734
Longest Run of Ones in a Block       0.277    0.428    0.295    0.131
Binary Matrix Rank                   0.774    0.648    0.980    0.458
Discrete Fourier Transform           0.212    0.295    0.798    0.784
Non Overlapping Template Matching    0.234    0.451    0.553    0.947
Overlapping Template Matching        0.510    0.310    0.712    0.119
Universal                            0.436    0.235    0.533    0.661
Linear Complexity                    0.745    0.874    0.236    0.225
Serial                               0.560    0.026    0.540    0.909
                                     /0.437   /0.211   /0.357   /0.734
Approximate Entropy                  0.254    0.330    0.690    0.532
Cumulative Sums                      0.469    0.014    0.171    0.875
Random excursions test*              0.712    0.337    0.501    0.287
Random excursions variant test*      0.519    0.483    0.645    0.831

Test Type                             EMG1    EMG2     EMG3     EMG4

Frequency Monobit                    0.324    0.523   0.663    0.961
Frequency Test within a Block        0.253    0.594   0.294    0.058
Runs                                 0.676    0.453   0.506    0.258
Longest Run of Ones in a Block       0.853    0.046   0.094    0.221
Binary Matrix Rank                   0.579    0.402   0.795    0.354
Discrete Fourier Transform           0.996    0.964   0.408    0.108
Non Overlapping Template Matching    0.880    0.925   0.218    0.431
Overlapping Template Matching        0.631    0.615   0.348    0.028
Universal                            0.748    0.117   0.659    0.527
Linear Complexity                    0.318    0.374   0.453    0.178
Serial                               0.565    0.616   0.723    0.526
                                     /0.679   /0454   /0.498   /0.257
Approximate Entropy                  0.840    0.305   0.026    0.757
Cumulative Sums                      0.503    0.802   0.410    0.405
Random excursions test*              0.746    0.253   0.413    0.682
Random excursions variant test*      0.452    0.846   0.445    0.577

Test Type                             EOG1     EOG2     EOG3

Frequency Monobit                    0.701    0.406     0.047
Frequency Test within a Block        0.805    0.916     0.725
Runs                                 0.440    0.246     0.842
Longest Run of Ones in a Block       0.087    0.871     0.616
Binary Matrix Rank                   0.481    0.481     0.636
Discrete Fourier Transform           0.032    0.773     0.531
Non Overlapping Template Matching    0.477    0.397     0.568
Overlapping Template Matching        0.633    0.838     0.363
Universal                            0.219    0.371     0.567
Linear Complexity                    0.959    0.985     0.406
Serial                               0.714     0338     0.138
                                     /0.468   /0.224   / 0.826
Approximate Entropy                  0.345    0.324     0.176
Cumulative Sums                      0.894    0.416     0.042
Random excursions test*              0.485    0.226     0.711
Random excursions variant test*      0.186    0.705     0.694

Test Type                             EOG4

Frequency Monobit                    0.737
Frequency Test within a Block        0.264
Runs                                 0.388
Longest Run of Ones in a Block       0.973
Binary Matrix Rank                   0.448
Discrete Fourier Transform           0.348
Non Overlapping Template Matching    0.843
Overlapping Template Matching        0.715
Universal                            0.512
Linear Complexity                    0.210
Serial                               0.651
                                     /0.388
Approximate Entropy                  0.710
Cumulative Sums                       0736
Random excursions test*              0.603
Random excursions variant test*      0.279

* More than one p value was obtained and it was found
that p value > 0.01. The values given for these tests
are average.

Table 8: NIST test results obtained from physical signals.

Test Type                             GSR      Blood     Respiration
                                              Pressure

Frequency Monobit                    0.715     0.079        0.951
Frequency Test within a Block        0.125     0.213        0.412
Runs                                 0.445     0.490        0.290
Longest Run of Ones in a Block       0.230     0.762        0.639
Binary Matrix Rank                   0.490     0.232        0.208
Discrete Fourier Transform           0.916     0.469        0.826
Non Overlapping Template Matching    0.817     0.734        0.140
Overlapping Template Matching        0.415     0.040        0.962
Universal                            0.043     0.115        0.636
Linear Complexity                    0.388     0.560        0.680
Serial                               0.698     0.166        0.578
                                     /0.444    /0.473      /0.295
Approximate Entropy                  0.422    0.0.485       0.092
Cumulative Sums                      0.773     0.055        0.345
Random excursions test *             0.252     0.289        0.601
Random excursions variant test *     0.333     0.427        0.397

* More than one p value was obtained and it was found that p value >
0.01. The values given for these tests are average.

Table 9: Scale index test results of datasets.

                 1. Dataset   2. Dataset   3. Dataset   4. Dataset

EEG                0.924        0.936        0.973        0.951
EMG                0.944        0.955        0.957        0.924
EOG                0.756        0.763        0.861        0.804
Blood Pressure     0.936
GSR                0.964
Respiration        0.879

Table 10: Autocorrelation test results of datasets.

d                        8      10      13

EEG datasets      1   0.205   0.445   0.302
                  2   1.289   0.159   0.896
                  3   0.216   0.285   1.169
                  4   0.627   0.776   0.599

EMG datasets      1   1.175   0.593   0.633
                  2   0.253   1.08    0.382
                  3   1.261   0.688   0.991
                  4   0.836   1.498   1.137

EOG datasets      1   1.068   0.812   0.107
                  2   1.089   1.431   0.727
                  3   1.497   0.927   1.182
                  4   0.896   0.346   0.111
Blood Pres.       1   1.381   0.468   0.359
GSR               1   0.833   0.890   0.188
Respiration       1   0.730   0.993   1.030
COPYRIGHT 2018 Hindawi Limited
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2018 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Title Annotation:Research Article
Author:Tuncer, Seda Arslan; Kaya, Turgay
Publication:Computational and Mathematical Methods in Medicine
Date:Jan 1, 2018
Words:6549
Previous Article:A Dynamic Model of Rescuer Parameters for Optimizing Blood Gas Delivery during Cardiopulmonary Resuscitation.
Next Article:Airflow and Particle Deposition in Acinar Models with Interalveolar Septal Walls and Different Alveolar Numbers.
Topics:

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters