Re: A basic question about hashing
From: Bryan Olson (fakeaddress_at_nowhere.org)
Date: 09/08/04
 Next message: John Savard: "Re: Encryption of Computer screen typing?"
 Previous message: Giorgio: "Re: Expected average cycle length..."
 In reply to: MokKong Shen: "Re: A basic question about hashing"
 Next in thread: Joe Peschel: "Re: A basic question about hashing"
 Reply: Joe Peschel: "Re: A basic question about hashing"
 Reply: MokKong Shen: "Re: A basic question about hashing"
 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 08 Sep 2004 06:53:03 GMT
MokKong Shen wrote:
> Certainly, what I said in the original post is only a rough
> concept, hence not being concrete. However, I think that
> appropriate polynomials of degrees over 3 may be quite tough
> to invert for arguments of, say, 128 bits. Now, if one has,
> say, 4 blocks from such a function and apply even a very
> simple combination of them, namely a sum mod 2^128, I don't
> yet see how the attacker is going to proceed.
In order to assess the significance of your "I don't yet see",
we would need to know hard you have looked. Can you describe
what study you did before announcing this?
 Bryan
 Next message: John Savard: "Re: Encryption of Computer screen typing?"
 Previous message: Giorgio: "Re: Expected average cycle length..."
 In reply to: MokKong Shen: "Re: A basic question about hashing"
 Next in thread: Joe Peschel: "Re: A basic question about hashing"
 Reply: Joe Peschel: "Re: A basic question about hashing"
 Reply: MokKong Shen: "Re: A basic question about hashing"
 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
