Encryption Speed Research Articles

The image encryption algorithm with plaintext-related shuffling

ABSTRACTThis paper proposed a plaintext-related image encryption system, which employed the hyper-chaotic system to generate the secret code streams used for encryption. The encryption algorithm includes two plaintext-unrelated diffusion operations and one plaintext-related shuffling. Due to the use of plaintext-related shuffling, the proposed encryption system can resist the chosen/known plaintext attacks. Simulation results show that the proposed system has many good characters, such as fast encryption speed, large key space, high key sensitivity, effectively resisting differential attack, noise-like cipher-text image, etc., and thus can be used in actual communications.

A fast encryption algorithm of color image based on four-dimensional chaotic system

As the low complexity of low-dimensional chaotic system and the slow speed of image encryption, this paper proposes a fast encryption algorithm of color image based on four-dimensional chaotic system. Firstly, we propose a new method of designing four-dimensional chaotic system based on the classical equations of three-dimensional chaotic system, to increase the complexity and key space of the encryption algorithm. Secondly, according to the nature of color images’ pixels channel, we design a new pseudo-random sequence generator and reuse the random sequence, to improve the speed of image encryption. Finally, the methods of row-major and column-major are used to diffuse the original image and the cat map with parameter is used to scramble the image pixels, respectively, to achieve the effect of encryption. The results of simulation and security analysis show that the proposed encryption algorithm is of good performance on security, robustness and high encryption speed.

Дослідження можливостей графічних процесорів при реалізації алгоритмів симетричного шифрування

The analysis of GPUs information technology has been conducted. The possibility of using them as additional computational resources to solve some problems that require significant computing resources (including cryptographic tasks) has been determined. Modern graphic processors can contain up to thousands of cores. One can achieve greater performance by paralleling. Block ciphers are an excellent target for parallelization - while encrypting large amounts of data you can encrypt one block in the flow. AES block encryption algorithm using OpenCL has been implemented. OpenCL is a completely open standard; its use is not subjected to royalties. The purpose of OpenCL is to complement OpenGL and OpenAL, which are open branch standards for three-dimensional computer graphics and sound, using GPU capabilities. OpenCL standard provides parallelism at the level of instructions and data level as well and is the development of GPGPU technology, which uses stream processors for non-graphical data. OpenCL appendix consists of a host programme and a set of nuclei (kernels). The dependence of speed encryption upon data volume has been studied

A New Quaternion-Based Encryption Method for DICOM Images.

In this paper, a new quaternion-based lossless encryption technique for digital image and communication on medicine (DICOM) images is proposed. We have scrutinized and slightly modified the concept of the DICOM network to point out the best location for the proposed encryption scheme, which significantly improves speed of DICOM images encryption in comparison with those originally embedded into DICOM advanced encryption standard and triple data encryption standard algorithms. The proposed algorithm decomposes a DICOM image into two 8-bit gray-tone images in order to perform encryption. The algorithm implements Feistel network like the scheme proposed by Sastry and Kumar. It uses special properties of quaternions to perform rotations of data sequences in 3D space for each of the cipher rounds. The images are written as Lipschitz quaternions, and modular arithmetic was implemented for operations with the quaternions. A computer-based analysis has been carried out, and the obtained results are shown at the end of this paper.

Building a post-compression region-of-interest encryption framework for existing video surveillance systems

We propose an encryption framework design and implementation which add region-of-interest encryption functionality to existing video surveillance systems with minimal integration and deployment effort. Apart from region-of-interest detection, all operations take place at bit-stream level and require no re-compression whatsoever. This allows for very fast encryption and decryption speed at negligible space overhead. Furthermore, we provide both objective and subjective security evaluations of our proposed encryption framework. Furthermore, we address design- and implementation-related challenges and practical concerns. These include modularity, parallelization and, most notably, the performance of state-of-the-art face detectors. We find that their performance, despite their frequent use in surveillance systems, is not insufficient for practical purposes, both in terms of speed and detection accuracy.

Network Coding Anti‐eavesdropping Algorithm for Ad hoc Networks

Aiming at the anti-eavesdrop security demand and potential safety hazard in Ad hoc, a secure random linear network coding algorithm was proposed. The algorithm has secure source coding and protecting the coding vectors. The information source secure coding method and optimizing the finite region is defined to guarantee that the information is properly protected. Different coding vectors protecting schemes were designed for adapting security path and without. We applied the secure random linear network coding algorithm in Ad Hoc Networks to meet the demand on anti-eavesdrop. The anti-eavesdrop algorithm based on network coding is simulated and analyzed in NS2 platform, the results shown that comparing with the encryption algorithm, the anti-eavesdrop algorithm based on network coding has better performance in end-to-end delay and encryption speed.

Sistema para codificar información implementando varias órbitas caóticas

This article proposes a symmetric encryption algorithm that takes, as input value, the original information of length L, that when encoded, generates the ciphertext of greater length LM. A chaotic discrete system (logistic map) is implemented to generate 3 different orbits: the first is used for applying a diffusion technique in order to mix the original data, the second orbit is combined with the mixed information and increases the length of L to LM, and with the third orbit, the confusion technique is implemented. The encryption algorithm was applied to encode an image which is then totally recovered by the keys used to encrypt and his respective, decrypt algorithm. The algorithm can encode any information, just dividing into 8 bits, it can cover the requirements for high level security, it uses 7 keys to encrypt and provides good encryption speed.

Video Encryption and Decryption on Quantum Computers

A method for video encryption and decryption on quantum computers is proposed based on color information transformations on each frame encoding the content of the encoding the content of the video. The proposed method provides a flexible operation to encrypt quantum video by means of the quantum measurement in order to enhance the security of the video. To validate the proposed approach, a tetris tile-matching puzzle game video is utilized in the experimental simulations. The results obtained suggest that the proposed method enhances the security and speed of quantum video encryption and decryption, both properties required for secure transmission and sharing of video content in quantum communication.

An Approach to Rijndael Algorithm

Rijndael or Advanced Encryption Standard (AES) is the most secure symmetric encryption technique and is available in many different encryption packages. The AES based on the Rijndael Algorithm is an efficient cryptographic technique that includes generation of ciphers for encryption and inverse ciphers for decryption. High security and speed of encryption and decryption is ensured by various operations. It has been standardized by the National Institute of Standards and Technology of the United States (NIST) and comprises three block ciphers, AES-128, AES-192 and AES-256 and it is adopted from Rijndael algorithm. This paper presents a encryption and decryption process of the rijindael algorithm. The paper also explains the comparative study of various rijindael algorithms with other algorithms based on the various parameters.

A Modified Chaos-Based Image Encryption Algorithm

A modified image encryption algorithm based on the Arnold-Chen chaos image encryption algorithm is presented. The original one can't resist chosen-plaintext attack and known-plaintext attack, but the modified algorithm can resist both attacks by simply increasing one key and N horizontal-shifts. The simulation experimental results and security analysis show that the new algorithm has higher security while the encryption speed is as fast as the original one. Moreover, our modified method is transplantable , it can be used to modify other schemes which are easily exposed to differential attack.

Counter Chain: A New Block Cipher Mode of Operation

In this paper, we propose a novel block cipher mode of operation, which is known as the counter chain (CC) mode. The proposed CC mode integrates the cipher block chaining (CBC) block cipher mode of operation with the counter (CTR) mode in a consistent fashion. In the CC mode, the confidentiality and authenticity of data are assured by the CBC mode, while speed is achieved through the CTR mode. The proposed mode of operation overcomes the parallelization deficiency of the CBC mode and the chaining dependency of the counter mode. Experimental results indicate that the proposed CC mode achieves the encryption speed of the CTR mode, which is exceptionally faster than the encryption speed of the CBC mode. Moreover, our proposed CC mode provides better security over the CBC mode. In summary, the proposed CC block cipher mode of operation takes the advantages of both the Counter mode and the CBC mode, while avoiding their shortcomings.

ПОБУДОВА КРИПТОСИСТЕМИ НА ОСНОВІ МНОГОКУТНИХ КОДІВ

The polygonal block nonlinear codes are defined in the article. The methods of certain polygonal codes constructing is considered and effective universal recursive method of codes of great length constructing on the basis of Steiner systems for cryptosystems with error correction is proposed. Cryptosystem with correction code based on this code is developed. The advantages of this cryptosystem are speed encryption and decryption, as well as the ability to change the code quickly without encryption and decryption tables changing.

Database Encryption Using Fuzzy Chaotic

Database encryption is a fundamental technique in the security mechanisms of database that is characterized by both the fast speed of the conventional encryption and the convenience of key distribution of public key encryption. There are two problems with traditional database encryption schemes. They show tradeoff between efficiency and security. Furthermore, these schemes can't solve the problem of storing multi-level encrypted elements into database besides having no ability for effective key management. In this paper, a new paradigm for database encryption is proposed in which database encryption can be provided as a service to applications with seamless access to encrypted database. The proposed system utilizes a chaotic encryption method based on cellular automata to realize higher complexity of crypt-analytical attacks. Cellular Automata rules are defined based on chaos mapping to generate a symmetric key. Furthermore, a fuzzy observer based scheme for synchronizing chaotic keys of encrypted signal is employed to enhance key distribution. The suggested system have some advantages such as confusion, diffusion, very large number of passwords helped in building of symmetric private key, key-dependent mapping and increasing system complexity with the impact of indefinite rules and chaos mapping. Simulation results obtained from some database demonstrate the strong performance of the proposed encryption system.

A New Image Encryption Algorithm Based on Two-dimensional Coupled Chaotic Map

In this paper, a kind of two-dimensional coupled chaotic transcendental map (TCCTM) was proposed. Firstly, by using the TCCTM chaotic sequences were generated,then the chaotic sequences were modified to generate chaotic key stream that is more suitable for image encryption. In the process of encryption， an original color image was decomposed into three images of red, green and blue components, and encrypted them in a different way respectively. The experimental results demonstrate that the extremely sensitive to the key, the encrypted image has random-like distribution behavior of grey values, the adjacent pixels have zero co-correlation properties. Furthermore, the algorithm shows the advantages of large key space and high speed of encryption.

Partial Encryption of Entropy-Coded Video Compression Using Coupled Chaotic Maps

Due to pervasive communication infrastructures, a plethora of enabling technologies is being developed over mobile and wired networks. Among these, video streaming services over IP are the most challenging in terms of quality, real-time requirements and security. In this paper, we propose a novel scheme to efficiently secure variable length coded (VLC) multimedia bit streams, such as H.264. It is based on code word error diffusion and variable size segment shuffling. The codeword diffusion and the shuffling mechanisms are based on random operations from a secure and computationally efficient chaos-based pseudo-random number generator. The proposed scheme is ubiquitous to the end users and can be deployed at any node in the network. It provides different levels of security, with encrypted data volume fluctuating between 5.5–17%. It works on the compressed bit stream without requiring any decoding. It provides excellent encryption speeds on different platforms, including mobile devices. It is 200% faster and 150% more power efficient when compared with AES software-based full encryption schemes. Regarding security, the scheme is robust to well-known attacks in the literature, such as brute force and known/chosen plain text attacks.

A fast color image encryption scheme using one-time S-Boxes based on complex chaotic system and random noise

A fast color image encryption scheme based on one-time S-Box is proposed. Three S-Boxes are generated by a complex chaotic system, whose initial values and parameter are dependent on both the random noise and the plain image. Each S-box randomly takes turns to encrypt one of the color components in each pixel adhering to the switching sequence, which is also generated by the complex chaotic system. Some measures are taken to improve the encryption and decryption speed. Simulation results demonstrate the effectiveness of the scheme, so it is suitable for color image encryption.

Image Encryption using Simplified Data Encryption Standard (S-DES)

paper a number of image encryption algorithms based on chaotic maps has been proposed. Images are routinely used in diverse areas such as medical, military, science, engineering, art, entertainment, advertising, education as well as training. The fundamental issue of protecting the confidentiality, integrity as well as the authenticity of images has become a major concern. Most of the available encryption algorithms are used for text data. However, due to large data size and real time requirement, the algorithms that are appropriate for textual data may not be suitable for multimedia data. Some cryptographic algorithms such as RSA, DES and AES are not sufficient for image encryption. We try to implement Image encryption using S-DES (Simplified Data Encryption Standard). In preceding work, most researchers used to make a image using a key and then encrypt the chaotic image using the same key, but in this paper first make a chaotic map of the image using S-DES. Then use that chaotic image as a key for encrypting the image using S-DES. Thus in this paper select the key when encrypt the image and use a chaotic image as a key not any other text. Thus the encryption speed is some faster in this implementation as compare to previous work. S-DES is the reduced algorithm of DES. DES uses a well-known block cipher; it adopts Fiestel structure to iterate. The key Quantities achieve 56 bits, using the only key in an encryption is not safe obviously. Therefore a new approach has been proposed named as S-DES, which also adopts Fiestel structure. Combining the chaotic map with S-DES system can enhance the security of system by using the characteristic of sensibility of original value and randomness in chaotic map. Thus the encryption speed is fast in this implementation as compare to previous work.

Substitution cipher based on pseudo non-determined gamma generator

Substitution ciphers replace symbols or other parts of the plaintext to ciphertext similar parts. Ciphers using cryptographic gamma have high security level, but a significant disadvantage is the high complexity of the operations and, consequently, much lower speed encryption versus ciphers based overlay gamma. This paper is dedicated to developed information ciphering method using gamma generator which considers the secret key and the open message. The obtained results allow increasing the ciphering speed compared with the block ciphers in ciphertext feedback and output feedback modes, meanwhile providing the cryptographic persistence which is comparable with the block ciphers persistence

The Design and Implementation of a Heterogeneous Multi-Core Security Chip Architecture Based on Shared Memory System

With the existence of traditional SOC chip, the encryption and decryption speed and low power cannot meet the computing needs of the modern diversity, then we present a heterogeneous multi-core system which designed based on shared memory on the Xilinx Virtex-5 platform. This paper is in-depth research about heterogeneous multi-core password architecture, static task partitioning, scheduling strategy and the communication mechanism between cores. The three cores systems are designed and builded based on shared memory to realize ZUC algorithm which generates a stream cipher on virtex-5 platform. The three microblaze cores are responsible for inter-core communication, the implementation of ZUC algorithm and articulating IC card to read keys. Through the design of three cores system, give full play to the hardware, software and computer architecture parallelism at all levels to improve the performance of the algorithm to achieve high performance green computing.

A novel approach to rights sharing-enabling digital rights management for mobile multimedia

Aiming at protecting the copyrights of audio, video and multimedia in mobile consumer electronics, a novel digital rights management (DRM) approach based on mobile Android terminal was proposed. Firstly, the solution adopted AES encryption and decryption algorithm to package multimedia contents, and meanwhile bound digital license to the hardware of the terminal device, as achieved the usage control and secure playback for mobile multimedia contents. Secondly, the license was written with Extensible Markup Language (XML), and especially a digital rights sharing between terminal devices was supported in the scheme. Thirdly, the times of reading and writing were reduced in the process of encrypting and decrypting multimedia contents by the way of introducing the appropriate size of the buffer, which effectively improved the encryption and decryption speed, and shortened the response time of the system. Finally, a prototype indicated that the solution has significant features of high security and faster cryptographic computation speed meeting the practical requirements for digital rights management and sharing by Android platforms.