26 search results - page 3 / 6 » The Discrete Logarithm in Logarithmic -Class Groups and Its ... |
ACSC
2008
IEEE
14 years 7 days ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
ASIACRYPT
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
ANTS
2004
Springer
13 years 9 months ago
2004
Springer
We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR. Underpinning both systems is the mathematics of the two dimen...
MYCRYPT
2005
Springer
13 years 11 months ago
2005
Springer
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
ASIACRYPT
2004
Springer
13 years 11 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diï¬...