chaotic map
Recently Published Documents


TOTAL DOCUMENTS

1147
(FIVE YEARS 447)

H-INDEX

43
(FIVE YEARS 13)

2022 ◽  
Vol 4 (2) ◽  
Author(s):  
Unsub Zia ◽  
Mark McCartney ◽  
Bryan Scotney ◽  
Jorge Martinez ◽  
Ali Sajjad

AbstractPseudo-random number generators (PRNGs) are one of the building blocks of cryptographic methods and therefore, new and improved PRNGs are continuously developed. In this study, a novel method to generate pseudo-random sequences using coupled map lattices is presented. Chaotic maps only show their chaotic behaviour for a specified range of control parameters, what can restrict their application in cryptography. In this work, generalised symmetric maps with adaptive control parameter are presented. This novel idea allows the user to choose any symmetric chaotic map, while ensuring that the output is a stream of independent and random sequences. Furthermore, to increase the complexity of the generated sequences, a lattice-based structure where every local map is linked to its neighbouring node via coupling factor has been used. The dynamic behaviour and randomness of the proposed system has been studied using Kolmogorov–Sinai entropy, bifurcation diagrams and the NIST statistical suite for randomness. Experimental results show that the proposed PRNG provides a large key space, generates pseudo-random sequences and is computationally suitable for IoT devices.


2022 ◽  
Vol 16 (1) ◽  
pp. 0-0

Telecare Medicine Information System (TMIS) is now attracting field for remote healthcare, diagnosis and emergency health services etc. The major objective of this type of system is to provide medical facilities to patients who are critically ill and unable to attend hospitals or put in isolation for observations. A major challenge of such systems is to securely transmit patients' health related information to the medical server through an insecure channel. This collected sensitive data is further used by medical practitioners for diagnosis and treatment purposes. Therefore, security and privacy are essential for healthcare data. In this paper, a robust authentication protocol based on Chebyshev Chaotic map has been proposed for adequate security while transmitting data. The privacy preservation is maintained by a rule set which mainly controls the views. A detailed security analysis was performed for the proposed scheme.


2022 ◽  
Vol 16 (1) ◽  
pp. 0-0

One of the important issues in telemedicine field refers to an advanced secure communication. Digital image watermarking is an ideal solution since it protects the electronic patient information’s from unauthorized access. This paper presents a novel blind fragile-based image watermarking scheme in spatial domain that merges Speed Up Robust Features (SURF) descriptor with the well-known Weber Descriptors (WDs) and Arnold algorithm. It provides a good way for enhancing the image quality and time complexity for medical data integrity. Firstly, the watermark image is shuffled using Arnold chaotic map. Secondly, the SURF technique is practiced to Region of Interest (ROI) of the medical image and then the blocks around the SURF points are selected to insert the watermark. Finally, the watermark is encrusted and extracted using WDs. Experimental results show good image fidelity with the shortest execution time to ensure medical images integrity.


Author(s):  
Aliaa Sadoon Abd ◽  
Ehab Abdul Razzaq Hussein

Cryptography and steganography are among the most important sciences that have been properly used to keep confidential data from potential spies and hackers. They can be used separately or together. Encryption involves the basic principle of instantaneous conversion of valuable information into a specific form that unauthorized persons will not understand to decrypt it. While steganography is the science of embedding confidential data inside a cover, in a way that cannot be recognized or seen by the human eye. This paper presents a high-resolution chaotic approach applied to images that hide information. A more secure and reliable system is designed to properly include confidential data transmitted through transmission channels. This is done by working the use of encryption and steganography together. This work proposed a new method that achieves a very high level of hidden information based on non-uniform systems by generating a random index vector (RIV) for hidden data within least significant bit (LSB) image pixels. This method prevents the reduction of image quality. The simulation results also show that the peak signal to noise ratio (PSNR) is up to 74.87 dB and the mean square error (MSE) values is up to 0.0828, which sufficiently indicates the effectiveness of the proposed algorithm.


2022 ◽  
Vol 19 (3) ◽  
pp. 2489-2505
Author(s):  
Amit Kumar ◽  
◽  
Jehad Alzabut ◽  
Sudesh Kumari ◽  
Mamta Rani ◽  
...  

<abstract><p>In this paper, a novel one dimensional chaotic map $ K(x) = \frac{\mu x(1\, -x)}{1+ x} $, $ x\in [0, 1], \mu &gt; 0 $ is proposed. Some dynamical properties including fixed points, attracting points, repelling points, stability and chaotic behavior of this map are analyzed. To prove the main result, various dynamical techniques like cobweb representation, bifurcation diagrams, maximal Lyapunov exponent, and time series analysis are adopted. Further, the entropy and probability distribution of this newly introduced map are computed which are compared with traditional one-dimensional chaotic logistic map. Moreover, with the help of bifurcation diagrams, we prove that the range of stability and chaos of this map is larger than that of existing one dimensional logistic map. Therefore, this map might be used to achieve better results in all the fields where logistic map has been used so far.</p></abstract>


2021 ◽  
Vol 38 (6) ◽  
pp. 1637-1646
Author(s):  
KVSV Trinadh Reddy ◽  
S. Narayana Reddy

In distributed m-health communication, it is a major challenge to develop an efficient blind watermarking method to protect the confidential medical data of patients. This paper proposes an efficient blind watermarking for medical images, which boasts a very high embedding capacity, a good robustness, and a strong imperceptibility. Three techniques, namely, discrete cosine transform (DCT), Weber’s descriptors (WDs), and Arnold chaotic map, were integrated to our method. Specifically, the Arnold chaotic map was used to scramble the watermark image. Then, the medical image was partitioned into non-over lapping blocks, and each block was subjected to DCT. After that, the scrambled watermark image data were embedded in the middle-band DCT coefficients of each block, such that two bits were embedded in each block. Simulation results show that the proposed watermarking method provides better imperceptibility, robustness, and computational complexity results with higher embedding capacity than the contrastive method.


Webology ◽  
2021 ◽  
Vol 18 (2) ◽  
pp. 540-555
Author(s):  
Aqeel Mohsin Hamad

IOT information is always subjected to attacks, because component of the IOT system always unsupervised for most of time, also due to simplicity of wireless communication media, so there is high chance for attack, lastly, IOT is constraint device in terms of energy and computation complexity. So, different research and study are proposed to provide cryptographic algorithm. In this paper, a new image encryption is proposed based on anew chaotic map used to generate the binary key. The proposed map is three dimensional map, which is more sensitive to initial condition, each dimension of the 3-D chaotic map is depended on the others dimension, which may increase the randomness of the behavior trajectory for the next values and this gives the algorithm the ability to resist any attacks. At first, 3-D chaotic map is proposed, which is very sensitive for initial condition, the three dimension is depended on each other, which make the system more randomness, then the produced sequences is converted on binary key by using mod operation. The original image is scrambled based on mod operation to exchange the row and interleaving them, the same operations are repeated for column of the image. Later, the image is divided into blocks of size (8*8) and scrambled by using negative diagonal scan, the final pixels are converted into binary sequences, which are XORed with the generated key to produce the encrypted image. The experiment is performed on different images with different properties and tested with different metrics such as entropy, correlation, key sensitivity, number of pixel change rate (NPCR) and histogram of the original and encrypted images. T results shows that the proposed encryption algorithm is more efficient and outperform other methods.


Sign in / Sign up

Export Citation Format

Share Document