hash function
From: Aldar C-F. Chan (aldar_at_comm.utoronto.ca)
Date: 02/21/05
- Next message: David Wagner: "Re: hash function"
- Previous message: jwu1_at_lakeheadu.ca: "Re: questions about k-universal hash functions"
- Next in thread: David Wagner: "Re: hash function"
- Reply: David Wagner: "Re: hash function"
- Reply: Jean-Luc Cooke: "Re: hash function"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Mon, 21 Feb 2005 19:32:22 GMT
Is there any conjectured collision resistant hash functions h( )
from {0,1}* --> {0,1}^n that the following problem is also
hard:
Given y such that y = h{xxxx||a} where a is known, that is,
y is the image under h( ) of an unknown string xxxx appended
with a known string a, find those unknown part xxxx.
What I mean hard is that this problem is as hard as finding a
collision to a given preimage. Would any collision resistant
hash functions satisfy this? Thanks.
- Next message: David Wagner: "Re: hash function"
- Previous message: jwu1_at_lakeheadu.ca: "Re: questions about k-universal hash functions"
- Next in thread: David Wagner: "Re: hash function"
- Reply: David Wagner: "Re: hash function"
- Reply: Jean-Luc Cooke: "Re: hash function"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
Loading