2013
DOI: 10.1155/2013/769108
|View full text |Cite
|
Sign up to set email alerts
|

Study of a New Chaotic Dynamical System and Its Usage in a Novel Pseudorandom Bit Generator

Abstract: A new chaotic discrete dynamical system, built on trigonometric functions, is proposed. With intent to use this system within cryptographic applications, we proved with the aid of specific tools from chaos theory (e.g., Lyapunov exponent, attractor’s fractal dimension, and Kolmogorov-Smirnov test) and statistics (e.g., NIST suite of tests) that the newly proposed dynamical system has a chaotic behavior, for a large parameter’s value space, and very good statistical properties, respectively. Further, the propos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(9 citation statements)
references
References 53 publications
(62 reference statements)
0
7
0
Order By: Relevance
“…Reference [11] proposed a one-dimensional iterative chaotic map with infinite collapses within symmetrical region [−1, 0) ∪ (0, 1]. In [6], a novel chaotic system, built on trigonometric functions, is proposed. The new chaotic system is used, in conjunction with a binary operation, in the designing of a new pseudo-random bit generator algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Reference [11] proposed a one-dimensional iterative chaotic map with infinite collapses within symmetrical region [−1, 0) ∪ (0, 1]. In [6], a novel chaotic system, built on trigonometric functions, is proposed. The new chaotic system is used, in conjunction with a binary operation, in the designing of a new pseudo-random bit generator algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Two ciphering matrices are computed by the pseudorandom number generator PRNG (8), which has been proven to have attractor's fractal structure, ergodicity, and an enormous key space [24]. …”
Section: Computing Ciphering Matricesmentioning
confidence: 99%
“…Although any PRBG can be used, for example, [34][35][36][37][38][39][40], due to its good cryptographic properties and suitability for cryptographic application, that is, large key space and good randomness features, as proven in [41], PRNG model (1) was used, within designing and testing stages of this work. On PRNG's output sequence of real numbers the multilevel discretization method [42] (e.g., with four thresholds, i.e., 2-bit encoding of each interval) was applied, resulted dibits being spread into two different files (i.e., "Bits A.txt, " containing dibit's first bit, and, resp., "Bits B.txt, " containing dibit's second bit).…”
Section: Use Of the Chaotic Map In Scrambler's Designmentioning
confidence: 99%