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

Author:

Rybin Vyacheslav1,Butusov Denis1ORCID,Rodionova Ekaterina1,Karimov Timur2ORCID,Ostrovskii Valerii2ORCID,Tutueva Aleksandra2ORCID

Affiliation:

1. Youth Research Institute, Saint-Petersburg Electrotechnical University LETI, 5, Professora Popova St., Saint Petersburg 197376, Russia

2. Department of Computer-Aided Design, Saint-Petersburg Electrotechnical University LETI, 5, Professora Popova St., Saint Petersburg, 197376, Russia

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.

Funder

Russian Science Foundation

Publisher

World Scientific Pub Co Pte Ltd

Subject

Applied Mathematics,Modeling and Simulation,Engineering (miscellaneous)

Cited by 20 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3