Cryptography-Based Chaos via Geometric Undersampling of Ring-Coupled Attractors
Résumé
We propose a new mechanism for undersampling chaotic numbers obtained by the ring
coupling of one-dimensional maps. In the case of 2 coupled maps this mechanism allows the
building of a PRNG which passes all NIST Test.
This new geometric undersampling is very effective for generating 2 parallel streams of pseudorandom
numbers, as we show, computing carefully their properties, up to sequences of 10^12
consecutives iterates of the ring coupled mapping which provides more than 3.35 x 10^10 random
numbers in very short time. Both 3 and 4 dimension cases can be managed in the same way.
In addition we recall a novel method of noise-resisting ciphering. The originality lies in the use of
a chaotic pseudo-random number generator: several co-generated sequences can be used at different
steps of the ciphering process, since they present the strong property of being uncorrelated. Each
letter of the initial alphabet of the plain text is encoded as a subinterval of [-1,1]. The bounds of
each interval are defined in function of the known bound of the additive noise. A pseudo-random
sequence is used to enhance the complexity of the ciphering. The transmission consists of a
substitution technique inside a chaotic carrier, depending on another cogenerated sequence. This
novel noise-resisting ciphering method can be used with geometric undersampling when 4
mappings are coupled.
Fichier principal
Lozi_Mathematical models, Methods and Applications_personal_file.pdf (1.05 Mo)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...