Discovering Chaos-Based Communications by Recurrence Quantification and Quantified Return Map Analyses

Publication typeJournal Article
Publication date2022-07-29
scimago Q1
wos Q2
SJR0.596
CiteScore3.9
Impact factor2.3
ISSN02181274, 17936551
Applied Mathematics
Engineering (miscellaneous)
Modeling and Simulation
Abstract

Many studies show the possibility of transmitting messages in a protected and covert manner using a noise-like chaotic waveform as a carrier. Among popular chaotic communication system (CCS) types, one may distinguish chaotic shift keying (CSK) and parameter modulation (PM) which are based on the manipulation of the transmitting chaotic oscillators. With the development of direct digital synthesis (DDS), it became possible to modulate chaotic signals by varying the properties of the numerical method used in digital chaos generators. The symmetry coefficient modulation (SCM) is such an approach potentially able to provide higher secrecy. However, the actual security of chaos-based communications is still a questionable and controversial feature. To quantitatively evaluate the CCS security level, a certain numerical metric reflecting the difficulty of breaking a communication channel is needed. Return maps are commonly used to attack chaotic communication systems, but the standard algorithm does not involve any kind of quantification. In this study, we propose a new method for estimating the differences between two return maps based on a two-dimensional (2D) histogram. Then, we investigate the resistance of chaotic shift keying, parameter modulation, and SCM communication schemes against three types of attacks: the proposed quantified return map analysis (QRMA), recurrence quantification analysis (RQA), which had not been previously reported for attacking chaos-based communications, and the classical approach based on spectral analysis. In our experiments we managed to recover the plain binary message from the waveform in the channel when transmitted using all three chaos-based messaging techniques; among them, SCM appeared to be the most secure communication scheme. The proposed QRMA turned out to be the most efficient technique for message recovery: the sensitivity of the QRMA appeared to be 2–5 times higher than that in the case of spectral analysis. The proposed QRMA method can be efficiently used for evaluating the difficulty of hacking chaos-based communication systems. Moreover, it is suitable for the evaluation of any other secure data transmission channel.

Found 
Found 

Top-30

Journals

1
2
3
Chaos, Solitons and Fractals
3 publications, 12%
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
3 publications, 12%
Entropy
2 publications, 8%
Mathematics
2 publications, 8%
Fractal and Fractional
1 publication, 4%
Symmetry
1 publication, 4%
Applied Sciences (Switzerland)
1 publication, 4%
AEU - International Journal of Electronics and Communications
1 publication, 4%
IEEE Access
1 publication, 4%
Physica Scripta
1 publication, 4%
Journal of Low Power Electronics and Applications
1 publication, 4%
Chinese Physics B
1 publication, 4%
Proceedings of Telecommunication Universities
1 publication, 4%
Big Data and Cognitive Computing
1 publication, 4%
Chaos Theory and Applications
1 publication, 4%
Electronic Commerce Research and Applications
1 publication, 4%
Chaos and Fractals
1 publication, 4%
Results in Engineering
1 publication, 4%
1
2
3

Publishers

1
2
3
4
5
6
7
8
9
MDPI
9 publications, 36%
Elsevier
6 publications, 24%
World Scientific
3 publications, 12%
Institute of Electrical and Electronics Engineers (IEEE)
2 publications, 8%
IOP Publishing
2 publications, 8%
Bonch-Bruevich State University of Telecommunications
1 publication, 4%
Akif Akgul
1 publication, 4%
ADBA Information Technology and Publishing Limited Company
1 publication, 4%
1
2
3
4
5
6
7
8
9
  • We do not take into account publications without a DOI.
  • Statistics recalculated weekly.

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
25
Share
Cite this
GOST |
Cite this
GOST Copy
Rybin V. et al. Discovering Chaos-Based Communications by Recurrence Quantification and Quantified Return Map Analyses // International Journal of Bifurcation and Chaos in Applied Sciences and Engineering. 2022. Vol. 32. No. 09.
GOST all authors (up to 50) Copy
Rybin V., Butusov D., Rodionova E., Karimov T., Ostrovskii V., Tutueva A. Discovering Chaos-Based Communications by Recurrence Quantification and Quantified Return Map Analyses // International Journal of Bifurcation and Chaos in Applied Sciences and Engineering. 2022. Vol. 32. No. 09.
RIS |
Cite this
RIS Copy
TY - JOUR
DO - 10.1142/s021812742250136x
UR - https://doi.org/10.1142/s021812742250136x
TI - Discovering Chaos-Based Communications by Recurrence Quantification and Quantified Return Map Analyses
T2 - International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
AU - Rybin, Vyacheslav
AU - Butusov, Denis
AU - Rodionova, Ekaterina
AU - Karimov, Timur
AU - Ostrovskii, Valerii
AU - Tutueva, Aleksandra
PY - 2022
DA - 2022/07/29
PB - World Scientific
IS - 09
VL - 32
SN - 0218-1274
SN - 1793-6551
ER -
BibTex
Cite this
BibTex (up to 50 authors) Copy
@article{2022_Rybin,
author = {Vyacheslav Rybin and Denis Butusov and Ekaterina Rodionova and Timur Karimov and Valerii Ostrovskii and Aleksandra Tutueva},
title = {Discovering Chaos-Based Communications by Recurrence Quantification and Quantified Return Map Analyses},
journal = {International Journal of Bifurcation and Chaos in Applied Sciences and Engineering},
year = {2022},
volume = {32},
publisher = {World Scientific},
month = {jul},
url = {https://doi.org/10.1142/s021812742250136x},
number = {09},
doi = {10.1142/s021812742250136x}
}