bibtype C - Conference Paper (international conference)
ARLID 0050088
utime 20240111140644.3
mtime 20070105235959.9
title (primary) (eng) Observer-based chaos synchronization in the generalized chaotic Lorenz systems and its application to secure encryption
specification
page_count 6 s.
media_type web
serial
ARLID cav_un_epca*0077921
ISBN 1-4244-0171-2
title Proceedings of the 45th IEEE Conference on Decision and Control
page_num 3783-3788
publisher
place San Diego
name Omnipress
year 2006
title (cze) Synchronizace chaosu ve zobecněném Lorenzově systému a jeji využití k šifrování
keyword nonlinear systems
keyword chaotic systems
author (primary)
ARLID cav_un_auth*0101074
name1 Čelikovský
name2 Sergej
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
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*0101204
name1 Šebek
name2 Michael
institution UTIA-B
full_dept Department of Control Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
source
source_type hypetextový soubor
url http://www.ieeecss.org/CAB/conferences/cdc2006/index.php
COSATI 09I
cas_special
project
project_id GA102/05/0011
agency GA ČR
ARLID cav_un_auth*0213187
research CEZ:AV0Z10750506
abstract (eng) This paper studies the application of the observer-based chaos synchronization in the so-called Generalized Lorenz systems to secure encryption. More precisely, a modified version of the Chaos Shift Keying (CSK) scheme for secure encryption and decryption of data is proposed. Recall, that the classical CSK method determines the correct value of binary signal through checking which unsynchronized system is getting synchronized. On the contrary, our novel method, called as the Anti-Synchronization Chaos Shift Keying (ACSK) method, determines wrong value of binary signal through checking which already synchronized system is loosing synchronization. Even when using two very close each to other chaotic sys-tems, the anti-synchronization is thousand times faster than synchronization. As a consequence, unlike the classical CSK, the method proposed here requires very reasonable amount of data to encrypt and time to decrypt a single bit. Moreover, its security can be systematically investigated showing its good resistance against typical decryption attacks.
abstract (cze) Článek se zabývá využitím nelineární rekonstrukce k synchronizaci chaosu a následným využitím této synchronizace k vývoji šifrovacího software. Zároveň je navržena nová metoda šifrování, která poprvé poskytuje realističtější využití časově spojitých chaotických systemů k přímému šifrování binárních dat. Metoda je ilustrována na příkladech a také je proveden rozbor možných útoků na příslušnou šifru.
action
ARLID cav_un_auth*0222836
name IEEE Conference on Decision and Control /45./
place San Diego
dates 13.12.2006-15.12.2006
country US
reportyear 2007
RIV BC
permalink http://hdl.handle.net/11104/0140314
arlyear 2006
mrcbU56 hypetextový soubor
mrcbU63 cav_un_epca*0077921 Proceedings of the 45th IEEE Conference on Decision and Control 1-4244-0171-2 3783 3788 San Diego Omnipress 2006