×

A fast image encryption system based on chaotic maps with finite precision representation. (English) Zbl 1127.94004

Summary: In this paper, a fast chaos-based image encryption system with stream cipher structure is proposed. In order to achieve a fast throughput and facilitate hardware realization, 32-bit precision representation with fixed point arithmetic is assumed. The major core of the encryption system is a pseudo-random keystream generator based on a cascade of chaotic maps, serving the purpose of sequence generation and random mixing. Unlike the other existing chaos-based pseudo-random number generators, the proposed keystream generator not only achieves a very fast throughput, but also passes the statistical tests of up-to-date test suite even under quantization. The overall design of the image encryption system is to be explained while detail cryptanalysis is given and compared with some existing schemes.

MSC:

94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
94A60 Cryptography
37D45 Strange attractors, chaotic dynamics of systems with hyperbolic behavior
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Alioto, M.; Bernardi, S.; Fort, A.; Rocchi, S.; Vignoli, V., Analysis and design of digital PRNGS based on the discretized sawtooth map, Proc conf electron circ syst, 2, 427-430, (2003)
[2] Billings, L.; Bollt, E.M., Probability density functions of some skew tent maps, Chaos, solitons & fractals, 12, 365-376, (2001) · Zbl 0999.37026
[3] Crypto++ Library, http://www.cryptopp.com. · Zbl 1378.94025
[4] Chen, G.; Mao, Y.B.; Chui, C.K., A symmetric image encryption scheme based on 3D chaotic cat maps, Chaos, solitons & fractals, 12, 749-761, (2004) · Zbl 1049.94009
[5] Fridrich, J., Symmetric ciphers based on two-dimensional chaotic maps, Int J bifurcat chaos, 8, 6, 1259-1284, (1998) · Zbl 0935.94019
[6] Kocarev, L.; Jakimoski, G., Pseudorandom bits generated by chaotic maps, Trans circ syst I, 50, 1, 123-126, (2003) · Zbl 1368.94106
[7] Kohda, T.; Tsuneda, A., Pseudonoise sequences by chaotic nonlinear maps and their correlation properties, IEICE trans commun, E76-B, 8, 855-862, (1993)
[8] Kwok HS, Tang KSW. A chaos-based cryptographic hash function for message authentication. Int J Bifurcat Chaos, in press. · Zbl 1096.94031
[9] Li, S.; Li, Q.; Li, W.; Mou, X.; Cai, Y., Statistical properties of digital piecewise linear chaotic maps and their roles in cryptography and pseudo-random coding, IMA int conf crypt & coding, 2260, (2001), Springer-Verlag Berline, p. 205-21
[10] Li, S.; Mou, X.; Cai, Y., Pseudo-random bit generator based on couple chaotic systems and its applications in stream-cipher cryptography, Lncs, 2247, (2001), Springer-Verlag Berlin, p. 316-29 · Zbl 1011.94552
[11] Li SJ, Zheng X. Cryptanalysis of a chaotic image encryption method. In: IEEE Int Symp Circuits and Systems. USA: Scottsdale; 2002.
[12] Mao, Y.B.; Chen, G.; Lian, S.G., A novel fast image encryption scheme based on the 3D chaotic Baker map, Int J bifurcat chaos, 14, 10, 3613-3624, (2004) · Zbl 1064.94509
[13] NIST. NIST Special Publication 800-22, http://csrc.nist.gov/rng/rng2.html.
[14] Nolan, B., Data analysis: an introduction, (1994), Polity Press UK
[15] Poli, S.; Callegari, S.; Rovatti, R.; Setti, G., Post-processing of data generated by a chaotic pipelined ADC for the robust generation of perfectly random bitstreams, Proc int symp circ syst, 4, 585-588, (2004)
[16] Webster A, Tavares S. On the design of S-boxes. In: Advances in Cryptology, LNCS 218; 1985. p. 523-24.
[17] Yalcin, M.E.; Suykens, J.A.K.; Vandewalle, J., True random bit generation from a double-scroll attractor, Trans circ syst I, 57, 7, 1395-1404, (2004) · Zbl 1374.94814
[18] Zhang, H.; Wang, H., Oversampled chaotic binary sequences with good security, J circ syst comput, 11, 2, 173-185, (2002)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.