On the short-term predictability of fully digital chaotic oscillators for pseudo-random number generation
On the Short-Term Predictability of Fully Digital Chaotic Oscillators for Pseudo-Random Number Generation.pdf
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Physical Science and Engineering (PSE) Division
Online Publication Date2014-05-16
Print Publication Date2013-12
Permanent link to this recordhttp://hdl.handle.net/10754/321914
MetadataShow full item record
AbstractThis paper presents a digital implementation of a 3rd order chaotic system using the Euler approximation. Short-term predictability is studied in relation to system precision, Euler step size and attractor size and optimal parameters for maximum performance are derived. Defective bits from the native chaotic output are neglected and the remaining pass the NIST SP. 800-22 tests without post-processing. The resulting optimized pseudorandom number generator has throughput up to 17.60 Gbits/s for a 64-bit design experimentally verified on a Xilinx Virtex 4 FPGA with logic utilization less than 1.85%.
CitationRadwan AG, Mansingka AS, Zidan MA, Salama KN (2013) On the short-term predictability of fully digital chaotic oscillators for pseudo-random number generation. 2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS). doi:10.1109/ICECS.2013.6815432.
Conference/Event name2013 IEEE 20th International Conference on Electronics, Circuits, and Systems, ICECS 2013