Logistic Map Model Research Articles

Message steganography using separate locations and blocks

A novel method of message steganography is introduced to solve the disadvantages of traditional least significant bit (LSB) based methods by dividing the covering-stego image into a secret number of blocks. A chaotic logistic map model was performed using the chaotic parameters and the number of image blocks for generating a chaotic key. This key was then sorted, and the locations of blocks 1 to 8 were used to select the required blocks to be used as covering-stego blocks. The introduced method simplifies the process of message bits hiding and extracting by adopting a batch method of bits hiding and extracting. A comparative analysis was conducted between the outcomes of proposed method and those of prevalent approaches to outline the enhancements in both speed and quality of message steganography.

Secure Stego Method to Protect SMS Transmission

A novel method of message steganography will be proposed. The method will use a digital speech file as a covering media. The 32 binary bits of each speech sample will be used for data hiding, using these bits will increase the hiding capacity, and changing them will not much affect the sample value, thus the quality of the stego file will be always high. The proposed method will use a private key to protect the hidden message, the protection will be applied by shuffling the rows of the speech binary matrix using the contents of the generated indices key, The induces key will be generated by running a chaotic logistic map model using the values of the chaotic parameters included in the private key. The proposed method will be tested and implemented using various messages, the quality, sensitivity and speed of the proposed method will be analyzed to prove the enhancements provided by the proposed method.

Comparative Analysis of using SIK for Message Cryptography

The process of selecting the private key, which is used in the process of generating the secret key to encrypt messages, is one of the most important processes used in the encryption process, which determines the efficiency of the method used in terms of security and speed of implementation, because part of the encryption time is consumed in generating the secret key. In this paper research we will introduce two methods of using private keys to generate a secret index key, the first key will be used a chaotic logistic map model to generate a chaotic key, the chaotic key will be converted to secret index key. The second way is using a color image as an image_key, an array will be extracted from this image, and the array will be converted to secret index key. A simple procedure of message encryption-decryption will be used, this procedure is based on the secret index key, this key will be used to rearrange the message characters’ binary bits. The two approaches of generating secret index key will be implemented using various messages, the obtained results will be analyzed, and the results of analysis will be used to raise some recommendations regarding the message length, security, quality and the speed of message cryptography.

Securing LSB steganography using bite substitution and image blocking

Protecting secret messages is a vital issue, in this paper’s research, a simplified, highly secure method of message steganography will be introduced. The proposed method will use a complicated PK, which contains information to select a secret block from the color image to be used as a covering block; also it will contain the values of the chaotic logistic map model to run this model to generate the indices key needed to substitute the message binary matrix. The PK will provide a huge keyspace capable to resist hacking attacks, the extracted message will be very sensitive to any minor changes in the PK, and any changes in this key during the extraction phase will be considered a hacking attempt by producing a damaged extracted message. It will be shown that the proposed method will be always efficient when changing the message length and changing the covering images. The proposed method will be implemented using various messages and various covering images, the obtained results will be analyzed using various types of data analysis methods to prove the improvements provided by the proposed method (quality, security, and efficiency).

Complex CLMM Private Keys to Secure Digital Color Images

Color digital images are one of the most widespread and widely used types of data, and the image can be secret or of a special nature, or it can be a carrier of confidential data, which makes protecting it very important. In this research, a new method for protecting color digital images will be presented, and the ease of implementing this method and its suitability for any digital image will be shown. The proposed method will provide a high degree of security and provide a high degree of protection for the digital image through the use of a complex private key based on chaotic logistic map model, six chaotic key will be used to form six integer keys, and these keys will be resized to match the dimensions of each color channel. The proposed method will use two rounds of data cryptography; each round will require three private keys, one for each color. Different variations of CLMM will be used to generate 1D and 2D chaotic keys, the results of using 1D chaotic keys will be compared with the results of using 2D chaotic keys and some recommendations will be raised. The proposed method will be implemented, different types of results analysis's (Quality analysis, sensitivity analysis, and throughput analysis) to improve the enhancement provided by yje proposed method comparing with other existing methods.

Simple and Efficient Chaotic Based Method of Message Cryptography

A simple and easy to implement method of secret message cryptography will be introduced. The message to be encrypted-decrypted is to be converted to binary matrix, this matrix is to be reshaped to 16 columns matrix, and the contents of this matrix will be rearranged base on the contents of the generated indices key. A chaotic paramaters included in the private key will be used to run a chaotic logistic map model to generate a 16 elements chaotic key, this key will be sorted to get the required indices key. The proposed method will be flixeble and it will be used to encrypt-decrypt any message with any length. Changing the message or/and changing the key will not affect the method. The produced decrypted message will be sensitive to the selected PK, any changes in the private key in the decryption process will produce a carrupted unreadable message. The proposed method will be tested and implemented using various in sizes messages, the obtained result will be used to prove the sensitivity, quality and efficiency of the proposed method.

Triple Rounds to Protect Text Files

Text file may be confidential and it can contain secret information that required protection from being hacked. In this research paper a simple method of text files cryptography will be introduced, this method will suit any text file with any size; the sequence of required operations will remain the same without any change even if we change the text file and the private key. The introduced method of data cryptography will provide a high level of security; the private key will provide a huge key space making the hacking process impossible. The private key will have a complicated structure with multiple components, these components are to be used to generate three keys needed to apply three rounds of encryption-decryption, the keys will be very sensitive to any minor changes, any changes in the private key components in the decryption phase will be considered as a hacking attempt. The private key will base on chaotic logistic map model to generate 2D chaotic keys. The proposed method will be implemented and the obtained results will be analyzed using various types of analysis to prove the efficiency enhancement provide by the proposed method.

Digital Image Cryptography using Index Keys

A simple and easy to implement method of data cryptography will be introduced. This method can be easily used to encrypt-decrypt digital images with any type and size, it can be used to treat gray images, color images and secret messages. The simplified encryption and decryption function will minimize the required time for cryptography and they will use a simple operation of pixels’ values rearrangement to apply encryption and decryption. The values rearrangement is to be applied using a generated index key. The index key is generated using the chaotic logistic key formed by running a chaotic logistic map model using a selected values of chaotic parameters. The proposed method will increase the level of image protection by using a private key which is capable to increase the key space to resist hacking attacks. The proposed method will be tested and implemented using various images, the obtained results will be analyzed to prove the quality, efficiency and sensitivity of the proposed method.

Increasing the security of transmitted text messages using chaotic key and image key cryptography

It is critical to safeguard confidential data, especially secret and private messages. This study introduces a novel data cryptography approach. The new approach will be capable of encrypting and decrypting any communication size. The suggested approach will use a sophisticated private key with a convoluted structure. The private key will have 5 components with a double data type to prevent guessing or hacking. The confidential data will produce two secret keys, the first of which will be taken from the image key. These keys will be vulnerable to slight changes in private key information. To maximize the approach's efficiency, the suggested method will deal with lengthy messages by splitting them into chunks. On the other hand, the chaotic logistic map model will be used to create the second key. The suggested technique will be implemented, and several sorts of analysis (sensitivity, quality, security, and speed analysis) will be undertaken to demonstrate the benefits of the proposed method. The quality metrics MSE, PSNR, and CC will be computed to validate the suggested method's quality. To illustrate the efficiency of the proposed technique, encryption and decryption times will be measured, and cryptography throughputs will be determined. Various PKs will be tried throughout the decryption process to demonstrate how sensitive the produced outputs are to changes in the private key. The suggested approach will be tested, and the results will be compared to the results of existing methods to demonstrate the improvement offered by the proposed method.

Secure Method to Protect Secret Short Messages using Rearrangement Key

An efficient, highly secure and simple method of short messages cryptography method will be introduced. The method will use a rearrangement key to encrypt-decrypt SMs, the key will be generated by running a chaotic logistic map model with a selected parameter, these parameters will form the private secret key which is known by the data sender and the data receiver. The private key will provide the necessary key space to resist hacking attacks. The SM up to I K bytes will be encrypted-decrypted using RK, if the message size is greater than 1 K bytes, the message will be divided into blocks of 1 K bytes’ length, and each block can be encrypted-decrypted using its own RK. The method will be simple and easy to implement, and it can suit any message with any length, the process of encryption is based on putting the character from the SM in its position maintained in the RK, the decryption will be implemented by recovering the characters from the decrypted SM by the indexes in the RK from the index 1 to the index L (L: is the message length). The proposed method will be implemented using various SMs, the results will be analyzed. Based on the obtained values of MSE, PSNR, CC and NSCR it will be proved that the proposed method satisfies the quality requirements in the encryption and decryption phases. The speed of the proposed method will be tested and the obtained results will be compared with other methods speed to show the improvements provided by the proposed method.

Text Files Protection using Chaotic Logistic Keys

Text file some times contains secret or personal data which requires for protection from being hacked by unauthorized data hackers. In this research paper a simple, efficient and highly secure method of text file cryptography will be introduced. The text file will be divided into partitions with small sizes to increase the cryptography process throughput. Each partition will be encrypted-decrypted using its associated secret key. Each secret key will be generated from a chaotic logistic map by running a chaotic logistic map model with selected values of chaotic parameters. The chaotic keys will be converted to indices keys to form the secret keys. The secret keys will be used as a lockup tables to apply text file encryption-decryption. The characters of the text file will be rearranged based on the secret key indexes to form the encrypted text file. The characters of the encrypted file will be retrieved by the sequence of the indexes in the secret key. The contents of the decrypted file will be very sensitive to any changes in the chaotic parameters. The PK will have a complicated structure and it will contain the chaotic parameters values and the partition size. The partition size will be a percentage from the total text file size; this complicated structure will increase the key space, making it capable to resist any attack. The proposed method will be implemented using various in size text files, the obtained results will be analyzed to prove the quality, security and efficiency of the proposed method.

Digital Image Cryptography using Lookup Table

Protecting digital images is an important task, because images may be secret or may be contain valuable secret information. In this paper research a simple, efficient and high secure method of digital images protection will be introduced. The method will use a chaotic logistic map model with a selected chaotic parameter to generate a lookup table, which will be used in the encryption and decryption phases. The proposed method can use one lookup table to encrypt-decrypt color images, or it can use three lookup tables to encrypt-decrypt each color channel. The method will secure the encrypted image by using a complicated private key, which will provide a suitable key space capable to resist hacking attacks, the method outputs will be very sensitive to the selected private key contents, any minor changes in these contents in the decryption phase will be considered as a hacking attempt by producing a damaged decrypted image. It will be shown how using lookup table simplifies the process of image cryptography using the indexes and the indexes contents of the lookup table. The proposed method will be implemented and the obtained results will be analyzed to prove the quality of encryption and decryption phases based on the calculated MSE, PSNR, CC and NSCR. The speed of the proposed method will be tested, to show how the proposed method will increase the throughput of data cryptography by decreasing both the encryption and decryption times.

Securing Digital Image using Modified Chaotic Logistic Key

Digital image is an important data type due to the wide applications requiring this data type. Some applications require image securing to protect the image from being hacked. Increasing the complicity of the private key will enhance the security level of the image by increasing the kay space size. In this paper research a chaotic logistic map model will be used to generate the required key for data cryptography. A modification in the CLMM will be added to generate a 3D chaotic key, this key will be converted to integer key, then the obtained key will be rotated left using another information imbedded in the PK, the rotated key will be resized to match the color channel size using simple and efficient method of image resizing. Each color channel will be encrypted-decrypted separately using its own generated key. The proposed method will be implemented using various images, the obtained results will be analyzed using various methods of data analysis. The quality analysis will be use the calculated values of the quality parameters MSE, PSNR, CC and NSCR to prove the quality requirements in the encryption and decryption phase. Efficiency analysis of ET/DT and TP will be used to show the enhancements provided by the proposed method and to measure the speedup of the proposed method comparing with other existing methods of data cryptography.

Bits and Characters Substitutions to Increase the Security Level of Transmitted Secret Message

Chaotic logistic map model is an interesting tool, it has good features, which make it capable to create chaotic keys, these keys are stable and sensitive to the selected values of chaotic parameters. In this paper research we will introduce a simple, secure and efficient method of secret message cryptography. The encryption-decryption phases will be implemented in two rounds. Two secret keys will be used; these keys will be generated by running two CLMM with a selected chaotic parameter. The first key ‘CSK’ will be used for message characters’ substitution, while the second secret key ‘BSK’ will be used for message binary version bits’ substitution. The two secret keys will be generated using a PK which contains the selected values of the CLMM. The PK will provide a huge key space capable to resist any hacking attack, also the generated two keys will be sensitive to any changes in the PK components, making any minor changes in these components in the decryption phase will be considered as a hacking attempt. The proposed method will be implemented using various messages, the obtained results will be analyzed using various types of data analysis method to prove the quality, security and the efficiency of the proposed method.

Demonstration of the high-security 3D-CAP scheme in multi-core fiber transmission

In this paper, the high-security three-dimensional (3D) carrier-less amplitude-phase (CAP) modulation based on 3D space constellation masking in multi-core fiber (MCF) transmission is proposed. Logistic Map model and Four-wing hyper-chaotic systems are employed to implement bit-level encryption, displacement masking, and space masking. This way, we achieved a key space of 1 × 1083 size, which resists violent attacks, and improves the physical layer security of the system. The superposition combined two chaotic models reduces the difficulty of implementation and enables more security for constellation encryption. A 280 Gb/s encrypted 3D-CAP32 signal transmission over 2.5 km MCF is experimentally demonstrated. The experimental results show that the proposed scheme can effectively resist illegal attack from an un-authorized optical network unit (ONU), and compared with an unencrypted 3D-CAP32 signal, the encrypted 3D-CAP32 signal has a receiver sensitivity penalty of 0.38 dB in a back-to-back configuration at a BER of 1 × 10−3. It is a strong candidate for the future highly-secured optical access network.

Detailed Analysis of Chaotic Logistic Map Model and Applications

Chaotic logistic map can be used to generate private key with different dimensions, this can be easily used to secure the process of data cryptography, required to encrypt-decrypt messages, images or audio files. Some of the encrypted-decrypted data (messages images) requires inter values keys, other like audio files require fraction values keys. In this research paper we will perform a detailed study of chaotic logistic map model to give some valuable recommendation of many aspects such as: the suitable range of the growth rate parameter, the suitable range of the initial generation, the sensitivity feature, the required time to generate private keys. It will be show how to generate 1D and 2D private keys with integer values and with fractional values, these key will be generated taking in mined the process of optimizing the generation time and the selected length of key which can optimize the process of cryptography.

Two Complicated PKs to Protect Secret Messages

Increasing the message protection degree is a vital issue. In this paper research a new, simple, secure and efficient method of message cryptography will be proposed. The method will use two private keys for encryption decryption. The first key is to be generated from a secret image_key; the second key is to be generated using chaotic logistic map model. The two key will form a complicated complex key which cannot be hacked, thus will secure the transmitted messages from being hacked. The PK will be very sensitive to any changes: image_key, selected image color, message length and chaotic parameters. Any minor change in the decryption phase will generate new PK, and a corrupted damaged decrypted message will be produced. A set of analyses (sensitivity, quality and throughput) will be performed to prove the improvements and efficiency provides by the proposed method.

Analysis of time series in the cumulative residual entropy plane based on oscillation roughness exponent

In this work, we propose the cumulative residual entropy (CRE) plane and CRE curve based on the weighted-multiscale cumulative residual Renyi/Tsallis permutation entropy and oscillation roughness exponent to analyze complex dynamic systems. The oscillation roughness exponent method and the cumulative residual distribution theorem adopted in our proposed methods are two core theories to depict more detailed information of complex dynamic systems in a more efficient way by reducing information loss and capture the statistics of the related time series’ roughness. Trials are operated on the logistic map model as numerical experiments, and we discover that our methods are capable of discriminating different types of complex data with high accuracy. Compared with the original methods, our methods are more superior in extracting more subtle details to distinguish different dynamic systems. In the experiments with the financial stocks, our methods are still found to be more reasonable in discriminating stock indices from different parts of the world by making comparisons with original methods.

Analysis of financial stock markets through multidimensional scaling based on information measures

In this paper, a novel multidimensional scaling (MDS) based on information measures method is proposed to analyze financial stock markets. In order to examine the effectiveness of this method, we applied it to the classification of two types of artificial series, the logistic map model and the cubic map model, as well as stock time series. Moreover, the traditional MDS using Euclidean dissimilarity is also provided as a reference for comparisons. The results show that the MDS based on information measures can give us more detailed, exact and clearer information on the classification of simulation series and stock time series than the MDS using Euclidean dissimilarity. In addition, the proposed graphical method may also assist in the construction of multivariate econometric models.

A discrete-time chaotic oscillator based on the logistic map: A secure communication scheme and a simple experiment using Arduino

This paper presents a modified discrete-time chaotic system obtained from the standard logistic map model. Then, a secure communication system is given and numerical experiments are carried out using the conceived discrete-time chaotic oscillator. Moreover, an experiment of our chaotic model is realized using the Arduino-UNO board.