# Re: constructing a specified hash function

*From*: daw@xxxxxxxxxxxxxxxxxxxxxxxx (David Wagner)*Date*: Wed, 1 Nov 2006 06:14:41 +0000 (UTC)

bobic wrote:

Hi, all. Recently, I want to construct a specified hash function, which

satisfies

y=h(x), x can be any string, and y must belong to [g^a mod p,g^{a+1}

mod p,...,g^b mod p], and no body knows the discrete logrithm of y

based on g. a,b are known.

How about h(x) = G * g^H(x), where G = g^a mod p and

H(x) = SHA256(x) mod (b-a)/ Does that do it? Note that you will

have to publish the values G and b-a, but you nobody needs to know

the discrete log of G to the base g, nor the discrete log of y to

the base x.

Out of curiousity, why do you want this hash function? Do you

have any particular security goals for it?

.

**Follow-Ups**:**Re: constructing a specified hash function***From:*bobic

**References**:**constructing a specified hash function***From:*bobic

- Prev by Date:
**constructing a specified hash function** - Next by Date:
**Re: MD5 for passwords** - Previous by thread:
**constructing a specified hash function** - Next by thread:
**Re: constructing a specified hash function** - Index(es):