Re: Protocol for finding highest salary

>    You need a modulus to make the discrete logarithm difficult. If you 
> use a modulus, is x>y well defined? If you use a modulus and you make 
> x>y well defined, then being able to answer the x>y question would allow 
> you to take discrete logs quickly.
Not necessarily. It depends on the cyclic group you are using.

Examples for groups where DL is hard:
-Eliptic curves over Z/p
-Multiplicative group Z/pZ*

Example for groups where DL is easy:
-Additive group Z/pZ.
 (i.e. DL is easy in this group, because e.g. x^5 = x+x+x+x+x mod p in that case)

My original question was assuming a group where DL is hard :-)
So... Anybody aware of something DL based for the salary problem? :-)

Markus