scholarly journals Steganography Technique with Huffman Code

The growth of modern communication technologies imposes a particular means of security mechanisms in particular in case of data networks. In order to protect sensitive data while these are en route, applications call up different methods. Here we are trying to code the message by Huffman coding technique and applying the Steganography using differencing and substitution mechanisms with encryption to the original message which can give multi label security. Here we are trying to communicate in two phases such as (1) Encrypt the message by Huffman code and (2) applying the In Steganography. We divide the image into multiple blocks which are non-overlapped in nature and the block size is 3×3 pixel that will consider as matrix. For every value from the matrix can be represented in eight bit where two bit will use as least significant bit (LSB) substitution and quotient value differencing (QVD) is applied for other bits. We are trying to process in three levels: (i) Huffman tree through message is encrypted which is secret (ii) LSB substitution at lower bit planes and (iii) QVD at higher bit planes.

Author(s):  
Aditya Kumar Sahu ◽  
Gandharba Swain

<p>There has been a tremendous growth in Information and Communication technologies during the last decade. Internet has become the dominant media for data communication. But the secrecy of the data is to be taken care. Steganography is a technique for achieving secrecy for the data communicated in Internet. This paper presents a review of the steganography techniques based on least significant bit (LSB) substitution and pixel value differencing (PVD). The various techniques proposed in the literature are discussed and possible comparison is done along with their respective merits. The comparison parameters considered are, (i) hiding capacity, (ii) distortion measure, (iii) security, and (iv) computational complexity.</p>


Internet of Things IoT become a recent concept of communication technologies and a novel computing paradigm. The idea is to connect a variety of objects or things (e.g., RFID tags, NFC tags, sensors, etc.), which can interact and exchange data with each other anywhere and everywhere over the internet. With the evolution of IoT, the volume of data interchanged among connecting IoT devices is increasing at a remarkable scale due to the increase in number of the connected objects. Most of IoT devices are constrained devices and low resources that handling confidential and sensitive data. Therefore, using conventional cryptographic methods are unsuitable due to many issues and challenges like limited computational power, memory space, energy resources, performance cost, and security requirement. For that, lightweight cryptographic primitives (LWC) have been introduced. Many kinds of research continue moving forward to find a suitable algorithm that meets the specific demands of the IoT application. This paper provides an overview of the LWC primitives for IoT environment and presents various LWC algorithms based on their key dimension, block size, structures and number of rounds. We examine also the security viewpoint for the constrained IoT environment focusing on the relevant research challenges, difficulties and solutions. Finally, we proposed a secure scheme for improving the constrained IoT environment and conclude by discussing the open issues.


Author(s):  
Hristo Terziev

Internet of Things is a new world for connecting object space in the real world with virtual space in a computer environment. To build IoT as an effective service platform, end users need to trust the system. With the growing quantity of information and communication technologies, the need to ensure information security and improve data security is increasing. One of the potential solutions for this are steganographic methods. Steganography based on the least significant bit (LSB) is a popular and widely used method in the spatial domain.


2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.


2000 ◽  
Vol 13 (4) ◽  
pp. 415-427
Author(s):  
Lev Abolnikov ◽  
Alexander Dukhovny

A bulk M/G/1 system is considered that responds to large increases (decreases) of the queue during the service act by alternating between two service modes. The switching rule is based on two “up” and “down” thresholds for total arrivals over the service act. A necessary and sufficient condition for the ergodicity of a Markov chain embedded into the main queueing process is found. Both complex-analytic and matrix-analytic solutions are obtained for the steady-state distribution. Under the assumption of the same service time distribution in both modes, a combined complex-matrix-analytic method is introduced. The technique of “matrix unfolding” is used, which reduces the problem to a matrix iteration process with the block size much smaller than in the direct application of the matrix-analytic method.


2019 ◽  
Vol 7 (4) ◽  
pp. 254
Author(s):  
Nada E. Tawfiq

Image files can hide text without their size being affected too much. This process called steganography which allows hiding text in images without any suspicions from intruders. This paper addresses an improved LSB substitution algorithm for hiding Kurdish text information written in text file into digital image as steganography technique. The algorithm consists of two main phases, the first phase holds the encryption of the Kurdish text message and the embedded technique while the second phase hold the message extraction followed by decryption to get the original code of each character. The algorithm contains many procedures to enhance this process. Least Significant Bit method is used to hide the Kurdish text, in order to keep the features and characteristics of the original image. Applying the proposed approach shows that it seems work in a best case by hiding and retrieving text from the digital image which is used as a carrier of this text. Delphi 2010 was used to simulate both encrypt-embedded phase and extract-decrypt phase, and the results were obtained with high and security which proved the efficiency of the algorithm, where the hidden Kurdish text didn’t make any distortion or change over the cover image.


Author(s):  
Youssef Zaz ◽  
Lhoussain El Fadil ◽  
Mohamed El Kayyali

This paper demonstrates new methodology to improve security and avoid data overlapping between patients records which are defined as Electronic Patient Records (EPR), a combination of digital watermarking techniques and cryptography are used to ensure the non-separation of EPR and medical images during communications within open networks. The EPR data is encrypted, by a symmetric key algorithm based on an Elliptic Curve Cryptosystem (ECC), and inserted in liberated zone of the Least Significant Bit plan (LSB) of the medical image by compressing the original one using the Huffman coding. The proposed method improves security issues and reduces the computation cost related to data encryption and decryption.


2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Gandharba Swain

The combination of pixel value differencing (PVD) and least significant bit (LSB) substitution gives higher capacity and lesser distortion. However, there are three issues to be taken into account: (i) fall off boundary problem (FOBP), (ii) pixel difference histogram (PDH) analysis, and (iii) RS analysis. This paper proposes a steganography technique in two variants using combination of modified LSB substitution and PVD by taking care of these three issues. The first variant operates on 2 × 3 pixel blocks and the second technique operates on 3 × 3 pixel blocks. In one of the pixels of a block, embedding is performed using modified LSB substitution. Based on the new value of this pixel, difference values with other neighboring pixels are calculated. Using these differences, PVD approach is applied. The edges in multiple directions are exploited, so PDH analysis cannot detect this steganography. The LSB substitution is performed in only one pixel of the block, so RS analysis also cannot detect this steganography. To address the FOBP, suitable equations are used during embedding procedure. The experimental results such as bit rate and distortion measure are satisfactory.


Author(s):  
Meenakshi S Arya ◽  
Meenu Rani ◽  
Charndeep Singh Bedi

<p>With the intrusion of internet into the lives of every household and terabytes of data being transmitted over the internet on daily basis, the protection of content being transmitted over the internet has become an extremely serious concern. Various measures and methods are being researched and devised everyday to ensure content protection of digital media. To address this issue of content protection, this paper proposes an RGB image steganography based on sixteen-pixel differencing with n-bit Least Significant Bit (LSB) substitution. The proposed technique provides higher embedding capacity without sacrificing the imperceptibility of the host data. The image is divided into 4×4 non overlapping blocks and in each block the average difference value is calculated. Based on this value the block is classified to fall into one of four levels such as, lower, lower-middle, higher-middle and higher. If block belongs to lower level then 2-bit LSB substitution is used in it. Similarly, for lower-middle, higher-middle and higher level blocks 3, 4, and 5 bit LSB substitution is used. In our proposed method there is no need of pixel value readjustment for minimizing distortion. The experimental results show that stego-images are imperceptible and have huge hiding capacity.</p>


Sign in / Sign up

Export Citation Format

Share Document