Are electroencephalogram (EEG) signals pseudo-random number generators?

被引:17
|
作者
Chen, Guangyi [1 ]
机构
[1] Concordia Univ, Dept Comp Sci & Software Engn, Montreal, PQ H3G 1M8, Canada
关键词
Electroencephalogram (EEG); Pseudo-random number generator (PRNG); Gaussian distribution; Uniform distribution;
D O I
10.1016/j.cam.2014.02.028
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we study if an electroencephalogram (EEG) signal can be treated as a pseudorandom number generator (PRNG). We approach this problem by calculating the frequency of both healthy and epileptic EEG signals, and we find that all EEG signals obey the Gaussian distribution with different standard deviations. However, under some transformation, we can treat EEG signals as PRNGs. Our transformation takes the sum of the least significant five bits of the EEG sample amplitude and then outputs the parity of this sum to a binary (0 or 1) sequence. Our binary sequences have passed nearly all NIST pseudo-random number tests except a few failures. This indicates that the EEG signals can indeed become a PRNG provided that it undergoes a transformation like ours. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 4
页数:4
相关论文
共 50 条
  • [41] Hardware implementation of pseudo-random number generators based on chaotic maps
    Gerardo de la Fraga, Luis
    Torres-Perez, Esteban
    Tlelo-Cuautle, Esteban
    Mancillas-Lopez, Cuauhtemoc
    NONLINEAR DYNAMICS, 2017, 90 (03) : 1661 - 1670
  • [42] METHOD OF IMPLEMENTING PSEUDO-RANDOM NUMBER GENERATORS ON THE BASIS OF MICROPROCESSORS.
    Dobris, G.V.
    Nakke, Kh.G.
    Yablonskii, S.A.
    Automatic Control and Computer Sciences, 1986, 20 (01) : 95 - 98
  • [43] SECRET KEY STEGANOGRAPHY WITH MESSAGE OBFUSCATION BY PSEUDO-RANDOM NUMBER GENERATORS
    Gutierrez-Cardenas, Juan M.
    2014 38TH ANNUAL IEEE INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSACW 2014), 2014, : 164 - 168
  • [44] GENERATOR OF PSEUDO-RANDOM SIGNALS
    PEKAREK, O
    KREKULE, I
    PHYSIOLOGIA BOHEMOSLOVACA, 1981, 30 (05): : 449 - 449
  • [45] Pseudo-random generators for all hardnesses
    Umans, C
    17TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2002, : 11 - 11
  • [46] Pseudo-random generators for all hardnesses
    Umans, C
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (02) : 419 - 440
  • [47] Evaluation of splittable pseudo-random generators
    Schaathun, Hans Georg
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2015, 25
  • [48] Tautologies from pseudo-random generators
    Krajícek, J
    BULLETIN OF SYMBOLIC LOGIC, 2001, 7 (02) : 197 - 212
  • [49] A brief and understandable guide to pseudo-random number generators and specific models for security
    Luengo, Elena Almaraz
    STATISTICS SURVEYS, 2022, 16 : 137 - 181
  • [50] A visual analysis method of randomness for classifying and ranking pseudo-random number generators
    Machicao, Jeaneth
    Ngo, Quynh Quang
    Molchanov, Vladimir
    Linsen, Lars
    Bruno, Odemir
    INFORMATION SCIENCES, 2021, 558 : 1 - 20