Most Significant Bit

Steganography is an art that involves communication of secret data in an appropriate carrier, e.g., image, audio, video or TCP/IP header file. Steganography's goal is to hide the very existence of embedded data so as not to arouse an eavesdropper's suspicion. For hiding secret data in digital images, large varieties of steganographic techniques are available, some are more complex than others, and all of them have their respective pros and cons. Steganography has various useful applications and the technique employed depends on the requirements of the application to be designed for. For instance. applications may require absolute invisibility of the secret data, larger secret data to be hidden or high degree of robustness of the carrier. This paper intends to give thorough understanding and evolution of different existing digital image steganography techniques of data hiding in spatial, transform and compression domains. It covers and integrates recent research work without going in to much detail of steganalysis, which is the art and science of defeating steganography.

Steganography is a science of hiding secret information in a carrier. The carrier may be a text file, digital image, audio file or video file. Steganography is used as better alternative for file security than cryptography which only scrambles the content of message. Digital image steganography is widely used than other forms of steganography because of ease of implementation. In most cases, change occurs in the appearance of the career image because anytime a message is hidden in a cover file, random noises are also added in that file due to bit tempering in the replacement process. The secret message bits drastically modify the original bits of the career and hence, make changes to its statistical properties. These change causes distortion to the message containing career and this draws attention of unauthorized person to notice that confidential message was hidden there. This research assessed five (5) methods proposed to address this problem. Three metrics-the image quality, message capacity and achieved Peak Signal to Noise Ratio (PSNR) were employed to evaluate each method. Finally, the results are presented and summarized and the research gap in each method is also identified that serves as basis for future research.

Both image steganography and image encryption have advantages and disadvantages. Steganograhy allows us to hide a desired image containing confidential information in a covered or host image while image encryption is decomposing the desired image to a non-readable, non-comprehended manner. The encryption methods are usually much more robust than the steganographic ones. However, they have a high visibility and would provoke the attackers easily since it usually is obvious from an encrypted image that something is hidden! The combination of steganography and encryption will cover both of their weaknesses and therefore, it increases the security. In this paper an image encryption method based on sinc-convolution along with using an encryption key of 128 bit length is introduced. Then, the encrypted image is covered by a host image using a modified version of JSteg steganography algorithm. This method could be applied to almost all image formats including TIF, BMP, GIF and JPEG. The experiment results show that our method is able to hide a desired image with high security and low visibility.

The paper discusses and analyze about a m ethod which provides a secure mechanism for the transfer of messages by the process of Steganograph y. The solution uses password protection to prevent unauthorized access of the files. The tool makes us e of any file type which acts as a cover to the mes sage/file. The message/file is hidden behind the cover using L SB flipping algorithm. The tool can accept all type s of media files (including JPEG images). After the steg anography is performed the user can also compare th original image with the image in which the data is hidden using the compare operation of the tool. The compare tool compares the two images using PSNR (pe ak to signal ratio) and thus shows the amount of distortion in the image. The retrieval of the messa ge and the audio can also take place through this t ool. The tool has a very appealing and an easy to use GUI th us making it an effective solution to hide messages /files. Key Terms: Stegnography; LSB flipping; PSNR; e...

Steganography is one of the security measures employed at file level to cover information in a carrier. The goal of steganography is to send a confidential message over a network in a way that intruders will not notice it. In steganography, the message is wrapped in an innocent carrier such as image, audio or video file. There are always bits tempering in the process and this changes the looks and appearance of the carrier. The more secret message is embedded in any cover file, the more random noise occurs. Secret message bits when embedded drastically modify the Red Green and Blue (RGB) components’ bits of the carrier, hence, the statistical properties and physical appearance of the carrier change and this draws the attention of intruders to suspect that confidential data is hidden there. This research introduced an improved method of least significant bit replacement to cover secret data using 24 bits bitmap image to handle random noise efficiently so that the Human Visual System ...

Steganography is a means of hiding information within a more obvious form of communication. It exploits the use of host data to hide a piece of information in such a way that it is imperceptible to human observer. The major goals of effective steganography are High Embedding Capacity, Imperceptibility and Robustness. In this paper, the transform domain techniques of Image steganography have been discussed. The Orthogonal Transforms tested were DCT, DST, Haar and Walsh transform. The resultant stego images contained 4 different message images giving a 50% embedding capacity using these transforms. The message images have been normalized and then transformed to reduce the embedding error. The pixel values have been divided by a constant value of 255 to bring all the values into the range of 0.1 to 1.0.Therefore, High Embedding capacity has been achieved through the use of orthogonal transforms using the technique discussed in this paper. The paper compares image steganography schemes that hide secret message into simple orthogonal transforms such as DCT [Discrete Cosine Transform], DST [Discrete Sine Transform], Hartley, Walsh and Haar. The experimental results show that using DCT transform for image steganography achieve much better results as compared to DST, Walsh and Haar.

The method of steganography commonly used to hide data or information is Least Significant Bit (LSB) method. One of the relevant research is LSB using sequential Encoding Decoding by David Pipkorn and Preston Weisbrot. In this research, an analysis of the LSB method using Sequential Encoding Decoding by doing some testing. The tests are on the aspect of message security using tools StegSpy and enhanced LSB algorithm, testing on image quality by calculating the Peak Signal to Noise Ratio (PSNR) value and see the image histogram, testing on robustness of message by doing some image processing operations on stego image, like cropping, rotating, and etc, and then testing on capacity to check size of cover image and stego image and calculates the maximum size of data that can be hidden. From the testing process, we know that there are deficiencies in the aspects of security, robustness and capacity of a message. And then in this research we try to change the location of messages that are...

Internet communication become the need of entire world, today internet is like a recourse of power that is used to run human life. The users, as a layman, may not know that internet, a way of communication, as the use of internet is increasing also data and information that is traveling through internet is increasing by every passing day every minute. In an internet environment where every user need security about their data and information that they want to share with other, such environment requires secrecy and security to safeguard the privacy. There are many approaches available that can be adopted to provide user data security, Steganography is one of the techniques which offer sufficient platform to tackle this aspect in a suitable way. The working is very easy; the information (data) can be hidden inside the other information (data) while viewers may see the cover and hidden data will be known to intended viewers only that know the way of decryption that is adopted at sender side. In simple world two images are selected, one as cover and other as message carrier, but the view and size of original image may not be changed. This paper discusses certain technique and algorithms in context to Least Significant Bit (LSB) and ascertains possible depth of LSB usage where the distortion of image starts and attracts the attacker/ hacker. It became a unique way of information hiding by merging images with cipher data or plain text.

Steganography is a method of hiding secret information into an innocent looking container. Although a large number of steganography techniques have been proposed, there is a constant need for new variants because they have a relatively short lifespan, being defeated by steganalysis techniques. This article explores the possibilities of eliminating the main drawback of LSB steganography: weakness. The problem is solved by rearranging the image pixels and by applying a compensation technique that preserves their statistical properties. The proposed method contains an encryption block that adds an extra layer of security to the hidden data.

Information security is one of the most important branches concerned with maintaining the confidentiality and reliability of data and the medium for which it is transmitted. Digital watermarking is one of the common techniques in this field and it is developing greatly and rapidly due to the great importance it represents in the field of reliability and security. Most modern watermarking systems, however, use the self-organization map (SOM), which is safer than other algorithms because an unauthorized user cannot see the result of the SOM's training. Our method presents a semi-fragile watermark under spatial domain using least significant bit (LSB) and by relying on most significant bit (MSB) when the taken values equal to (2 or 4 bits) depending on the characteristics of SOM through developing the so-called best matching unit (BMU) which working to determine the best location for concealment. As a result, it shows us the ability of the proposed method to maintain the quality of...

Information security is one of the most important branches concerned with maintaining the confidentiality and reliability of data and the medium for which it is transmitted. Digital watermarking is one of the common techniques in this field and it is developing greatly and rapidly due to the great importance it represents in the field of reliability and security. Most modern watermarking systems, however, use the self-organization map (SOM), which is safer than other algorithms because an unauthorized user cannot see the result of the SOM's training. Our method presents a semifragile watermark under spatial domain using least significant bit (LSB) and by relying on most significant bit (MSB) when the taken values equal to (2 or 4 bits) depending on the characteristics of SOM through developing the so-called best matching unit (BMU) which working to determine the best location for concealment. As a result, it shows us the ability of the proposed method to maintain the quality of the host with the ability to retrieve data, whether it is a binary image or a secret message.

This work is devoted to the development of the method of information concealment, in the raster image using steganography together with cryptography the solving the problem of recovering a message if the image which contains hidden data is damaged. It proposes a method of implementing the steganography for insert data on digital image not in its entirety, but previously using (t, n)-threshold scheme and inserting each of the parts received independently. The software was developed for approbation of the proposed method. A series of experiments confirming the possibility of applying the proposed method was carried out. Text information is inserted into the raster image. Further, the image was subjected to modification, simulates container damage when it was transmitted through the communication channel or as a result of intentional actions of an intruder. As a result of the experiments, it can be said about the possibility of applying the proposed method. Keywords— cryptography; secr...

Although phase change memory with multi-bit storage capability (known as MLC PCM) offers a good combination of high bit-density and non-volatility, its performance is severely impacted by the increased read/write latency. Regarding read operation, access latency increases almost linearly with respect to cell density (the number of bits stored in a cell). Since reads are latency critical, they can seriously impact system performance. This paper alleviates the problem of slow reads in the MLC PCM by exploiting a fundamental property of MLC devices: the Most-Significant Bit (MSB) of MLC cells can be read as fast as SLC cells, while reading the Least-Significant Bits (LSBs) is slower. We propose Striped PCM (SPCM), a memory architecture that leverages this property to keep MLC read latency in the order of SLC's. In order to avoid extra writes onto memory cells as a result of striping memory lines, the proposed design uses a pairing write queue to synchronize write-back requests associated with blocks that are paired in striping mode. Our evaluation shows that our design significantly improves the average memory access latency by more than 30% and IPC by up to 25% (10%, on average), with a slight overhead in memory energy (0.7%) in a 4-core CMP model running memory-intensive benchmarks.

Besides cryptography, the great attention is paid to the steganography, which is considered not only the science but also the art of the concealed communication. In steganography, the information is hidden within another piece of information, called stegomedia. This paper presents a new data hiding technique based on steganographic algorithms that is hiding information into vector images. The paper briefly introduces this technique and evaluates the benefits and drawbacks of the proposed approach.

Due to advancement in communication technology, data are transmitted over the network which is either confidential or private. So, the information security is one of the most critical factors considered when secret data is transmitted between two parties. Another important issue is the bandwidth utilisation for data transmission. Image steganography is a widely used technique for data hiding. It is used in critical applications like military and medical areas. Most of the work is done in uncompressed images, which leads to high storage and large bandwidth required for transmission. Keeping these two factors in mind, this paper presents the multilevel histogram shifting technique in the compressed domain with the addition of adaptive block division scheme to improve the embedding capacity as well as reduce the utilisation of the bandwidth. In this method, absolute moment block truncation coding (AMBTC) compression technique has been used for compression because of its good compression ratio.

Steganography has been emerged as a prominent technique for communicating secret information in a proper multimedia career. In image steganography, least significant bit (LSB) substitution method is popular but vulnerable to numerous security attacks. Hence, it is always imperative to make the steganographic technique more robust and secure. This paper presents a new approach to hiding text messages within red-green-blue (RGB) images based on LSB technique. Unlike the standard LSB technique, where message bits are directly embedded in the LSB positions, our proposed algorithm encodes these message bits before embedding in the LSB positions. This embedding and encoding process are done on the basis of most significant bit (MSB) values of RGB and the concept of odd and even parities of those pixels respectively. The main goal of the presented method is to improve the robustness and the image quality of the stego-image. The performance of stego-image quality is measured by mean square of error (MSE), peak signal-to-noise ratio (PSNR), structural similarity measure (SSIM), bits ratio (BR), and histogram analysis. Experimental results and comparative studies have revealed that the proposed technique is able to conceal message effectively, with there being little difference between the cover image and the stego-image. Results also show that our proposed approach can embed reasonable amount of information.

Visual Cryptography is a technique in which a secret is encrypted into several image shares and then decrypted later using a human visual system to stack all the share images. Conventional visual cryptography methods divide a secret image into n shares (shadows) and distribute these shares to n participants. But in network while transmission the shadows can be changed by attackers or damaged. To remedy such kind of vulnerabilities verifiability of shadows can be a solution. Watermarking can add verifiability to secret sharing, but the shadows are meaningless which can attract the attacker's attention. The proposed scheme embeds created shadows in cover images which make them more secure. In this paper we have explained how a low computational complexity visual secret sharing scheme is verifiable and more secure by combining Watermarking and Steganography.

The original exploiting modification direction (EMD) method proposed by Zhang and Wang is a novel data hiding technique which can achieve large embedding capacity with less distortion. The original EMD method can hide (2n + 1)-ary numbers by modifying at most one least-significant bit (LSB) of n pixel values. The proposed methods in this paper, 2-EMD and EMD-2, modify at most two pixels of the LSB values. Efficiency of the proposed methods is shown theoretically and through experiments. The 2-EMD and EMD-2 can hide even larger numbers than the EMD with similar distortion under the same conditions. This paper shows that the EMD-2 is much better than the EMD, and slightly better than 2-EMD when n is 3, 4 and 5. The way to generate basis vector can be used for the generalization of the n-EMD and EMD-n where n > 1.

Steganography has been a common mode of secret communication in recent years. Although the steganographic approach can be carried out in either image, audio or video signals, due to the availability of higher degree of redundant data and easy accessibility in transmission mediums, digital images are the prevalent practice of steganography. Generally, information hiding inside a digital image results in deprivation of some visual quality of the image. However, recent advancement in steganographic schemes has been able to develop techniques that can disguise an information within a digital image in such a way that the cover image can be taken to its original state after extracting the hidden information. These techniques are commo nly referred to as Lossless Steganography or Reversible Steganography. Although late researches in steganography have been able to successfully conduct reversible steganography in spatial domain, reliable and robust lossless steganographic technique in compressed domain is yet a challenge. In this paper, we propose a novel reversible steganographic approach that can hide high capacity secret information in location based compressed domain. The proposed method can completely reconstruct the cover image or host image and provide the best possible perceptual quality. The proposed method can also provide its users with a key for hiding and extracting information so that the robustness is achieved in a great extent.

Steganography has been a common mode of secret communication in recent years. Although the steganographic approach can be carried out in either image, audio or video signals, due to the availability of higher degree of redundant data and easy accessibility in transmission mediums, digital images are the prevalent practice of steganography. Generally, information hiding inside a digital image results in deprivation of some visual quality of the image. However, recent advancement in steganographic schemes has been able to develop techniques that can disguise an information within a digital image in such a way that the cover image can be taken to its original state after extracting the hidden information. These techniques are commonly referred to as Lossless Steganography or Reversible Steganography. Although late researches in steganography have been able to successfully conduct reversible steganography in spatial domain, reliable and robust lossless steganographic technique in compre...

This letter proposes a novel check node unit architecture for LDPC decoders, which avoids the usage of carry based comparators for the computation of the required first and second minimum values. It relies on a one-hot representation of the input messages' magnitude, obtained by q-to-2 q decoders. The two minimums are computed using an OR tree and a modified leading zero counter. The proposed architecture is imprecise, as the second minimum is not computed correctly when it is equal to the first one. The implementation results and the analysis of the error correction capability show that the proposed imprecise unit is highly suited for high rates LDPC codes; it presents up to 30% better hardware cost, higher working frequency, while the loss of the decoding capability is negligible with respect to standard implementations.

Steganography is the science of hiding information that involves all the techniques used to exchange the secret message with low distortion of the cover medium. Many different cover medium formats such as (image, audio, video, and text) can be used to hide the secret message. Image files are mostly used because of their frequency on the Internet. Some of the old techniques used schemes to hide information are: invisible ink, null ciphers, micro-codes, and pink-pricks. Modern Steganography has gained a lot of attention for the last two decades because of the rapid growth of communication technologies such as Internet and the need of a secure channel to transmit the important information. In this paper, a concept of image steganography is explained and a review of recent image steganography methods and its applications is presented.

Data hiding (steganography or watermarking) involves embedding secret data into various forms of digital media such as text, audio, image and video. In this paper we propose two variants of vector quantization (VQ) based steganography method to hide secret speech signal in host public speech coded by the AMR-WB (Rec. G.722.2). The secret bit stream is hidden by using the basic principle of binning scheme which is carried out in the split-multistage vector quantization of G.722.2 immittance spectral frequencies (ISF) parameters.

Although phase change memory with multi-bit storage capability (known as MLC PCM) offers a good combination of high bit-density and non-volatility, its performance is severely impacted by the increased read/write latency. Regarding read operation, access latency increases almost linearly with respect to cell density (the number of bits stored in a cell). Since reads are latency critical, they can seriously impact system performance. This paper alleviates the problem of slow reads in the MLC PCM by exploiting a fundamental property of MLC devices: the Most-Significant Bit (MSB) of MLC cells can be read as fast as SLC cells, while reading the Least-Significant Bits (LSBs) is slower. We propose Striped PCM (SPCM), a memory architecture that leverages this property to keep MLC read latency in the order of SLC's. In order to avoid extra writes onto memory cells as a result of striping memory lines, the proposed design uses a pairing write queue to synchronize write-back requests associated with blocks that are paired in striping mode. Our evaluation shows that our design significantly improves the average memory access latency by more than 30% and IPC by up to 25% (10%, on average), with a slight overhead in memory energy (0.7%) in a 4-core CMP model running memory-intensive benchmarks.

In this study we propose a new approach to tackle the cropping problem in steganography which is called Center Embedded Pixel Positioning (CEPP) which is based on Least Significant Bit (LSB) Matching by setting the secret image in the center of the cover image. The evaluation of the experiment indicated that the secret image can be retrieved by a maximum of total 40% sequential cropping on the left, right, up, and bottom of the cover image. The secret image also can be retrieved if the total asymmetric cropping area is 25% that covered two sides (either left-right, left-up or right-up). In addition, the secret image can also be retrieved if the total asymmetric cropping area is 70% if the bottom part is included. If asymmetric cropping area included three sides, then the algorithm fails to retrieve the secret image. For cropping in the botom the secret image can be extracted up to 70%.

For example, if on the record of number D = 131 = 10000011 we invert the MSB = 1 into MSB = 0, then obtain D = 00000011 = 3, but if we invert LSB = 1 into LSB = 0, then distortions are considerably fewer: D = 10000010 = 130. It is common to assign each bit a position number, ranging from zero to N – 1, where N is the number of bits in the binary representation used. Normally, this is simply the exponent for the corresponding bit weight in base-2 (such as in 2, 2, ..., 2, 2). In this article to reduce the stego-errors we use a pair of numbers D1 and D2 and a pair of corresponding LSB d1,0 and d2,0.

The Least Significant Bit (LSB) algorithm and the Most Significant Bit (MSB) algorithm are steganography algorithms with each one having its demerits. This work therefore proposed a Hybrid approach and compared its efficiency with LSB and MSB algorithms. The Least Significant Bit (LSB) and Most Significant Bit (MSB) techniques were combined in the proposed algorithm. Two bits (the least significant bit and the most significant bit) of the cover images were replaced with a secret message. Comparisons were made based on Mean-Squared Error (MSE), Peak Signal-to-Noise Ratio (PSNR) and the encoding time between the proposed algorithm, LSB and MSB after embedding in digital images. The combined technique produced a stego-image with minimal distortion in image quality than MSB technique independent of the nature of data that was hidden. However, LSB algorithm produced the best stego-image quality. Large cover images however made the combined algorithm’s quality better improved. The combine...

The Least Significant Bit (LSB) algorithm and the Most Significant Bit (MSB) algorithm are steganography algorithms with each one having its demerits. This work therefore proposed a Hybrid approach and compared its efficiency with LSB and MSB algorithms. The Least Significant Bit (LSB) and Most Significant Bit (MSB) techniques were combined in the proposed algorithm. Two bits (the least significant bit and the most significant bit) of the cover images were replaced with a secret message. Comparisons were made based on Mean-Squared Error (MSE), Peak Signal-to-Noise Ratio (PSNR) and the encoding time between the proposed algorithm, LSB and MSB after embedding in digital images. The combined technique produced a stego-image with minimal distortion in image quality than MSB technique independent of the nature of data that was hidden. However, LSB algorithm produced the best stego-image quality. Large cover images however made the combined algorithm's quality better improved. The combined algorithm had lesser time of image and text encoding. Therefore, a trade-off exists between the encoding time and the quality of stego-image as demonstrated in this work.

https://www.ijert.org/a-perusal-study-of-audio-steganography-with-lsb-techniques

https://www.ijert.org/research/a-perusal-study-of-audio-steganography-with-lsb-techniques-IJERTV4IS010026.pdf

The art of information hiding has done much progress in the recent years as security of information has become a big issue in this online communication era. The demand of security and privacy is increasing for confidential matter day by day, necessity of covering valuable and secret information have much importance during online communication. To fulfil this necessity, Steganography technique is very much useful which embed information in a digital media in such transparent way so no one should able to understand it. Audio Steganography is one of the most prominent and recognized technique. As it is known, imperceptibility, robustness and payload or hiding capacity are pillars of the steganography. The previous LSB techniques when increases payload capacity would hamper robustness as well as imperceptibility of the cover media. As well as when it matters of robustness to maintain then hiding capacity gets limited. This paper includes study of some audio steganography techniques with their merits and demerits. This paper proposes an audio steganography technique to improve the performance. The proposed method will provide optimum increment in the payload capacity by dividing the bytes of cover media into ranges to hide the bits of secret message appropriately. Use of range to hide secret data will maintain the robustness of cover media along with preserving the imperceptibility.

Development in internet and information sharing on it increases demand to keep the owner's rights from any manipulations or plagiarism. Instead of this, for some confidential data such as proof (in terms of video/images) needs content to be kept hide from public or to prevent it from leakages to the public. Hence need to provide the security and protection to these information'susing cryptography, steganography, or watermarking methods. Cryptography, steganography, and watermarking have similar application. Secret Messages are hidden is the main task of this work, send to other users and the receiver would be capable to know the secret message. As for cryptography, this method will transform the secret message into encrypted form to secure the transmission, and then use a 'key' to decrypt the message. The security has been providing by the method of encryption and decryption, but the contents have not been protected. On the other hand, steganography is to embed secret information perfectly secured with no visible change in the cover object. In this work, both cryptography and steganography has been merge in cover image by converting it into non-overlapping blocks hence results in more security for hidden message. XOR cryptography method has been used for encryption and decryption whereas two bit LSB placement based on maximum entropy blocks has been used for embedding. For selecting the secret information, Self-embedding approach has being used in which only MSB bits has been chosen hence cause with more region to be embedded. Algorithm is able to embed maximum of 50% region of the cover image MSB bits.

Information hiding has several branches. One is called as steganography. Steganography has a wide variety of techniques whereby a certain amount of secret information is embedded inside a medium. The medium format can be of any kind. However, the simplest file format is an 8-bit gray scale image. The original image is called a cover image. Likewise, once some secret bits are embedded, it is called stego-image. The most challenging issue is how capable a technique is to conceal the very existence of secret information in the stego-image. Steganographic techniques are evaluated in terms of imperceptibility and capacity. Imperceptibility means how visible secret information is to the human eyes in the stego-image. On the other hand, capacity means the maximum amount of secret information embedded. Conventional Least Significant Bit (LSB) insertion method is the basic concept for steganographic techniques. LSB method embeds secret bits in LSB(s) of the cover image. A pixel which carries a fraction of secret data is called a target pixel. The more surrounding pixels around a target pixel are utilized to find the most appropriate capacity value, the more precise capacity value is achieved. This paper proves that discovering the best capacity value brings about an improvement in terms of imperceptibility. Most of the steganographic techniques use either three or four adjacent pixels around a target pixel whereas the proposed technique is able to utilize at most all eight adjacent neighbors so that imperceptibility value grows bigger. The proposed method is called A-MSPU which stands for Adaptive More Surrounding Pixels Using.

—Steganography, the technology of protecting a secret message by embedding it inside a cover image, continues to be investigated and enhanced as an alternative data protection method. This paper deals with hiding multimedia files in true color RGB cover images with an emphasis on reducing the cover size, increasing hiding capacity and enhancing security of the hidden data. A proposed model (DuoHide) is presented in which a secret multimedia file, regardless of its type, is processed without un-compression, and divided between two cover images of equal size and dimensions. The multimedia file is read as a stream of bytes and split vertically into two parts; one part contains the least significant half-bytes, and the other part contains the most significant half-bytes. The two parts are hidden inside two uncompressed RGB cover images using a least significant 4-bit replacement technique. The resulting dual stego images are expected to be sent separately, through different channels, to avoid capture of both stego files by an adversary. Extraction of the secret file is achieved through merging LSB half-bytes from the two stego files. The extracted file is identical in content and structure with the original secret file. The implemented DuoHide system was evaluated using a set of public multimedia files; images, audios, and videos, of various sizes. The secret file sizes ranged from 5% to about 100% of the cover image's size. The experimental results showed that even at the highest embedding ratio, which is based on the secret-to-cover ratio, there were no perceptible visual differences between cover and stego images. The PNSR value was calculated as PSNR1, for cover1 and stego1, and PSNR2 for cover2 and stego2. The lowest PSNR value was around 31 dB for the highest embedding ratio, which is considered acceptable concerning statistical imperceptibility. The PSNR value increased as the embedding ratio decreased, reaching around 65 Decibel (dB) for the case of 5% secret-to-cover ratio. The integrity of the extracted secret file was verified through a bitwise comparison between original and extracted files, which showed zero differences. The DuoHide model is expected to provide better security for the hidden file, in case an attacker manages to capture one of the stego images and recover the hidden content because the attacker will only get an incomprehensible set of half-byte bits. An additional advantage of using a pair of stego files is that of reducing stego file size by 50%, to avoid problems and limitations of transmitting large files, especially that multimedia files are often large, and they cannot be compressed because they are already compressed. Security of the DuoHide system can further be improved by randomizing storage locations within the two stego images.

— Now a day, rapid growth of Internet and its users increases range of data types which emphasize the security problem and also flood of multimedia contents in the structure of transmission of such data. The Encryption system for data is used for hiding data and messages by supervised trained dictionary. It involves hiding the secret text inside the cheating text. This cheating text is then hiding in Audio file. If this cheating text is intercepted by unauthorized person, the secret text may still be undetected by them. There are many reasons to hide data but most important is to put off unauthorized persons from becoming conscious of the existence of such a message in the network of communication. This hidden message is information which is not immediately noticeable which must be discovered or uncovered and interpreted before it can be known to anybody. This paper proposes an approach for generating cheating text and hiding cheating text in audio/sound file this high capacity audio algorithm based on the wavelet packet transform with adaptive hiding in LSB (Least Significant Bits). The adaptive hiding is determined depend on the cover signal strength and bits block matching between message and cover signals.

The problem of finding efficiently the first k minimum or maximum values is generally met in many application fields, such as error control coding. More specifically, optimized solutions for the selection of the two or three smallest elements out of a given set of numbers are greatly needed for the design of high-speed Low-Density Parity-Check (LDPC) decoders, as this min-search can be the bottleneck. This paper aims to tackle current limitations by proposing a novel algorithm for solving this problem, where the searching is based on scanning from the most significant bit (MSB) to the least significant bit (LSB) of each input data. A design mapped to reconfigurable logic and a software tool for the automatic generation of synthesizable VHDL codes, implementing such low-latency components are presented as well. Experimental results show that compared to existing solutions, the proposed scheme achieves an up to 42% reduction in latency even at worst case. Since the hardware unit is repeatedly used in the LDPC decoder design, the described high-speed approach is strongly recommended.

The Z 8 -analogues of the Kerdock codes of length n ¼ 2 m were introduced by Carlet in 1998. We study the binary sequences of period n À 1 obtained from their cyclic version by using the most significant bit (MSB)-map. The relevant Boolean functions are of degree 4 in general. The linear span of these sequences has been known to be of the order of m 4 : We will show that the crosscorrelation and nontrivial autocorrelation of this family are both upper bounded by a small multiple of ffiffi ffi n p

Families of binary low correlation sequences with high nonlinearity (in relation with their Walsh Hadamard transform) are constructed by using the most significant bit of linear recurrence sequences over the ring Z 2 l , for l ≥ 3. The engineering motivation is the design of a multicode CDMA scheme with a control of low peak to average power ratio (PAPR). Proof techniques combine Galois Ring theory (local Weil bound) with spectral analysis over the additive group of Z 2 l . New estimates on the size of weighted degree trace codes are derived. The parameters of the sequences families constructed are shown to lie above a modified Varshamov-Gilbert bound.

The problem of finding efficiently the first k minimum or maximum values is generally met in many application fields, such as error control coding. More specifically, optimized solutions for the selection of the two or three smallest elements out of a given set of numbers are greatly needed for the design of high-speed Low-Density Parity-Check (LDPC) decoders, as this min-search can be the bottleneck. This paper aims to tackle current limitations by proposing a novel algorithm for solving this problem, where the searching is based on scanning from the most significant bit (MSB) to the least significant bit (LSB) of each input data. A design mapped to reconfigurable logic and a software tool for the automatic generation of synthesizable VHDL codes, implementing such low-latency components are presented as well. Experimental results show that compared to existing solutions, the proposed scheme achieves an up to 42% reduction in latency even at worst case. Since the hardware unit is repeatedly used in the LDPC decoder design, the described high-speed approach is strongly recommended.

The problem of finding efficiently the first k minimum or maximum values is generally met in many application fields, such as error control coding. More specifically, optimized solutions for the selection of the two or three smallest elements out of a given set of numbers are greatly needed for the design of high-speed Low-Density Parity-Check (LDPC) decoders, as this min-search can be the bottleneck. This paper aims to tackle current limitations by proposing a novel algorithm for solving this problem, where the searching is based on scanning from the most significant bit (MSB) to the least significant bit (LSB) of each input data. A design mapped to reconfigurable logic and a software tool for the automatic generation of synthesizable VHDL codes, implementing such low-latency components are presented as well. Experimental results show that compared to existing solutions, the proposed scheme achieves an up to 42% reduction in latency even at worst case. Since the hardware unit is repeatedly used in the LDPC decoder design, the described high-speed approach is strongly recommended.

The problem of finding efficiently the first k minimum or maximum values is generally met in many application fields, such as error control coding. More specifically, optimized solutions for the selection of the two or three smallest elements out of a given set of numbers are greatly needed for the design of high-speed Low-Density Parity-Check (LDPC) decoders, as this min-search can be the bottleneck. This paper aims to tackle current limitations by proposing a novel algorithm for solving this problem, where the searching is based on scanning from the most significant bit (MSB) to the least significant bit (LSB) of each input data. A design mapped to reconfigurable logic and a software tool for the automatic generation of synthesizable VHDL codes, implementing such low-latency components are presented as well. Experimental results show that compared to existing solutions, the proposed scheme achieves an up to 42% reduction in latency even at worst case. Since the hardware unit is repeatedly used in the LDPC decoder design, the described high-speed approach is strongly recommended.

The Least Significant Bit (LSB) algorithm and the Most Significant Bit (MSB) algorithm are steganography algorithms with each one having its demerits. This work therefore proposed a Hybrid approach and compared its efficiency with LSB and MSB algorithms. The Least Significant Bit (LSB) and Most Significant Bit (MSB) techniques were combined in the proposed algorithm. Two bits (the least significant bit and the most significant bit) of the cover images were replaced with a secret message. Comparisons were made based on Mean-Squared Error (MSE), Peak Signal-to-Noise Ratio (PSNR) and the encoding time between the proposed algorithm, LSB and MSB after embedding in digital images. The combined
technique produced a stego-image with minimal distortion in image quality than MSB technique independent of the nature of data that was hidden. However, LSB algorithm produced the best stego-image quality. Large cover images however made the combined algorithm’s quality better improved. The
combined algorithm had lesser time of image and text encoding. Therefore, a trade-off exists between the encoding time and the quality of stego-image as demonstrated in this work.