At Eurocrypt'96, Meyer and M uller presented a new Rabin-type cryptosystem based on elliptic curves. In this paper, we will show that this cryptosystem may be reduced to the cryptosystem of Williams-Rabin.

We propose a new image cryptosystem to protect image data. It encrypts the original image into another virtual image. Since both original and virtual images are significant, our new cryptosystem can confuse illegal users. Besides the camouflage, this new cryptosystem has three other benefits. First, our cryptosystem is secure even if the illegal users know that our virtual image is a camouflage...

In 2002, Hwang et al. propose an asymmetric cryptosystem in which a large message is broken into smaller plaintexts which are then encrypted efficiently. They claim that based on the assumption of the intractability of the discrete logarithm problem, their cryptosystem is secure in the sense that even knowing some pairs of plaintext-ciphertext does not allow an intruder to acquire other plainte...

We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with Noise problem (LPN) and the decisional minimum distance problem. We show that the resulting cryptosystem achieves indistinguishability under chosen plaintext attacks (IND-CPA security). Using the FujisakiOkamoto generic construction, HELEN achieves IND-CCA security in ...

— Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the low-density attack. We show that this cryptosystem is not secure, as it based on basic Merkel-Hellman knapsack cryptosystem and because of the superincreasi...

While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...

We point out, in this paper, that the theory of generalized inverses of matrices over nite elds is a potential tool in cryptographic research, by proposing a public key cryptosystem. We analyse some properties of the public key cryptosystem and compare them with those of McEliece's public key cryptosystem. The idea is similar to that of McEliece's public key cryptosystem in terms of the usage o...

Hidden field equation (HFE) multivariable cryptosystems were first suggested by Patarin. Kipnis and Shamir showed that to make the cryptosystem secure, a special parameter D of any HFE cryptosystem can not be too small. Consequently Kipnis, Patarin and Goubin proposed an enhanced variant of the HFE cryptosystem by combining the idea of Oil and Vinegar construction with the HFE construction. Ess...