On the short-term predictability of fully digital chaotic oscillators for pseudo-random number generation

A. G. Radwan; Abhinav S. Mansingka; M. Affan Zidan; K. N. Salama

doi:10.1109/ICECS.2013.6815432

Back

Conference proceeding

On the short-term predictability of fully digital chaotic oscillators for pseudo-random number generation

A. G. Radwan, Abhinav S. Mansingka, M. Affan Zidan and K. N. Salama

2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS), pp.373-376

01/12/2013

DOI: https://doi.org/10.1109/ICECS.2013.6815432

Abstract

Chaotic communication

Field programmable gate arrays

Generators

Nickel

Niobium

Throughput

This 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%.

Metrics

1 Record Views

Details

Title: On the short-term predictability of fully digital chaotic oscillators for pseudo-random number generation
Creators - without role: A. G. Radwan - Cairo University
Abhinav S. Mansingka - King Abdullah University of Science and Technology
M. Affan Zidan - King Abdullah University of Science and Technology
K. N. Salama - King Abdullah University of Science and Technology
Publication Details: 2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS), pp.373-376
Publisher: IEEE
Identifiers: 9944770408331
Academic Unit: King Abdullah University of Science & Technology
Language: English
Resource Type: Conference proceeding