Modeling and Analysis of Chaos-based Spread Spectrum Scheme using Irregular LDPC Code and Non-Coherent 16-DCSK under Fading and Jamming

In chaos-based spread spectrum systems, the use of spreading code and chaotic binary sequence expands the bandwidth of the information-bearing signal but this expansion results in SNR degradation under the constraint of constant channel capacity according to Hartley-Shannon law. To compensate for this drawback, our proposed model employs an irregular low-density parity-check (LDPC) code with its iterative decoding algorithm. Coupled with this forward error correction (FEC) coding, we used non-coherent (NC) 16-ary differential chaos shift keying (16-DCSK) that additionally provides the ability of data encryption due to its use of chaotic signals compared with the conventional modulation schemes. Analytical expressions of bit error probability (BEP) are derived under the assumption of the three-ray model along with partial band noise jamming (PBNJ) over a Rayleigh fading channel. Simulation results assert that the proposed system can mitigate the effect of PBNJ via lowering BEP by coding gain and processing gain under identical transmission power. It is also confirmed that a higher level of security can be provided by the use of proposed two iteration functions of Duffing Map-based chaotic binary sequence than the security level of one iteration function of Logistic Map, based on the balance and autocorrelation analysis.

Download Full-text

Performance Simulation of Underwater Acoustic Spread Spectrum Communication Based on LDPC Code

Journal of Physics Conference Series ◽

10.1088/1742-6596/1873/1/012018 ◽

2021 ◽

Vol 1873 (1) ◽

pp. 012018

Author(s):

Xiao Fei Wei ◽

Jin Chen

Keyword(s):

Spread Spectrum ◽

Ldpc Code ◽

Spread Spectrum Communication ◽

Performance Simulation ◽

Underwater Acoustic

Download Full-text

A Facile Co-crystallization Approach to Fabricate Two-component Carbon Dots Composites Showing Time-Dependent Evolutive Room Temperature Phosphorescence Colors

Nanoscale Advances ◽

10.1039/d1na00362c ◽

2021 ◽

Author(s):

Jian Qu ◽

Xin Zhang ◽

Zhong-Jie Wang ◽

Shuyan Zhang ◽

Yejian Yu ◽

...

Keyword(s):

Carbon Dots ◽

Room Temperature ◽

Data Encryption ◽

Time Dependent ◽

Security Level ◽

Room Temperature Phosphorescence ◽

Two Component ◽

Carbon Based

Time-dependent evolutive afterglow materials can increase the security level by providing additional encryption modes in anti-counterfeiting and data encryption. The design of carbon-based materials with dynamic afterglow colors is attractive...

Download Full-text

E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree

Cryptography ◽

10.3390/cryptography5010004 ◽

2021 ◽

Vol 5 (1) ◽

pp. 4

Author(s):

Bayan Alabdullah ◽

Natalia Beloff ◽

Martin White

Keyword(s):

Data Storage ◽

Statistical Tests ◽

Data Encryption ◽

Search Tree ◽

Binary Search ◽

Binary Search Tree ◽

Security Level ◽

Avalanche Effect ◽

High Security Level ◽

Tree Data Structure

Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests.

Download Full-text

A Study on Cloud Storage Security Method Using Data Classification

Journal of University of Shanghai for Science and Technology ◽

10.51201/jusst/21/09657 ◽

2021 ◽

Vol 23 (09) ◽

pp. 1105-1121

Author(s):

Dr. Ashish Kumar Tamrakar ◽

◽

Dr. Abhishek Verma ◽

Dr. Vishnu Kumar Mishra ◽

Dr. Megha Mishra ◽

...

Keyword(s):

Cloud Storage ◽

Storage Systems ◽

Data Classification ◽

Data Encryption ◽

Security Requirements ◽

Security And Privacy ◽

Security Level ◽

Distributed Resources ◽

Storage Security ◽

Public Data

Cloud computing is a new model for providing diverse services of software and hardware. This paradigm refers to a model for enabling on-demand network access to a shared pool of configurable computing resources, that can be rapidly provisioned and released with minimal service provider interaction .It helps the organizations and individuals deploy IT resources at a reduced total cost. However, the new approaches introduced by the clouds, related to computation outsourcing, distributed resources and multi-tenancy concept, increase the security and privacy concerns and challenges. It allows users to store their data remotely and then access to them at any time from any place .Cloud storage services are used to store data in ways that are considered cost saving and easy to use. In cloud storage, data are stored on remote servers that are not physically known by the consumer. Thus, users fear from uploading their private and confidential files to cloud storage due to security concerns. The usual solution to secure data is data encryption, which makes cloud users more satisfied when using cloud storage to store their data. Motivated by the above facts; we have proposed a solution to undertake the problem of cloud storage security. In cloud storage, there are public data that do not need any security measures, and there are sensitive data that need applying security mechanisms to keep them safe. In that context, data classification appears as the solution to this problem. The classification of data into classes, with different security requirements for each class is the best way to avoid under security and over security situation. The existing cloud storage systems use the same Journal of University of Shanghai for Science and Technology ISSN: 1007-6735 Volume 23, Issue 9, September – 2021 Page-1105 key size to encrypt all data without taking into consideration its confidentiality level. Treating the low and high confidential data with the same way and at the same security level will add unnecessary overhead and increase the processing time. In our proposal, we have combined the K-NN (K Nearest Neighbors) machine learning method and the goal programming decision-making method, to provide an efficient method for data classification. This method allows data classification according to the data owner security needs. Then, we introduce the user data to the suitable security mechanisms for each class. The use of our solution in cloud storage systems makes the data security process more flexible, besides; it increases the cloud storage system performance and decreases the needed resources, which are used to store the data.

Download Full-text

Design of Logistic Map-Based Spreading Sequence Generation for Use in Wireless Communication

Next Generation Wireless Network Security and Privacy - Advances in Information Security, Privacy, and Ethics ◽

10.4018/978-1-4666-8687-8.ch003 ◽

2015 ◽

pp. 81-121 ◽

Cited By ~ 1

Author(s):

Katyayani Kashayp ◽

Kandarpa Kumar Sarma ◽

Manash Pratim Sarma

Keyword(s):

Wireless Communication ◽

Spread Spectrum ◽

Logistic Map ◽

Chaotic Sequence ◽

Wireless Channel ◽

Computational Time ◽

Spreading Sequence ◽

Sequence Generation ◽

Critical Issues ◽

Code Division Multiple

Spread spectrum modulation (SSM) finds important place in wireless communication primarily due to its application in Code Division Multiple Access (CDMA) and its effectiveness in channels fill with noise like signals. One of the critical issues in such modulation is the generation of spreading sequence. This chapter presents a design of chaotic spreading sequence for application in a Direct Sequence Spread Spectrum (DS SS) system configured for a faded wireless channel. Enhancing the security of data transmission is a prime issue which can better be addressed with a chaotic sequence. Generation and application of chaotic sequence is done and a comparison with Gold sequence is presented which clearly indicates achieving better performance with simplicity of design. Again a multiplierless logistic map sequence is generated for lower power requirements than the existing one. The primary blocks of the system are implemented using Verilog and the performances noted. Experimental results show that the proposed system is an efficient sequence generator suitable for wideband systems demonstrating lower BER levels, computational time and power requirements compared to traditional LFSR based approaches.

Download Full-text

Dynamic Logistic Map Based Spread Spectrum Modulation in Wireless Channels

International Journal of Applied Evolutionary Computation ◽

10.4018/ijaec.2018040105 ◽

2018 ◽

Vol 9 (2) ◽

pp. 52-65

Author(s):

Katyayani Kashyap ◽

Tarun Kumar Sharma

Keyword(s):

Spread Spectrum ◽

Wireless Channels ◽

Logistic Map ◽

Chaotic Sequence ◽

Direct Sequence Spread Spectrum ◽

Computational Time ◽

Sequence Length ◽

Spreading Sequence ◽

Nonlinear Channels ◽

Spread Spectrum Modulation

Generation of an efficient spreading code in Spread Spectrum Modulation (SSM) is always challenging due to considerations like optimum sequence length, physical layout of registers and power requirements. In this article, a design of a dynamic chaotic spreading sequence for application in a Direct Sequence Spread Spectrum (DS SS) based system with the considerations of wireless channels (Rayleigh and Rician) are presented. Generation of dynamic chaotic sequence for application in linear and nonlinear channels is done and a comparison with static chaotic sequence is presented. Evaluation of performance is done in terms of bit error rate (BER), computational time, mutual information and signal power for faded channel taking into considerations of different modulation schemes, which finally dictates the efficiency of the generated code. The performance of the generated dynamic logistic map-based sequence is compared to that obtained from Gold code under equivalent conditions.

Download Full-text

CIPHER SYSTEMS BASED ON CONTROLLED EXACT CHAOTIC MAPS

International Journal of Bifurcation and Chaos ◽

10.1142/s0218127410028173 ◽

2010 ◽

Vol 20 (12) ◽

pp. 4039-4053 ◽

Cited By ~ 2

Author(s):

ALI KANSO

Keyword(s):

Time Series ◽

Cycle Length ◽

Chaotic Maps ◽

Necessary Conditions ◽

Logistic Map ◽

Security Level ◽

Encryption Scheme ◽

Key Space ◽

Suggested Technique ◽

High Level

In this paper, we present a class of chaotic clock-controlled cipher systems based on two exact chaotic maps, where each map is capable of generating exact chaotic time series of the logistic map. This class is designed in such a way that one map controls the iterations of the second map. The suggested technique results in generating orbits possessing long cycle length and high level of security from the two periodic exact maps. In the first part of this paper, two keystream generators based on two exact chaotic logistic maps are suggested for use in cryptographic applications. The necessary conditions to generate orbits with guaranteed long enough cycle length are established. Furthermore, the generated keystreams are demonstrated to possess excellent randomness properties. In the second part, we suggest a clock-controlled encryption scheme related to Baptista's scheme and based on two exact chaotic logistic maps. This technique results in increasing the size of the key space, and hence may increase the security level against some existing cryptanalytic attacks. Furthermore, it leads to reducing the size of the ciphertext file and propably increasing the encryption speed.

Download Full-text

A cryptosystem for lossless/lossy grayscale images in IWT domain using chaotic map-based generated key matrices

International Journal of Wavelets Multiresolution and Information Processing ◽

10.1142/s0219691318500248 ◽

2018 ◽

Vol 16 (04) ◽

pp. 1850024 ◽

Cited By ~ 2

Author(s):

Kshiramani Naik ◽

Arup Kumar Pal

Keyword(s):

Chaotic Map ◽

Logistic Map ◽

Security Analysis ◽

Image Data ◽

Natural Images ◽

Security Level ◽

Original Image ◽

Data Set ◽

The Individual ◽

Chaotic Logistic Map

In this paper, an image encryption scheme based on reversible integer wavelet transform (IWT) with chaotic logistic map is designed. The proposed cryptosystem is applicable to encipher both the medical and natural images in lossless and lossy manners, respectively. Initially, the original image is transformed with the multilevel of IWT, then the image data set is divided into low sub-band (approximation part) and high sub-bands (detail part). The approximation part gets confused with the chaotic logistic map followed by the bit plane decomposition. Next, the individual bit planes are further diffused with several binary key metrics, generated using a chaotic logistic map. The proposed key schedule derives several large size of binary key metrics from a small size of key. Based on the type of applications, the detail part is considered for lossless/lossy compression. The lossless/lossy compressed detail part is further considered only for confusion process using the logistic map for the sake of enhancing the security level. Finally, the cipher image obtained after inverse IWT is significantly dissimilar than original image. The scheme has been tested on several standard medical and natural images and the experimental results substantiate that a small size of key is enough to protect the content of images completely. The security analysis reveals that the proposed scheme is suitable for protecting the image data effectively.

Download Full-text