A Three-Dimensional Infinite Collapse Map with Image Encryption

Yan, Wenhao; Jiang, Zijing; Huang, Xin; Ding, Qun

doi:10.3390/e23091221

Cited by 4 publications

(2 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this part, the chaotic trajectories, Lyapunov exponents and permutation entropies of 3D-TCICM are compared with the existing chaotic systems (3D-SIMM) [14], (3D-LICC) [15], (3D-Logistic) [16], (3D-ICM) [17] and (3D-Henon) [18], and the randomness of 3D-TCICM chaotic sequence is tested.…”

Section: B Chaotic Behaviorsmentioning

confidence: 99%

See 1 more Smart Citation

Compression and Cryptography Algorithms for 3D Remote Sensing Point Cloud Data Based on 3D-TCICM and ECC

Yan,

Nan,

Feng

et al. 2023

IEEE Photonics J.

View full text Add to dashboard Cite

This paper proposes an asymmetric encryption and compression method based on three-dimensional Tent-Cubic-ICMIC map (3D-TCICM) and elliptic curve encryption (ECC) for 3D remote sensing point cloud. Due to the large size, rich data and high security of remote sensing point cloud, an encryption and compression method with high computing efficiency and high security is required. The point cloud is first divided into blocks, then compressed by point cloud library (PCL) using octree, and then the resulting data stream is encrypted. During encryption, a chaotic system 3D-TCICM with excellent chaotic behavior is proposed. Its initial values are generated by point cloud data and ECC algorithm. The sender and receiver only hold the public key or private key respectively, which further improves the security of the algorithm. The encryption factors are also generated for subsequent encryption operations, which improves the plaintext correlation. The encryption algorithm includes innovative scrambling algorithm between multiple blocks (MBS), helix diffusion in GF(2 8 ) field and multiple S-boxes substitution, in which different S-boxes are provided for each data block. Simulation results indicate that the proposed scheme surpasses existing algorithms in terms of security, randomness, and plaintext correlation, all while maintaining a lower computational complexity. The algorithm exhibits robustness against various attacks such as differential, statistical, chosen-plaintext, known-plaintext, chosen-ciphertext, noise, and cropping attacks.

show abstract

Section: B Chaotic Behaviorsmentioning

confidence: 99%

“…It can be seen that the correlation coefficients of this algorithm is closer to 0 than that of other algorithms, indicating that the randomness and security of this algorithm are higher. [17] -0.0009 -0.0012 0.001 Ref. [26] -0.0009 -0.0005 0.0029 Ref.…”

Section: F Correlation Analysismentioning

confidence: 99%