Zhu, Congxu
Central South University
8 papers on CoChatORCID 0000-0002-9662-0532
Most cited papers
- Verified
A novel image encryption scheme based on improved hyperchaotic sequences
Zhu, C. (2012) · Optics Communications
Chaos-based Image/Signal EncryptionComputer Science and Engineering
Cited by 432
- Verified
An Efficient Image Encryption Scheme Based on the LSS Chaotic Map and Single S-Box
Lu, Q., Zhu, C., & Deng, X. (2020) · IEEE Access
Chaos-based Image/Signal EncryptionComputer Science and Engineering
Cited by 281
- Verified
Cryptanalyzing and improving a novel color image encryption algorithm using RT-enhanced chaotic tent maps
Zhu, C., & Sun, K. (2018) · IEEE Access
Chaos-based Image/Signal EncryptionComputer Science and Engineering
Cited by 171
- Verified
A Secure and Fast Image Encryption Scheme Based on Double Chaotic S-Boxes
Zhu, S., Wang, G., & Zhu, C. (2019) · Entropy
Chaos-based Image/Signal EncryptionComputer Science and Engineering
Cited by 131
- Verified
Cryptanalysis and Improvement on an Image Encryption Algorithm Design Using a Novel Chaos Based S-Box
Zhu, C., Wang, G., & Sun, K. (2018) · Symmetry
Chaos-based Image/Signal EncryptionCryptographic Implementations and Security
Cited by 90
- Verified
Improved Cryptanalysis and Enhancements of an Image Encryption Scheme Using Combined 1D Chaotic Maps
Zhu, C., Wang, G., & Sun, K. (2018) · Entropy
Chaos-based Image/Signal EncryptionComputer Science and Engineering
Cited by 76
- Verified
A visually secure asymmetric image encryption scheme based on RSA algorithm and hyperchaotic map
Xu, Q., Sun, K., & Zhu, C. (2020) · Physica Scripta
Chaos-based Image/Signal EncryptionAdvanced Steganography and Watermarking Techniques
Cited by 39
- Verified
A secure image encryption scheme with compression-confusion-diffusion structure
Zhu, S., Zhu, C., Fu, Y., Zhang, W., & Wu, X. (2020) · Multimedia Tools and Applications
Chaos-based Image/Signal EncryptionAdvanced Data Compression Techniques
Cited by 19
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free