Fast Encryption Research Articles

A Complexity-Reduced Block Encryption Algorithm Suitable for Internet of Things

The Internet of Things (IoT) poses stringent requirements on service quality and security strength. A highly reliable encryption algorithm with low complexity is required to ensure information security. Therefore, this paper proposes a complexity-reduced secure and fast encryption routine (SAFER)-Fermat block encryption method that accounts for the confusion and diffusion principles. In particular, a novel diffusion layer that exploiting the Fermat number theory transform is proposed, while the confusion layer remains unchanged as the SAFER algorithm. We also propose two data record structures to accommodate the two layers and deal with the overflow issue. The proposed scheme only considers the integer operation, the inclusion of multipliers in our study is no longer necessary, thereby resulting in low complexity and lightweight encryption method. Therefore, the proposed encryption method is advantageous for power-limited IoT devices. The simulations demonstrate that the proposed encryption method maintains the security of the SAFER++ method but requires fewer computations.

Software Implementation of Lightweight Block Cipher CHAM for Fast Encryption

Software Implementation of Lightweight Block Cipher CHAM for Fast Encryption

Implementation of Modified AES as Image Encryption Scheme

Since images have bigger size than text, a faster encryption algorithm is needed to provide higher security in digital images. The paper presents a modified AES algorithm that address the requirement in image encryption. The modified algorithm used bit permutation in replacement of MixColumns to reduce the computational requirement of the algorithm in encrypting images. Results of the study show that the modified algorithm exhibited faster encryption and decryption time in images. The modified algorithm also achieved a good result in the key sensitivity analysis, histogram analysis, information entropy, the correlation coefficient of adjacent pixels, Number of Pixel Change Rate and Unified Average Change Intensity making the modified algorithm resistant to statistical and differential attack.

Encryption and Decryption of an Image Data – a Parallel Approach

Multimedia data has been essential part of our lives, from instant messaging application to social media. Instant messaging applications like WhatsApp uses AES 256 bit key for security purpose. The security measures are taken so as to protect the data from unauthorized access and to ensure privacy. This paper mainly considers image data as source for encryption and decryption. Along with text, AES algorithm is used for image cryptography, in its suitable way. The AES algorithm is chosen because of its highly secured way of encryption and decryption. Time required for the procedure of encryption and decryption is also measured. Present use of Internet, mobile and socialmedia made images considerable value in our daily life. Securing multimedia data is becoming an important issue in communication and storage. Secured communication of digital images is needed in many areas, such as electronic commerce,medical imaging systems, mobile check deposit, online photograph album, military image communication, etc.., There is a need of developing fast encryption methodologies for such communication

Parallel Crossed Chaotic Encryption for Hyperspectral Images

Hyperspectral images (HI) collect information from across the electromagnetic spectrum, and they are an essential tool for identifying materials, recognizing processes and finding objects. However, the information on an HI could be sensitive and must to be protected. Although there are many encryption schemes for images and raw data, there are not specific schemes for HI. In this paper, we introduce the idea of crossed chaotic systems and we present an ad hoc parallel crossed chaotic encryption algorithm for HI, in which we take advantage of the multidimensionality nature of the HI. Consequently, we obtain a faster encryption algorithm and with a higher entropy result than others state of the art chaotic schemes.

Secure and Fast Encryption (SAFE) with Classical Random Number Generators

Pseudo-random number generators (PRNGs) play an important role in both areas of computer simulation and computer security. Currently, there appears to be a huge divide between the types of PRNGs used in these two areas. For PRNGs in computer security applications, the security concern is extremely important. For PRNGs in computer simulation applications, the properties of high-dimensional equi-distribution, efficiency, long period-length, and portability are important. In recent years, there have been many PRNGs proposed in the area of computer simulation satisfying these nice properties. However, most of them are linear generators, thus sharing the same weakness in predictability. The major aim of this article is to propose a general class of secure generators, called SAFE (secure and fast encryption) generators, by properly “mixing” two baseline generators with the aforementioned properties to obtain a secure generator that would inherit these nice properties. Specifically, we propose applying a general mutual-shuffling method to certain linear generators, such as the currently most popular MT19937 generator and large-order multiple recursive generators, as well as outputting certain nonlinear transformations of the generated variates to construct secure PRNGS.

A Novel Fast and Secure Approach for Voice Encryption Based on DNA Computing

Today, in the world of information communication, voice information has a particular importance. One way to preserve voice data from attacks is voice encryption. The encryption algorithms use various techniques such as hashing, chaotic, mixing, and many others. In this paper, an algorithm is proposed for voice encryption based on three different schemes to increase flexibility and strength of the algorithm. The proposed algorithm uses an innovative encoding scheme, the DNA encryption technique and a permutation function to provide a secure and fast solution for voice encryption. The algorithm is evaluated based on various measures including signal to noise ratio, peak signal to noise ratio, correlation coefficient, signal similarity and signal frequency content. The results demonstrate applicability of the proposed method in secure and fast encryption of voice files.

Comparative Randomness Analysis of DES Variants

Background: Over the past few years, researchers have devoted efforts to enhance the robustness and randomness of the original DES cipher. These enhancements focused on improving multiple perspectives of the algorithm to deliver robust DES variants against typical attacks. Method: Recent publications and patent databases have been reviewed to investigate the potential enhancements in DES cipher algorithm. The enhancements have targeted the main components of DES including the F-function, S-boxes arrangements, and the key length. Result: This paper introduces a DES variant named Hashed Data Encryption Standard (HDES). The main idea behind HDES cryptographic algorithm is to provide a trade-off between fast encryption while ensuring a degree of randomness in the encrypted data. HDES employs several techniques including the use of a hash function and secure arrangements of S-boxes. The idea of using the hash is to create a fingerprint of the plaintext. This fingerprint is used to generate a seed and the subsequent round seeds. Conclusion: The randomness analysis of HDES and its counterparts DES and DESX have shown performance merits of HDES in terms of entropy difference, cipher data randomness, symmetric distance and encryption time. Keywords: Encryption algorithm, randomness test, symmetric distance, data cipher difference, encryption time, DES, HDES, DESX.

Image block encryption algorithm based on chaotic maps

Advanced in unpredictability, ergodicity and sensitivity to initial conditions and parameters, chaotic maps are widely used in modern image encryption algorithms. In this study, the authors propose a novel image block encryption algorithm based on several widely used chaotic maps. In their algorithm, the image blocking method is variable, and both shuffling and substitution algorithms are adopted based on different chaotic maps. Several simulations are provided to evaluate the performances of this encryption scheme. The results demonstrate that the proposed algorithm is with high security level and fast encryption speed, which can be competitive with some other recently proposed image encryption algorithms.

A Fast Image Encryption Algorithm Based on Convolution Operation

ABSTRACT A new image encryption algorithm based on convolution operation is presented in this paper. By using an external key of length 300 bits, several pseudo-random sequences are generated by Chen's chaotic system and general convolution operation, and then their statistical properties are verified. The proposed image encryption scheme includes one module of covering operation, two modules of diffusion operations, and one module of confusion operation. The covering module employs the pseudo-random sequence to cover the original plain image with binary XOR operation. The diffusion modules are based on the multiplication of finite field GF(28) and windowed convolution with summation of modulus 256, and dissemination of the information of any pixel in the original image to all the pixels in the diffused image. The confusion module uses each value of pseudo-random sequence as the offset address of pixel replacement to permute the diffused image. The simulation experiment and comparative analysis show that the proposed image cryptosystem has the advantages of fast processing speed, strong sensitivity, and high encryption intensity, and can be used as a candidate for practical image cryptosystem.

A semi-blind HVS based image watermarking scheme using elliptic curve cryptography

In the present paper, an advanced encryption technique commonly known as Elliptic Curve Cryptography (ECC) is used to embed a binary image as a watermark in five grayscale host images in a semi-blind manner. The ECC algorithm is a fast encryption technique which successfully encrypts the subject with significantly less number of bits as compared to other popular encryption algorithms such as Rivest-Shamir-Adleman (RSA) and Direct Selling Association (DSA). In the proposed watermarking scheme, embedding in the grayscale host images is carried out in DWT-SVD domain. First, entropy based Human Visual System (HVS) parameters are computed block wise to identify the most appropriate blocks in spatial domain. First level DWT is computed for these selected blocks and watermark embedding is carried out by using the calculated Singular Value Decomposition (SVD) parameters. Preliminary results of this work show that proposed scheme outperforms the other similar schemes carried out in DCT-SVD domain without using any encryption method. It is concluded that the use of DWT-SVD hybrid architecture along with the fast encryption technique ECC is responsible for better performance in present case. In the second part of this simulation, an established HVS model working in DCT domain is implemented and compared with the entropy based HVS model implemented in transform domain to embed the ECC encrypted binary watermark in images. In this case also, proposed scheme performs better both in terms of visual imperceptibility and robustness as compared to other scheme. It is concluded that HVS parameters – Luminance, Contrast and Edge Sensitivity are better placed in comparison to entropy parameters to examine image features and characteristics for watermarking purpose.

Comparing the speed of the selected hash and encryption algorithms

The data is often the most valuable thing that we collect on our computers. Without proper data security with encryption our valuable information may be illegally used by an unauthorised person. The article presents selected encryption methods and hash functions available in Boucy Castle library for Java programming language. The presented analysis applies to measurement of the speed of signature generation and verification. The signatures are for 240 bit encryption algorithms. In case of a hash function, the analysis refers to the speed of such functions. The fastest encryption algorithm and hash function from the research group were AES and SHA1.

LIGHTWEIGHT ENCRYPTION FOR HIGH EFFICIENCY VIDEO CODING (HEVC)

Video data are being compressed and distributed using one of several coding standards, among which the most recent and popular is the High Efficiency Video Coding (HEVC) standard. The threatening growth of security attacks, on the other hand, has brought security and privacy concerns to the attention of governments and people as well. In the absence of a reliable security system, shared multimedia data used on the public networks such as the internet will continue to be exposed to different types of attacks, making end-to-end encryption for video data a necessity to protect their sensitive information. Therefore, providing a reliable video security technique that complies to and fulfills the requirements of HEVC is pertinent. In this paper, a fast selective encryption approach is developed to provide protection for video bitstreams of HEVC, which can be used in real-time video applications, with low computational overhead and maintaining the standard’s video bit rate. This approach employs the popular Advance Encryption Standard (AES) algorithm to encrypt selected elements in the horizontal intra prediction modes. Experimental evaluations confirm the provision of adequate security level of video information, with no bitrate increase, no increase in computational delay and no additional impact on the compression performance when compared to non-secure techniques, while also achieving a satisfactory trade-off between the encryption reliability, flexibility, and computational complexity. The security level of this method was found to be strongly secure against plaintext and brute force attacks.

A new code-based encryption scheme and its applications

More and more data has to be dealt with in the current network computing. An extremely efficient encryption algorithm can greatly improve the efficiency and security of the process in large data environment. As a significant candidate of post-quantum cryptosystem, McEliece public-key cryptosystem (PKC) has one remarkable advantage that it has a very fast and efficient encryption process. In this paper, we put forward a new efficient CPA-secure variant of the McEliece cryptosystem whose advantage is that we can enlarge the plain-text space while the cipher-text space unchanged. We formally prove the security of the scheme. Our proof is based on the learning parity with noise (LPN) problem. We also extend our scheme to a CCA-secure cryptosystem and a signcryption.

Velocity-Aware Parallel Encryption Algorithm with Low Energy Consumption for Streams

In the environment of cloud computing, the data produced by massive users form a data stream and need to be protected by encryption for maintaining confidentiality. Traditional serial encryption algorithms are poor in performance and consume more energy without considering the property of streams. Therefore, we propose a velocity-aware parallel encryption algorithm with low energy consumption (LECPAES) for streams in cloud computing. The algorithm parallelizes Advanced Encryption Standard (AES) based on heterogeneous many-core architecture, adopts a sliding window to stabilize burst flows, senses the velocity of streams using the thresholds of the window computed by frequency ratios, and dynamically scales the frequency of Graphics Processing Units (GPUs) to lower down energy consumption. The experiments for streams at different velocities and the comparisons with other related algorithms show that the algorithm can reduce energy consumption, but only slightly increases retransmission rate and slightly decreases throughput. Therefore, LECPAES is an excellent algorithm for fast and energy-saving stream encryption.

A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform

An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT-Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images. The pseudorandom generator has been used along with Lanczos algorithm to generate root characteristics and eigenvectors. Using hybrid CMT image, pixels are shuffled to accomplish excellent randomness. Compared with existing methods, the proposed method had more robustness to various attacks: brute-force attack, known cipher plaintext, chosen-plaintext, security key space, key sensitivity, correlation analysis and information entropy, and differential attacks. Simulation results show that the proposed methods give better result in protecting images with low-time complexity.

Optical implementation of cipher block chaining mode algorithm using phase-shifting digital holography

We propose an optical design of cipher block chaining (CBC) encryption mode using digital holography, which is implemented by the two-step quadrature phase-shifting digital holographic encryption technique using orthogonal polarization. A block of plain text is encrypted with the encryption key by applying the two-step phase-shifting digital holographic method; then, it is changed into cipher text blocks which are digital holograms. Optically, these digital holograms with the encrypted information are Fourier transform holograms and are recorded onto charge-coupled devices with 256 quantization gray levels. This means that the proposed optical CBC encryption is a scheme that has an analog-type of pseudorandom pattern information in the cipher text, while the conventional electronic CBC encryption is a kind of bitwise block message encryption processed by digital bits. Also, the proposed method enables the cryptosystem to have higher security strength and faster processing than the conventional electronic method because of the large two-dimensional (2-D) array key space and parallel processing. The results of computer simulations verify that the proposed optical CBC encryption design is very effective in CBC mode due to fast and secure optical encryption of 2-D data and shows the feasibility for the CBC encryption mode.

An efficient image encryption algorithm based on a novel chaotic map

In this paper, we propose a novel low dimensional chaotic map, namely, compounded piecewise linear map (CPLM) in order to balance between security and computational complexity. Then we prove the chaotic properties of CPLM theoretically and numerically. Based on the CPLM, an efficient chaotic image encryption algorithm is presented, in which the self-adaptive model and feedback mechanism are initially mingled to enhance the security. Besides, initial values of iteration are generated in a new way to ensure the sensitivity for the changes of plain-image. Simulation results show that our scheme possesses the high key sensitivity, large key space, fast encryption speed and resists the common attacks, especially differential attack. In addition, our algorithm satisfies the applicabilities of all-zero image and binary image which are seldom considered in the existing algorithms. The proposed algorithm justifies the superior security and good efficiency, which can be regarded as an excellent candidate for practical applications of image encryption.

A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure.

Algorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structure and multiple chaotic maps is proposed to improve the efficiency of this type of algorithm. Two methods are used. First, a simple round function based on a piecewise linear function and tent map are used to reduce computational cost during each iteration. Second, the 4-pixel Feistel structure reduces round number by changing twist direction securely to help the algorithm proceed efficiently. While a large number of simulation experiments prove its security performance, additional special analysis and a corresponding speed simulation show that these two methods increase the speed of the proposed algorithm (0.15s for a 256*256 color image) to twice that of an algorithm with a similar structure (0.37s for the same size image). Additionally, the method is also faster than other recently proposed algorithms.

Cryptanalyzing a chaotic encryption algorithm for highly autocorrelated data

Recently, a chaotic encryption algorithm for highly autocorrelated data was proposed. By adding chaotic diffusion to the former work, the information leakage of the encryption results especially for the images with lower gray scales was eliminated, and both higher-level security and fast encryption time were achieved. In this study, we analyze the security weakness of this scheme. By applying the ciphertext-only attack, the encrypted image can be restored into the substituted image except for the first block; and then, by using the chosen-plaintext attack, the S-boxes, the distribution map, and the block of chaotic map values, can all be revealed, and the encrypted image can be completely cracked. The improvement is also proposed. Experimental results verify our assertion.