Abstract. Chosen-message attack on RSA is usually considered as an inherent property of its homomorphic structure. In this paper, we show that nonhomomorphic RSA-type cryptosystems...
Daniel Bleichenbacher, Marc Joye, Jean-Jacques Qui...
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
We propose a new anonymous fingerprinting scheme using Okamoto-Uchiyama cryptosystem[1]. In the previous schemes[2]-[4] the enciphering rate is so small that it seems very difficu...