bibtype C - Conference Paper (international conference)
ARLID 0392921
utime 20240111140831.4
mtime 20130625235959.9
DOI 10.1007/978-3-319-00542-3
title (primary) (eng) Message Embedded Synchronization for the Generalized Lorenz System and Its Use for Chaotic Masking
specification
page_count 10 s.
media_type P
serial
ARLID cav_un_epca*0392920
ISBN 978-3-319-00541-6
ISSN 2194-5357
title Nostradamus 2013: Prediction, Modeling and Analysis of Complex Systems
part_num 210
part_title Advances In Intelligent Systems and Computing
page_num 313-322
publisher
place Cham
name Springer
year 2013
editor
name1 Zelinka
name2 I.
editor
name1 Chen
name2 G.
editor
name1 Rossler
name2 O. E.
editor
name1 Snášel
name2 V.
editor
name1 Abraham
name2 A.
keyword chaos synchronization
keyword secury encryption
author (primary)
ARLID cav_un_auth*0101074
name1 Čelikovský
name2 Sergej
full_dept (cz) Teorie řízení
full_dept (eng) Department of Control Theory
department (cz)
department (eng) TR
institution UTIA-B
full_dept Department of Control Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0215855
name1 Lynnyk
name2 Volodymyr
full_dept (cz) Teorie řízení
full_dept Department of Control Theory
department (cz)
department TR
institution UTIA-B
full_dept Department of Control Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
source
source_type textový dokument
source_size 232 kB
cas_special
project
project_id GA13-20433S
agency GA ČR
ARLID cav_un_auth*0292613
abstract (eng) This paper implements and analyzes the well-known message embedded synchronization scheme for the case of the generalized Lorenz system. Such a synchronization may be used for chaotic masking scheme using a single channel only. This method was already discussed in the earlier literature for the particular classes of systems. In this paper, a more general class wheremessage embedded synchronization is possible is described. Then, it is shown that the generalized Lorenz system falls within that class. Furthermore, using the resulting synchronization, the novel secure encryption scheme is proposed. It requires very reasonable amount of data to encrypt and time to decrypt one bit. Basically, to encrypt one bit, only one iteration (i.e. only one real number of 6 valid digits) is needed. At the same time, 100 percent of the carrying chaotic signal can be used. The method is also demonstrated by numerical simulations of a digital data encryption and decryption.
action
ARLID cav_un_auth*0291709
name Nostradamus 2013
place Ostrava
dates 03.06.2013-05.06.2013
country CZ
reportyear 2014
RIV BC
num_of_auth 2
presentation_type PR
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0221978
arlyear 2013
mrcbU56 textový dokument 232 kB
mrcbU63 cav_un_epca*0392920 Nostradamus 2013: Prediction, Modeling and Analysis of Complex Systems Advances In Intelligent Systems and Computing 210 978-3-319-00541-6 2194-5357 313 322 Cham Springer 2013
mrcbU67 Zelinka I. 340
mrcbU67 Chen G. 340
mrcbU67 Rossler O. E. 340
mrcbU67 Snášel V. 340
mrcbU67 Abraham A. 340