Computer arithmetic, chaos and fractals
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
A secret key cryptosystem by iterating a chaotic map
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Cryptanalysis of the chaotic-map cryptosystem suggested at EUROCRYPT'91
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Statistics of chaotic binary sequences
IEEE Transactions on Information Theory
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Enhancing the transmission security of content-based hidden biometric data
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part III
Chaotic keystream generator using coupled NDFs with parameter perturbing
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Suitability of chaotic iterations schemes using XORshift for security applications
Journal of Network and Computer Applications
Hi-index | 0.00 |
The applications of digital chaotic maps in discrete-time chaotic cryptography and pseudo-random coding are widely studied recently. However, the statistical properties of digital chaotic maps are rather different from the continuous ones, which impedes the theoretical analyses of the digital chaotic ciphers and pseudo-random coding. This paper detailedly investigates the statistical properties of a class of digital piecewise linear chaotic map (PLCM), and rigorously proves some useful results. Based on the proved results, we further discuss some notable problems in chaotic cryptography and pseudo-random coding employing digital PLCM-s. Since the analytic methods proposed in this paper can essentially extended to a large number of PLCM-s, they will be valuable for the research on the performance of such maps in chaotic cryptography and pseudo-random coding.