In this paper, we present a novel image steganography algorithm that combines the strengths of edge detection and XOR coding, to conceal a secretmessage either in the spatial domain or an IntegerWavelet Transform (IWT) based transform domain of the cover image. Edge detection enables the identification of sharp edges in the cover image that when embedding in would cause less degradation to the ...

The existing reversible data hiding methods in encrypted domain separate image encryption from information embedding and do not make full use of the redundant space process encryption. In order to improve performance by using technical characteristics encryption, a method based on McEliece error correction is proposed. Firstly, segmentation position bit plane determined according requirement te...

We propose a formal model for embedding information in black-white images and prove the equivalence between existence of embedding schemes and covering codes. An asymptoticly tight bound on the performance of embedding schemes is given. We construct efficient embedding schemes via known coverings. In particular, one of those schemes allows to embed up to log 2 (n + 1) bits in coverwords of n bi...

Low power consumption, low gate count, and high throughput are standard design criteria for cryptographic coprocessors designated for resource constrained devices such as smart cards. With the advent of side channel attacks, devices’ resistance to such attacks became another major requirement. This paper describes a cryptographic hardware module for an AES algorithm that provides complete prote...

We propose a data hiding method in color image with its image palette. Many authors usually embed data into the palette or into the index table of the palette directly. Those data hiding methods embedded the secret data into palette itself, the palette will be changed to a different one. It becomes more difficultly to reveal the embedded information. We apply the particle swarm optimization met...

Since the advent of pairing based cryptography, much attention has been given to efficient computation of pairings on elliptic curves with even embedding degrees. The few works that exist in the case of odd embedding degrees require some improvements. This paper considers the computation of optimal ate pairings on elliptic curves of embedding degrees k = 9, 15 and 27 which have twists of order ...

Image authentication is done by embedding image/ message in spatial domain or frequency domain. A mask is chosen from the source image in row major order. Bits of the authenticating image are embedded in each byte of the source image block where the position is chosen using hash function. A hash function is a function that takes variable size inputs and return fixed size output. The position wi...

This paper proposes a method for generating a certain composite order ordinary pairing–friendly elliptic curve of embedding degree 3. In detail, the order has two large prime factors such as the modulus of RSA cryptography. The method is based on the property that the order of the target pairing–friendly curve is given by a polynomial as r(χ) of degree 2 with respect to the integer variable χ. ...

In this paper, we describe a new higher-order steganalytic method called Pairs Analysis for detection of secret messages embedded in digital images. Although the approach is in principle applicable to many different steganographic methods as well as image formats, it is ideally suited to 8-bit images, such as GIF images, where message bits are embedded in LSBs of indices to an ordered palette. ...

Steganography is the process of embedding data into a media form such as image, voice, and video. The major methods used for data hiding are the frequency domain and the spatial domain. In the frequency domain, the secret data bits are inserted into the coefficients of the image pixel's frequency representation such as Discrete Cosine Transform (DCT) , Discrete Fourier Transform (DFT) and Discr...