Sciweavers

247 search results - page 1 / 50
» A New Cryptosystem Based On Hidden Order Groups
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 6 months ago
A New Cryptosystem Based On Hidden Order Groups
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....
Amitabh Saxena, Ben Soh
JOC
2000
94views more  JOC 2000»
13 years 6 months ago
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
We present a new cryptosystem based on ideal arithmetic in quadratic orders. The method of our trapdoor is different from the Diffie
Sachar Paulus, Tsuyoshi Takagi
EUROCRYPT
1998
Springer
13 years 10 months ago
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
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 ...
Detlef Hühnlein, Michael J. Jacobson Jr., Sac...
EUROCRYPT
2010
Springer
13 years 11 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
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...
David Mandell Freeman
EUROCRYPT
2000
Springer
13 years 9 months ago
A NICE Cryptanalysis
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...
Éliane Jaulmes, Antoine Joux