Cipher Block Chaining Research Articles

Chaos based video encryption using maps and Ikeda time delay system

Chaos based cryptosystems are an efficient method to deal with improved speed and highly secured multimedia encryption because of its elegant features, such as randomness, mixing, ergodicity, sensitivity to initial conditions and control parameters. In this paper, two chaos based cryptosystems are proposed: one is the higher-dimensional 12D chaotic map and the other is based on the Ikeda delay differential equation (DDE) suitable for designing a real-time secure symmetric video encryption scheme. These encryption schemes employ a substitution box (S-box) to diffuse the relationship between pixels of plain video and cipher video along with the diffusion of current input pixel with the previous cipher pixel, called cipher block chaining (CBC). The proposed method enhances the robustness against statistical, differential and chosen/known plain text attacks. Detailed analysis is carried out in this paper to demonstrate the security and uniqueness of the proposed scheme.

Bitstream-Oriented Protection for the H.264/Scalable Video Coding (SVC)

The newly standardized H.264/SVC enable multimedia suppliers to provide video bitstream with temporal, spatial and quality scalabilities to meet various needs of end users. Its bitstream scalability characteristic is also especially suitable for multimedia applications under merged heterogeneous networks with different network protocols, capacities and throughputs. Although the network environment, to some extent, provides security protection against the illegal users, it is not enough to protect against the authorized users from digesting contents beyond its authorization. Hence the issue of content protection for the H.264/SVC has aroused researchers’ interests in recent years. In this paper, we present an efficient bitstream-oriented protection scheme for the H.264/SVC in a compression friendly and format compliant manner. The encryption is implemented on the Network Abstraction Layer (NAL) unit level. To improve the computational efficiency as well as to provide sufficient security, selective cryptographic algorithms with different computation cost are employed for different content level of SVC according to its significance. The I slice NAL units from the base layer of SVC bitstream are encrypted with the symmetric AES algorithm in Cipher Block Chaining mode. And the other NAL units are protected by simplified XOR cipher. Furthermore, a robust key management (key generation and distribution) mechanism is also discussed in this paper. The security analysis and simulation results further verify that the proposed methods can effectively protect the H.264/SVC bitstream at low computational cost.

SPCBC: A Secure Parallel Cipher Block Chaining Mode of Operation based on logistic Chaotic Map

SPCBC: A Secure Parallel Cipher Block Chaining Mode of Operation based on logistic Chaotic Map

On The Exact Security of Message Authentication Using Pseudorandom Functions

Traditionally, modes of Message Authentication Codes(MAC) such as Cipher Block Chaining (CBC) are instantiated using block ciphers or keyed Pseudo Random Permutations(PRP). However, one can also use domain preserving keyed Pseudo Random Functions(PRF) to instantiate MAC modes. The very first security proof of CBC-MAC [BKR00], essentially modeled the PRP as a PRF. Until now very little work has been done to investigate the difference between PRP vs PRF instantiations. Only known result is the rather loose folklore PRP-PRF transition of any PRP based security proof, which looses a factor of Ο( σ2/2n ) (domain of PRF/PRP is {0, 1}n and adversary makes σ many PRP/PRF calls in total). This loss is significant, considering the fact tight Θ( q2/2n ) security bounds have been known for PRP based EMAC and ECBC constructions (where q is the total number of adversary queries). In this work, we show for many variations of encrypted CBC MACs (i.e. EMAC, ECBC, FCBC, XCBC and TCBC), random function based instantiation has a security bound Ο( qσ/2n ). This is a significant improvement over the folklore PRP/PRF transition. We also show this bound is optimal by providing an attack against the underlying PRF based CBC construction. This shows for EMAC, ECBC and FCBC, PRP instantiations are substantially more secure than PRF instantiations. Where as, for XCBC and TMAC, PRP instantiations are at least as secure as PRF instantiations.

On The Exact Security of Message Authentication Using Pseudorandom Functions

Traditionally, modes of Message Authentication Codes(MAC) such as Cipher Block Chaining (CBC) are instantiated using block ciphers or keyed Pseudo Random Permutations(PRP). However, one can also use domain preserving keyed Pseudo Random Functions(PRF) to instantiate MAC modes. The very first security proof of CBC-MAC [BKR00], essentially modeled the PRP as a PRF. Until now very little work has been done to investigate the difference between PRP vs PRF instantiations. Only known result is the rather loose folklore PRP-PRF transition of any PRP based security proof, which looses a factor of Ο ( σ 2 / 2 n ) (domain of PRF/PRP is {0, 1} n and adversary makes σ many PRP/PRF calls in total). This loss is significant, considering the fact tight Θ ( q 2 / 2 n ) security bounds have been known for PRP based EMAC and ECBC constructions (where q is the total number of adversary queries). In this work, we show for many variations of encrypted CBC MACs (i.e. EMAC, ECBC, FCBC, XCBC and TCBC), random function based instantiation has a security bound Ο ( q σ / 2 n ). This is a significant improvement over the folklore PRP/PRF transition. We also show this bound is optimal by providing an attack against the underlying PRF based CBC construction. This shows for EMAC, ECBC and FCBC, PRP instantiations are substantially more secure than PRF instantiations. Where as, for XCBC and TMAC, PRP instantiations are at least as secure as PRF instantiations.

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.

FPGA Implementation and Analysis of the Block Cipher Mode Architectures for the PRESENT Light Weight Encryption Algorithm

Objective: This paper presents the Field Programmable Gate Array (FPGA) implementations of the different block cipher mode architectures of the ISO standardized light weight block cipher PRESENT, designed for resource constrained devices. Methods/ Statistical Analysis: The performance evaluations compare the implementations of the different block cipher modes, namely Electronic Code Book (ECB) mode, Cipher Block Chaining (CBC) mode, Cipher Feedback Mode (CFB), Output Feed Back Mode (OFB) and CounTeR (CTR) mode for the PRESENT cipher. The throughput of encryption of three successive 64 bit blocks of data ranges from 565.312Mbps to 574.784Mbps for the modes other than the cipher feedback mode in the Spartan-3 FPGA. The throughput for providing confidentiality through encryption in the cipher feedback mode arrives as 68.912 Mbps, 155.392Mbps and 300.8 Mbps for a 64 bit block of data for the input streams of size 8 bits, 16 bits and 32 bits respectively. Findings: The throughput of the block cipher mode hardware architectures of the light weight cipher PRESENT demonstrates the high speed performance of the cipher in encryption/decryption of data as blocks and streams. Application/ Improvement: The significance of the proposed work is to know the hardware performance of the different modes of operation for the light weight block cipher PRESENT. The performance estimation of the block cipher modes operations of the PRESENT cipher definition in hardware have been carried out for the first time.

Research and Development of Encryption Algorithm on Specific Image Area

This article discusses symmetric encryption algorithms and how to protect digital images using four encryption modes (electronic code book, cipher block chaining, cipher feed-back, output-feedback). Statistical results of encrypted images, as well as the effect of noise in encrypted image are analyzed.

A Secure Algorithm for Region of Interest (ROI) Encryption for RGB Color Images

An algorithm optimized towards encrypting a specific region in an image is proposed. The encryption of specific region(s) in an image is often of more practical relevance than encrypting the entire image, thus avoiding wastage of time and processing power. The algorithm proposed is ideal for encrypting images with relatively small Region of Interest (ROI). It makes novel use of the XOR operation and the relative visual redundancy of the blue-plane components in a RGB color image. A pseudorandom number generator is used as a basic security feature. Furthermore, Cipher Block Chaining (CBC) is also suggested as an improvement to further enhance the security of the algorithm. The algorithm may be classified as lossy since some visual data is sacrificed in the decrypting process. However, in case of encryption algorithms, the high security of the encrypted image is often given priority over faithful reproduction of images.

Proving Chaotic Behavior of CBC Mode of Operation

The cipher block chaining (CBC) mode of operation was invented by IBM (International Business Machine) in 1976. It presents a very popular way of encrypting that is used in various applications. In this paper, we have mathematically proven that, under some conditions, the CBC mode of operation can admit a chaotic behavior according to Devaney. Some cases will be properly studied in order to provide evidence for this idea.

Magnified Cipher Block Chaining Mode using DES to Ensure Data Security in Cloud Computing

Background/Objectives: The main objective is to provide security using Magnified Cipher Block Chaining mode-DES to ensure secure data on cloud. Methods: In this work we have to find how the data is converted into binary and splits into blocks of particular size. By using Magnified Cipher block chaining mode-DES we encrypt data and store into cloud. We send the key to the receiver then he/she access the data from the cloud and decrypt the data. By this methodology we can ensure high security because even cloud server cannot access data. Findings: In this research, many encryption and decryption algorithms like AES, DES, RSA, Cipher Block Chaining modes have been taken into account. By using the DES operation we proposed a magnified Cipher Block Chaining mode –DES to find out how the data is divided into blocks and how the DES operation will perform. In this work we also find out the several algorithms like AES, DES etc. DES algorithm has been designed to provide more secure because the data is to be perform 16 rounds for encryption and decryption. In our work we divide the data into blocks and encrypt the data using DES algorithm and sent to the next block depending on the midvalue+position. Like this all the blocks of the data are encrypted and decrypted. By this methodology we can provide more secure because we are storing the encrypted data in the cloud so that even cloud server cannot access. Improvement: In order to provide security we propose a Magnified Cipher Block Chaining mode using DES. On the basis of mid value + positions the data is encrypted and decrypted.

File Encryption System Based on Symmetric Key Cryptography

In Today’s scenario, files are not secure. They are fetch by any means of attack by eavesdropper like cracking the pins, crashing the OS by viruses, malwares, and plenty of ways. We today can’t sure that files protection wizards are secure and data can’t be reached to the attacker. But if files are encrypted then even files are accessed original data remains confidential. Therefore, this paper represents the File Encryption System based on Symmetric Key Cryptography. I proposed the strategy to encrypt the files/even multiple files can be encrypted by compressing the files into one ‘rar’ file and it uses Blowfish as encryption/decryption standard and Cipher Block Chain Mode to perform the operations. I implemented compression function for 64-bit Initialization Vector(IV), use CBC mode with Blowfish and RC4 for 256-bit keystream. It is more efficient and secure then other general encryption process

Denoising and error correction in noisy AES-encrypted images using statistical measures

Cryptography based techniques are used to secure confidential data from unauthorized access. These techniques are very good for the security and protection of the data but are very sensitive to noise. A single bit change in encrypted data can have a catastrophic impact on the decrypted data. This paper addresses the problem of removing bit errors in visual data which are encrypted using the AES algorithm in CBC mode (Cipher Block Chaining). We propose a noise removal approach based on the statistical analysis of each block during the decryption process. Three statistical measures are proposed, i.e. the global variance method (GVM), the mean local variance method (MLVM) and the sum of the squared derivative method (SSDM) for error correction. The proposed approach uses local statistics of the visual data and confusion/diffusion properties of the encryption algorithm to remove errors. Experimental results show that the proposed approach gives better results in removing noise and can be used for noise removal in visual data in the encrypted domain.

Statistical Characterization of Decryption Errors in Block-Ciphered Systems

It is well known that avalanche effect errors in received noisy ciphertexts will cause severe error propagation in block-ciphered encryption systems, thus resulting in a large reduction in the achievable throughput. However, little is known about the statistical properties of the underlying error sequences in decrypted plaintexts in block-ciphered systems when channel errors are present. A rigorous study of the statistical properties of the errors in block-ciphered crypto-systems operating in cipher block chaining (CBC) mode is provided. The equivalent channel transition probability is obtained and then used to derive error statistics including both error weight probabilities and gap distributions. The validity of the theoretical analyses is confirmed by the excellent match with results obtained by simulated data encryption standard (DES)-based and advanced encryption standard (AES)-based crypto-systems operating in CBC mode. The error statistics will be valuable in the design and performance evaluation of communication protocols, as well as in error-control schemes for block-ciphered crypto-systems in the presence of erroneous ciphertexts, where errors are intentionally left to enhance security against passive eavesdroppers.

Automated Proofs of Block Cipher Modes of Operation

We present a Hoare logic for proving semantic security and determining exact security bounds of a block cipher mode of operation. We propose a simple yet expressive programming language to specify encryption modes, semantic functions for each command (statement) in the language, an assertion language that allows to state predicates and axioms, and rules to propagate the predicates through the commands of a program. We also provide heuristics for finding loop invariants that are necessary for the application of our rule on for-loops. This enables us to prove the security of protocols that take arbitrary length messages as input. We implemented a prototype that uses this logic to automatically prove the security of block cipher modes of operation. This prototype can prove the security of many standard modes of operation, such as Cipher Block Chaining (CBC), Cipher FeedBack mode (CFB), Output FeedBack (OFB), and CounTeR mode (CTR).

An Enhanced WLAN Security System With FPGA Implementation for Multimedia Applications

Maintaining a high level of data security with a low impact on system performance is more challenging in wireless multimedia applications. Protocols that are used for wireless local area network (WLAN) security are known to significantly degrade performance. In this paper, we propose an enhanced security system for a WLAN. Our new design aims to decrease the processing delay and increase both the speed and throughput of the system, thereby making it more efficient for multimedia applications. Our design is based on the idea of offloading computationally intensive encryption and authentication services to the end systems' CPUs. The security operations are performed by the hosts' central processor (which is usually a powerful processor) before delivering the data to a wireless card (which usually has a low-performance processor). By adopting this design, we show that both the delay and the jitter are significantly reduced. At the access point, we improve the performance of network processing hardware for real-time cryptographic processing by using a specialized processor implemented with field-programmable gate array technology. Furthermore, we use enhanced techniques to implement the Counter (CTR) Mode with Cipher Block Chaining Message Authentication Code Protocol (CCMP) and the CTR protocol. Our experiments show that it requires timing in the range of 20–40 $\mu\mbox{s}$ to perform data encryption and authentication on different end-host CPUs (e.g., Intel Core i5, i7, and AMD 6-Core) as compared with 10–50 ms when performed using the wireless card. Furthermore, when compared with the standard WiFi protected access II (WPA2), results show that our proposed security system improved the speed to up to 3.7 times.

A SURVEY ON THEFT PREVENTION DURING ATM TRANSACTION WITHOUT ATM CARDS

Authentication is a critical part of any trustworthy computing system which ensures that, only individuals can to log on to the system. Here ATM Security has always been one of the most prominent issues. ATM machines generally authenticates by using ATM card and PIN number to perform transactions. This papers discusses design of ATM system that will improve the authentication of customer while using ATM. Here is possible scenario that an individual’s ATM [1] card falling into wrong hands by knowing PIN number and forget ATM card is difficult to perform ATM transaction. So to clear all these problems we are implementing this system using “One Time Password (OTP)” and “Personal Identification Number (PIN)” combination in order to improve authentication of customer using ATM machine to perform transaction without having any ATM cards. Keywords— Automated Teller Machine (ATM), One Time Password (OTP), Personal Identification Number (PIN), Card Verification Value (CVV), Cipher Block Chaining (CBC). ---------------------------------------------------------------------***-----------------------------------------------------------------

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.

Performance Analysis of Image EncryptionUsing Block Based Technique

In digital communication and multimedia application, security is must for communication and storage of images. Image Encryption is one of the best methods to ensure high security images which are generally used in medical science, military applications. In this paper, an efficient technique is proposed with the help of cipher block chaining (CBC) operation, which is used for image encryption. We test our proposed technique using MATLAB R2013a, it can achieve various image quality parameters such as the mean square error(MSE), peak signal to noise ratio (PSNR) and the overall time taken by the algorithm to perform the process is also computed.

Digital Fingerprinting Based on Quaternion Encryption Scheme for Gray-Tone Images

In this paper a new idea of digital images fingerprinting is proposed. The method is based on quaternion encryption in the Cipher Block Chaining (CBC) mode. Quaternions are hyper-complex numbers of rank 4 and thus often applied to mechanics in three-dimensional space. The encryption algorithm described in the paper is designed for graytone images but can easily be adopted for color ones. For the encryption purpose, the algorithm uses the rotation of data vectors presented as quaternions in a three-dimensional space around another quaternion (key). On the receiver’s side, a small amount of unnoticeable by human eye errors occurs in the decrypted images. These errors are used as a user’s digital fingerprint for the purpose of traitor tracing in case of copyright violation. A computer-based simulation was performed to scrutinize the potential presented quaternion encryption scheme for the implementation of digital fingerprinting. The obtained results are shown at the end of this paper.