Conference Paper

# An Improved Image Encryption Scheme Based on Line Maps.

Dept. of Electr. Eng., Harbin Inst. of Technol., Harbin, China

DOI: 10.1109/IAS.2009.67 Conference: Proceedings of the Fifth International Conference on Information Assurance and Security, IAS 2009, Xi'An, China, 18-20 August 2009 Source: DBLP

- Citations (8)
- Cited In (0)

- [Show abstract] [Hide abstract]

**ABSTRACT:**Symmetric block encryption schemes, designed on invertible two-dimensional chaotic maps on a torus or a square, prove feasible and secure for real-time image encryption according to the commonly used criteria given in the literature. In this paper, a typical map of this kind, namely, the baker map, is further extended to be three-dimensional and then used to speed up image encryption while retaining its high degree of security. The proposed algorithm is described in detail, along with its security analysis and implementation. Experimental results show that this three-dimensional baker map is 2–3 times faster than the two-dimensional one, showing its great potential in real-time image encryption applications.International Journal of Bifurcation and Chaos 11/2011; 14(10). · 1.02 Impact Factor - [Show abstract] [Hide abstract]

**ABSTRACT:**Encryption of images is different from that of texts due to some intrinsic features of images such as bulk data capacity and high redundancy, which are generally difficult to handle by traditional methods. Due to the exceptionally desirable properties of mixing and sensitivity to initial conditions and parameters of chaotic maps, chaos-based encryption has suggested a new and efficient way to deal with the intractable problem of fast and highly secure image encryption. In this paper, the two-dimensional chaotic cat map is generalized to 3D for designing a real-time secure symmetric encryption scheme. This new scheme employs the 3D cat map to shuffle the positions (and, if desired, grey values as well) of image pixels and uses another chaotic map to confuse the relationship between the cipher-image and the plain-image, thereby significantly increasing the resistance to statistical and differential attacks. Thorough experimental tests are carried out with detailed analysis, demonstrating the high security and fast encryption speed of the new scheme.Chaos Solitons & Fractals 01/2004; · 1.50 Impact Factor - [Show abstract] [Hide abstract]

**ABSTRACT:**Connectionless routed networks, built atop high-speed communication medium, require cryptographic algorithms capable of out-of-order keystream generation and high throughput. Binary tree based stream ciphers, of which Leviathan is an example, are capable of meeting both of these requirements. We investigate high-speed architectures for the binary tree traversal and show that the traversal approaches discussed can be extended to m-ary tree of height h. Of the two architectures presented, the pipeline architecture computes keystream at uniform rate and the parallel architecture bounds the worst-case variance in the time period between computations of consecutive output key words, which form the keystream. The design and implementation of Leviathan keystream generator based on the pipeline architecture for binary tree traversal are presented. We show that it is possible to achieve keystream generation rates approaching 1Gbps with the pipeline architecture. The design was implemented in two parts, the keysetup and the keystream pipeline, targeting commercially available Xilinx XC2V4000 and XC2V3000 FPGAs. The keystream pipeline implementation operated at frequency of 50MHz and occupied 6864 slices. The results were verified performing the timing simulation.Microprocessors and Microsystems. 01/2004; 28:573-584.

Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.