Re: Fast hash of NSData?
Re: Fast hash of NSData?
- Subject: Re: Fast hash of NSData?
- From: Jens Alfke <email@hidden>
- Date: Mon, 02 Dec 2013 08:58:41 -0800
On Dec 2, 2013, at 6:36 AM, ChanMaxthon <email@hidden> wrote:
> How about this: treat the data as an array of 64-bit integers (zero-padded) and XOR them together? That will be really fast and you will be able to asm-optimize it.
Did you read the original post? That’s almost exactly what he’s already doing that he wants to improve.
> Or maybe, use some bits and pieces of AES (namely AES-NI instructions) and Merkle-Damgård construction? Since security is no major concern those asm-level constructs can be useful.
Seriously? To quote the last reply I sent, "The OP wants a real-world solution, not an abstract theoretical example”.
And guys, didn’t we answer the question already? And didn’t Graham already say he’d decided on murmurhash? I get the feeling we’re continuing to beat this dead horse into the ground just to show off what we know about combinatorics and crypto [myself included].
—Jens
_______________________________________________
Cocoa-dev mailing list (email@hidden)
Please do not post admin requests or moderator comments to the list.
Contact the moderators at cocoa-dev-admins(at)lists.apple.com
Help/Unsubscribe/Update your Subscription:
This email sent to email@hidden