It is always difficult to decide which are your most significant publications, as some oustanding work may be displaced. Here I have chosen those that I feel are the most important while representative of my broad range of interests. These are not necessarily my most highly cited papers, and indeed here I have displaced papers that have been highly cited: specifically I have displaced 6 papers ...

This paper presents three new attacks on the RSA cryptosystem. The first two attacks work when k RSA public keys (Ni, ei) are such that there exist k relations of the shape eix−yiφ(Ni) = zi or of the shape eixi − yφ(Ni) = zi where Ni = piqi, φ(Ni) = (pi − 1)(qi − 1) and the parameters x, xi, y, yi, zi are suitably small in terms of the prime factors of the moduli. We show that our attacks enabl...

To develop and check the Steganography based information’s by using Matlab this proposal investigates the detection of information hidden in digital media by both the least significant bit (LSB) matching and replacement scheme. Which can completely recover the original images without any distortion from the secret images by utilizing the parity features of the original images and defining two e...

We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, where q1,q2 are α-bit primes. We are given the implicit information that p1 and p2 share t most significant bits. We present a novel and rigorous lattice-based method that leads to the factorization of N1 and N2 in pol...

Scalar quantization is the most practical and straightforward approach to signal quantization. However, it has been shown that scalar quantization of oversampled or Compressively Sensed signals can be inefficient in terms of the rate-distortion trade-off, especially as the oversampling rate or the sparsity of the signal increases. Recent theoretical work has provided some insights on improving ...