Exponential Chaotic Model for Generating Robust Chaos

Hua, Zhongyun; Zhou, Yicong

doi:10.1109/tsmc.2019.2932616

Cited by 88 publications

(49 citation statements)

References 44 publications

(53 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [21], the authors introduced a new 1-D chaotic map by exponential chaotic model. They used the exponential arithmetic operation for nonlinearity.…”

Section: B Chaotic Systemsmentioning

confidence: 99%

Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

Ibrahim

Alharbi

2020

IEEE Access

View full text Add to dashboard Cite

Image encryption schemes can be vulnerable to a variety of cryptanalysis attacks. The use of key-dependent dynamic S-boxes has been shown to improve security. Threats of chosen-plaintext and chosen-ciphertext attacks still linger. In this paper, we present an efficient algorithm for constructing secure dynamic S-boxes derived from Henon map. We use the proposed dynamic S-box to construct an image encryption scheme that includes a novel combination of security features to resist chosen-plaintext and chosen-ciphertext attacks. Namely, a hash verification step at the end of the decryption procedure effectively thwarts chosen-ciphertext attacks. The hash also serves as an image dependent initialization for the keystream, which together with using an image dependent S-box resist known-plaintext attacks. Furthermore, encryption keys are protected against cryptanalysis using elliptic curve cryptography (ECC).Therefore, the recovery of secret keys is as hard as the elliptic curve discrete logarithm problem even in the unlikely case of the recovery of the temporary S-box or keystream. Our evaluation of the proposed image encryption scheme reveals that it achieves a higher security standard than existing techniques. Moreover, the proposed scheme is computationally efficient with encryption throughput approaching 60 MB/s. INDEX TERMS chaotic map, elliptic curve cryptography, image encryption, substitution box.

show abstract

“…In [21], the authors introduced a new 1-D chaotic map by exponential chaotic model. They used the exponential arithmetic operation for nonlinearity.…”

Section: B Chaotic Systemsmentioning

confidence: 99%

Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

Ibrahim

Alharbi

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Cryptosystems have been widely designed using low dimensional chaotic maps like 1-D. Yet, such maps are vulnerable to various onslaught given that the range of chaos dynamics for 1-D maps is limited, initial values and key parameters produce a small keyspace, and finally, it is easy to predict their output [7].…”

Section: Introductionmentioning

confidence: 99%

A New Chaotic Map With Dynamic Analysis and Encryption Application in Internet of Health Things

Sankar²,

et al. 2020

View full text Add to dashboard Cite

In this paper, we report an effective cryptosystem aimed at securing the transmission of medical images in an Internet of Healthcare Things (IoHT) environment. This contribution investigates the dynamics of a 2-D trigonometric map designed using some well-known maps: Logistic-sine-cosine maps. Stability analysis reveals that the map has an infinite number of solutions. Lyapunov exponent, bifurcation diagram, and phase portrait are used to demonstrate the complex dynamic of the map. The sequences of the map are utilized to construct a robust cryptosystem. First, three sets of key streams are generated from the newly designed trigonometric map and are used jointly with the image components (R, G, B) for hamming distance calculation. The output distance-vector, corresponding to each component, is then Bit-XORed with each of the key streams. The output is saved for further processing. The decomposed components are again Bit-XORed with key streams to produce an output, which is then fed into the conditional shift algorithm. The Mandelbrot Set is used as the input to the conditional shift algorithm so that the algorithm efficiently applies confusion operation (complete shuffling of pixels). The resultant shuffled vectors are then Bit-XORed (Diffusion) with the saved outputs from the early stage, and eventually, the image vectors are combined to produce the encrypted image. Performance analyses of the proposed cryptosystem indicate high security and can be effectively incorporated in an IoHT framework for secure medical image transmission.

show abstract

“…However, the performance of the discrete chaotic system degrades because of the finite precision effect. Some research studies do lots of investigation to improve the performance in low-dimensional systems [11][12][13][14] and high-dimension systems [15,16]. Hua et al [13,14] proposed a novel and efficient low-dimensional chaotic system with high complexity.…”

Section: Introductionmentioning

confidence: 99%

Performance of Finite Precision on Discrete Chaotic Map Based on a Feedback Shift Register

Huang

Ding

2020

Complexity

View full text Add to dashboard Cite

The scintillating technological improvements have changed the process of communication in all parts of the world. Shopping, banking, instant communication, and so on can be operated online and do not care about the linkage of those Internet communications. Because of simple chaotic structure, discrete nature, less arithmetic computation, and high complexity, low-dimensional chaotic systems such as a logistic map and tent map are more attractive than a high-dimensional chaotic system. To overcome the disadvantages of a low-dimensional chaotic map with a finite precision in chaos-based application, the chaotic map with a feedback shift register (CMFSR) is proposed. The related properties and performance associated with CMFSR are analysed. The relationship among the precision of the system, the architecture, and the performance are discussed. The experiments about new pseudorandom number generator (PRNG) based on CMFSR show that our scheme is simple, secure, and easy to accomplish. Experiments show that the proposed architecture of CMFSR is secure for random number generation.

show abstract

Exponential Chaotic Model for Generating Robust Chaos

Cited by 88 publications

References 44 publications

Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography

A New Chaotic Map With Dynamic Analysis and Encryption Application in Internet of Health Things

Performance of Finite Precision on Discrete Chaotic Map Based on a Feedback Shift Register

Contact Info

Product

Resources

About