Efficient multicore implementation of an advanced generator of discrete chaotic sequences
Authors:
- 1 December 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 31-36
Abstract
This paper details the design and implementation performances of an efficient generator of chaotic discrete integer valued sequences. The generator exhibits orbits having very large lengths compared to those given in the literature. It is implemented in C language and parallelized using the Parameterized and Interfaced Synchronous Dataflow Model of Computation (PiSDF MoC). The proposed structure is shown to be scalable, parallel and time efficient. The resulting implementation combines a very long minimal chaotic sequence omin > 7*2128 32-bit samples and a very high throughput of 173Mbps on 4 cores of a General Purpose Processor.Keywords
This publication has 10 references indexed in Scilit:
- PiMM: Parameterized and Interfaced dataflow Meta-Model for MPSoCs runtime reconfiguration2013
- Practical Guide to Computer Simulations2009
- Design and Analyses of Efficient Chaotic Generators for Crypto-systems2008
- A chaotic stream cipher and the usage in video protectionChaos, Solitons & Fractals, 2007
- Chaotic block ciphers: from theory to practical algorithmsIEEE Transactions on Circuits and Systems I: Regular Papers, 2006
- Security analysis of a chaos-based image encryption algorithmPhysica A: Statistical Mechanics and its Applications, 2005
- Symmetric Ciphers Based on Two-Dimensional Chaotic MapsInternational Journal of Bifurcation and Chaos, 1998
- An introduction to the synchronization of chaotic systems: coupled skew tent mapsIEEE Transactions on Circuits and Systems I: Regular Papers, 1997
- Random numbers for simulationCommunications of the ACM, 1990
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986