Results

**1 - 4**of**4**### Research Article A Novel Approach to Enhance the Security of the LSB Image Steganography

, 2014

"... Abstract: Forming a logical balance between the quality of the file and the scope of data that can be conveyed is the test of steganographic techniques to form such a balance. On top of that, the facts that cannot be covered up are the robustness of the method and security of the vague data. An ins ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract: Forming a logical balance between the quality of the file and the scope of data that can be conveyed is the test of steganographic techniques to form such a balance. On top of that, the facts that cannot be covered up are the robustness of the method and security of the vague data. An insertion method which delivers a high level of visual quality and a huge amount of volume for the obscured data is called the Least Significant Bit (LSB), but the concealed message is poorly secured through this technique. In the recommended approach, the Vigenere encryption techniques initially used to encode the secret data to assure the safety of the concealed message. Later, the data is contracted through the Huffman coding method in order to decrease the occupational volume of the classified data. Then, each bit stream of the data is dispersed out onto the image to enhance the robustness of the technique by using the expanded knight tour algorithm. The outcomes show that apart from enhancing the visual quality of the stego image, the recommended technique enhances the safety and payload capacity issues of the simple LSB technique.

### Adaptive Cryptosystem for Digital Images using Fibonacci Bit-Plane Decomposition

, 2013

"... In this paper, we introduce a novel encryption algorithm based on Fibonacci numbers. In addition, novel bit-plane decomposition for Fibonacci weights is also discussed that offers cryptographic benefits. The new lossless image encryption algorithm is presented can encrypt an image using this new dec ..."

Abstract
- Add to MetaCart

In this paper, we introduce a novel encryption algorithm based on Fibonacci numbers. In addition, novel bit-plane decomposition for Fibonacci weights is also discussed that offers cryptographic benefits. The new lossless image encryption algorithm is presented can encrypt an image using this new decomposition method for privacy protection. Further, it has two levels of encryption that could address both pay-per-view applications or secured communication simultaneously. Simulation results and analysis verify that the algorithm shows good performance in image encryption.

### Adaptive Cryptosystem for Digital Images Using Fibonacci Bit-Plane Decomposition

, 2013

"... In this paper, we introduce a novel encryption algorithm based on Fibonacci numbers. In addition, novel bitplane decomposition for Fibonacci weights is also discussed that offers cryptographic benefits. The new lossless image encryption algorithm is presented can encrypt an image using this new dec ..."

Abstract
- Add to MetaCart

In this paper, we introduce a novel encryption algorithm based on Fibonacci numbers. In addition, novel bitplane decomposition for Fibonacci weights is also discussed that offers cryptographic benefits. The new lossless image encryption algorithm is presented can encrypt an image using this new decomposition method for privacy protection. Further, it has two levels of encryption that could address both pay-perview applications or secured communication simultaneously. Simulation results and analysis verify that the algorithm shows good performance in image encryption.

### A Note On the Bounds for the Generalized Fibonacci-p-Sequence and its Application in Data-Hiding

"... In this paper, we suggest a lower and an upper bound for the Generalized Fibonaccip-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges ..."

Abstract
- Add to MetaCart

In this paper, we suggest a lower and an upper bound for the Generalized Fibonaccip-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges to a p-degree polynomial and then use this result to prove the bounds for generalized Fibonacci-p sequence, thereby generalizing the exponential bounds for classical Fibonacci Sequence. Then we show how these results can be used to prove efficiency for data hiding techniques using generalized Fibonacci sequence. These steganographic techniques use generalized Fibonacci-p-Sequence for increasing the number of available bit-planes to hide data, so that more and more data can be hidden into the higher bit-planes of any pixel without causing much distortion of the cover image. This bound can be used as a theoretical proof for efficiency of those techniques, for instance it explains why more and more data can be hidden into the higher bit-planes of a pixel, without causing considerable decrease in PSNR.