Analyzing All the Instances of a Chaotic Map to Generate Random Numbers
All possible configurations of a chaotic map without fixed points, called “nfp1”, in its implementation in fixed-point arithmetic are analyzed. As the multiplication on the computer does not follow the associative property, we analyze the number of forms in which the multiplications can be performed...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-01-01
|
| Series: | Computer Sciences & Mathematics Forum |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2813-0324/4/1/6 |
| Summary: | All possible configurations of a chaotic map without fixed points, called “nfp1”, in its implementation in fixed-point arithmetic are analyzed. As the multiplication on the computer does not follow the associative property, we analyze the number of forms in which the multiplications can be performed in this chaotic map. As chaos enhanced the small perturbations produced in the multiplications, it is possible to built different pseudorandom number generators using the same chaotic map. |
|---|---|
| ISSN: | 2813-0324 |