Robust and Secure Method for Transmitting Binary Message Using Binary Chaotic Sequence
Zhou Changsong, Chen Tian-Lun
Abstract
Open-access reader
Zhou Changsong, Chen Tian-Lun
Abstract
Open-access reader
Unlike masked with analog chaotic sequence, digital information is masked with binary chaotic sequence with a method proposed by U. Parlitz and S. Ergezinger (Phys. Lett. 198A (1994) 146). It is demonstrated by numerical simulations that both security and robustness of this communication method are improved. When considered as digital communication, the method is very robust to transmission errors.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Unlike masked with analog chaotic sequence, digital information is masked with binary chaotic sequence with a method proposed by U. Parlitz and S. Ergezinger (Phys. Lett. 198A (1994) 146). It is demonstrated by numerical simulations that both security and robustness of this communication method are improved. When considered as digital communication, the method is very robust to transmission errors.
Key concepts: Chaotic, Binary number, Pseudorandom binary sequence, Robustness (evolution), Computer science, Sequence (biology), Secure communication, Algorithm