Table Substitution Box Method for Increasing Security in Interval Splitting Arithmetic Coding

2017 ◽  
Vol 13 (10) ◽  
pp. 6552-6557
Author(s):  
E.Wiselin Kiruba ◽  
Ramar K.
Keyword(s):  
Compression Ratio ◽  
Arithmetic Coding ◽  
Substitution Box ◽  
Plain Text ◽  
T Box ◽  
Novel Approach ◽  
Permutation Methods ◽  
Message Digest ◽  
Box Method ◽  
Arithmetic Coder

Amalgamation of compression and security is indispensable in the field of multimedia applications. A novel approach to enhance security with compression is discussed in this  research paper. In secure arithmetic coder (SAC), security is provided by input and output permutation methods and compression is done by interval splitting arithmetic coding. Permutation in SAC is susceptible to attacks. Encryption issues associated with SAC is dealt in this research method. The aim of this proposed method is to encrypt the data first by Table Substitution Box (T-box) and then to compress by Interval Splitting Arithmetic Coder (ISAC). This method incorporates dynamic T-box in order to provide better security. T-box is a method, constituting elements based on the random output of Pseudo Random Generator (PRNG), which gets the input from Secure Hash Algorithm-256 (SHA-256) message digest. The current scheme is created, based on the key, which is known to the encoder and decoder. Further, T-boxes are created by using the previous message digest as a key.  Existing interval splitting arithmetic coding of SAC is applied for compression of text data. Interval splitting finds a relative position to split the intervals and this in turn brings out compression. The result divulges that permutation replaced by T-box method provides enhanced security than SAC. Data is not revealed when permutation is replaced by T-box method. Security exploration reveals that the data remains secure to cipher text attacks, known plain text attacks and chosen plain text attacks. This approach results in increased security to Interval ISAC. Additionally the compression ratio  is compared by transferring the outcome of T-box  to traditional  arithmetic coding. The comparison proved that there is a minor reduction in compression ratio in ISAC than arithmetic coding. However the security provided by ISAC overcomes the issues of compression ratio in  arithmetic coding. 

scholarly journals Image Compression Based on Arithmetic Coding Algorithm

2021 ◽  
pp. 329-334
Author(s):  
Ruaa Ibrahim Yousif ◽  
Nassir Hussein Salman
Keyword(s):  
Image Quality ◽  
Image Compression ◽  
Compression Ratio ◽  
Rapid Development ◽  
Arithmetic Coding ◽  
Compact Form ◽  
Color Model ◽  
Cosine Transform ◽  
High Image Quality ◽  
The Past

The past years have seen a rapid development in the area of image compression techniques, mainly due to the need of fast and efficient techniques for storage and transmission of data among individuals. Compression is the process of representing the data in a compact form rather than in its original or incompact form. In this paper, integer implementation of Arithmetic Coding (AC) and Discreet Cosine Transform (DCT) were applied to colored images. The DCT was applied using the YCbCr color model. The transformed image was then quantized with the standard quantization tables for luminance and chrominance. The quantized coefficients were scanned by zigzag scan and the output was encoded using AC. The results showed a decent compression ratio with high image quality.

scholarly journals Comparison of Effects of Entropy Coding Schemes Cascaded with Set Partitioning in Hierarchical Trees

2018 ◽  
Vol 37 (4) ◽  
pp. 507-520
Author(s):  
Ali Iqbal ◽  
Imran Touqir ◽  
Asim Ashfaque ◽  
Natasha Khan ◽  
Fahim Ashraf
Keyword(s):  
Compression Ratio ◽  
Signal To Noise Ratio ◽  
Set Partitioning ◽  
Arithmetic Coding ◽  
Huffman Coding ◽  
Self Similarity ◽  
Elapsed Time ◽  
Coding Schemes ◽  
Hierarchical Trees ◽  
The Given

WT (Wavelet Transform) is considered as landmark for image compression because it represents a signal in terms of functions which are localized both in frequency and time domain. Wavelet sub-band coding exploits the self-similarity of pixels in images and arranges resulting coefficients in different sub-bands. A much simpler and fully embedded codec algorithm SPIHT (Set Partitioning in Hierarchical Trees) is widely used for the compression of wavelet transformed images. It encodes the transformed coefficients depending upon their significance comparative to the given threshold. Statistical analysis reveals that the output bit-stream of SPIHT comprises of long trail of zeroes that can be further compressed, therefore SPIHT is not advocated to be used as sole mean of compression. In this paper, wavelet transformed images have been initially compressed by using SPIHT technique and to attain more compression, the output bit streams of SPIHT are then fed to entropy encoders; Huffman and Arithmetic encoders, for further de-correlation. The comparison of two concatenations has been carried out by evaluating few factors like Bit Saving Capability, PSNR (Peak Signal to Noise Ratio), Compression Ratio and Elapsed Time. The experimental results of these cascading demonstrate that SPIHT combined with Arithmetic coding yields better compression ratio as compared to SPIHT cascaded with Huffman coding. Whereas, SPIHT once combined with Huffman coding is proved to be comparatively efficient.

scholarly journals Partial pose estimation of 3D rigid object system using outer box method

2020 ◽  
Vol 18 (2) ◽  
pp. 790
Author(s):  
Z. Zulkoffli ◽  
Elmi Abu Bakar
Keyword(s):  
Pose Estimation ◽  
Template Matching ◽  
Complex Shape ◽  
Shape Representation ◽  
Matching Method ◽  
Rigid Object ◽  
Novel Approach ◽  
Box Method ◽  
Model Database ◽  
Correlation Matching

<p><span>This article introduces a novel approach for identify partial pose estimation using template matching method. The algorithms performs 2D correlation matching on tested image to CAD database by using regional shape representation in order to get the similar object pose in CAD database. The descriptor named outer box method, it is useful for rescale or aligning object size in both different images of tested image and CAD database image and also provide interest point for segmentation in image registration stage. The proposed algorithm were experimentally shown to be robust to apply on scale changes, various complex shape, unstructured CAD database and mixed CAD model database. Last part, the identified pose and its retrieved pose angle was calculated and achieved high accuracyin range ±0.388˚ to ±1.471˚.</span></p>

scholarly journals Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography

2012 ◽  
pp. 111-117
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Manas Kumar Swain
Keyword(s):  
Cellular Automata ◽  
Block Cipher ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
A Cell ◽  
Updating Rule ◽  
Fundamental Objective

Cellular Automaton is an idealized parallel processing machine which is an array (1-D, 2-D) of numbers or symbols called cell values together with an updating rule. A cell value is updated based on this updating rule, which involves the cell value as well as other cell values in a particular neighborhood. A fundamental objective of cryptography is to enable two people to communicate over an insecure channel (a public channel such as internet) in such a way that any other person is unable to recover their message (called the plaintext) from what is sent in its place over the channel (the cipher text). The transformation of the plaintext into the cipher text is called encryption, or enciphering. The transformation of the cipher text into the plaintext is called decryption, or deciphering. In this paper we present a new encryption and decryption algorithm based on the linear (periodic boundary-PB) and nonlinear Cellular Automata rules. First we apply PB CA rules to plain text and key. The result of both plain text and key is XORed. Then the result of XOR operation is fed to substitution box( S-box) and again PB CA rules are applied for exchange and shift operations. At the end Complement operation is applied for encryption of plain text. The decryption process is carried out just similar to encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 numbers of rounds in order to avoid the dependency between the plain text and cipher text.

scholarly journals Combined Audio Steganography and AES Encryption to Hide the Text and Image into Audio using DCT

2019 ◽  
Vol 8 (3) ◽  
pp. 1732-1738
Keyword(s):  
Experimental Study ◽  
Wireless Channel ◽  
Secret Message ◽  
Test Cases ◽  
Encryption Scheme ◽  
Text And Image ◽  
Audio Steganography ◽  
Plain Text ◽  
Novel Approach ◽  
Prime Concern

Recently, security has become the prime concern for any organization and other civil and military applications. In this field of security, the data security during communication over an insecure wireless channel is the most important task which can be done by performing cryptography, watermarking and steganography. However, cryptography and watermarking schemes can be identified easily because of change in the data structure hence attackers can focus on that particular part to hack the secret information whereas steganography is a hiding mechanism in which secret message can be concealed into the cover and it can be retrieved at the receiver end. Several techniques have been introduced during last decade which are focused on image-image steganography and audio steganography. In the proposed work, we concentrate on audio steganography and develop a novel approach where secret message can be in the form of plain text or image, whereas cover message is in the form of audio. In order to provide additional security to this model we incorporate AES encryption scheme where secret message is encrypted and hidden in the cover audio. The proposed approach uses DCT coefficient computation and AES encryption scheme. An extensive experimental study is carried based on different test cases and evaluated against state-of-art techniques. The experimental study shows that the proposed approach achieves better performance for audio steganography.

scholarly journals Encryption and Decryption algorithm using two dimensional cellular automata rules in Cryptography

2011 ◽  
pp. 18-23
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Umesh Prasad Rout ◽  
Surendra Kumar Nanda
Keyword(s):  
Cellular Automata ◽  
Periodic Boundary ◽  
Block Cipher ◽  
Two Dimensional ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
Non Linear

In this paper we present a new encryption and decryption algorithm for block cipher based on the linear (periodic boundary-PB) and nonlinear cellular automata rules. First we apply non linear CA rules (complements) to both plain text and key. Then PB CA rule is applied to the above results separately followed by the XOR operation of above results. After that the result of XOR operation is fed to substitution box(S-box) and again PB CA rules are applied followed by SBox. The decryption process is carried out just similar to that of encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 number of rounds in order to avoid the dependency between the plain text and cipher text so that the our proposed algorithm is more secure than that of AES and DES algorithms.

scholarly journals Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Entropy ◽  
2020 ◽  
Vol 22 (1) ◽  
pp. 112 ◽  
Author(s):  
Khushbu Khalid Butt ◽  
Guohui Li ◽  
Sajid Khan ◽  
Sohaib Manzoor
Keyword(s):  
Image Encryption ◽  
Encryption Algorithm ◽  
Plain Text ◽  
Diffusion Technique ◽  
Permutation Methods ◽  
Plain Image ◽  
Block Based ◽  
Bit Planes ◽  
Differential Attacks ◽  
Image Encryption Algorithm

Bit-level and pixel-level methods are two classifications for image encryption, which describe the smallest processing elements manipulated in diffusion and permutation respectively. Most pixel-level permutation methods merely alter the positions of pixels, resulting in similar histograms for the original and permuted images. Bit-level permutation methods, however, have the ability to change the histogram of the image, but are usually not preferred due to their time-consuming nature, which is owed to bit-level computation, unlike that of other permutation techniques. In this paper, we introduce a new image encryption algorithm which uses binary bit-plane scrambling and an SPD diffusion technique for the bit-planes of a plain image, based on a card game trick. Integer values of the hexadecimal key SHA-512 are also used, along with the adaptive block-based modular addition of pixels to encrypt the images. To prove the first-rate encryption performance of our proposed algorithm, security analyses are provided in this paper. Simulations and other results confirmed the robustness of the proposed image encryption algorithm against many well-known attacks; in particular, brute-force attacks, known/chosen plain text attacks, occlusion attacks, differential attacks, and gray value difference attacks, among others.

Sign in / Sign up

Export Citation Format

Share Document