247 search results - page 1 / 50 » A New Cryptosystem Based On Hidden Order Groups |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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....
JOC
2000
13 years 4 months ago
2000
We present a new cryptosystem based on ideal arithmetic in quadratic orders. The method of our trapdoor is different from the Diffie
EUROCRYPT
1998
Springer
13 years 9 months ago
1998
Springer
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...
EUROCRYPT
2010
Springer
13 years 9 months ago
2010
Springer
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We present a chosen-ciphertext attack against both NICE cryptosystems. These two cryptosystems are based on computations in the class group of non-maximal imaginary orders. More pr...