How useful randomness for cryptography can emerge from multicore-implemented complex networks of chaotic maps

Abstract : We introduce a novel method revealing hidden bifurcations in the multispiral Chua attractor in the case where the parameter of bifurcation c which determines the number of spiral is discrete. This method is based on the core idea of the genuine Leonov and Kuznetsov method for searching hidden attractors (i.e. applying homotopy and numerical continuation) but used in a very different way. Such hidden bifurcations are governed by a homotopy parameter ε whereas c is maintained constant. This additional parameter which is absent from the initial problem is perfectly fitted to unfold the actual structure of the multispiral attractor. We study completely the multispiral Chua attractor, generated via sine function, and check numerically our method for odd and even values of c from 1 to 12. In addition, we compare the shape of the attractors obtained for the same value of parameter ε while varying the parameter c.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01742568
Contributor : René Lozi <>
Submitted on : Sunday, March 25, 2018 - 4:40:41 PM
Last modification on : Tuesday, November 6, 2018 - 10:16:29 AM

File

Lozi_Garasym_Lozi_How_useful_J...
Files produced by the author(s)

Identifiers

Citation

Jean-Pierre Lozi, René Lozi, Oleg Garasym. How useful randomness for cryptography can emerge from multicore-implemented complex networks of chaotic maps. Journal of Difference Equations and Applications, Taylor & Francis, 2017, 23 (5), pp.821-859. ⟨10.1080/10236198.2017.1287176⟩. ⟨hal-01742568⟩

Share

Metrics

Record views

221

Files downloads

94