Groups
Conversations
All groups and messages
Send feedback to Google
Help
Training
Sign in
Groups
Hash Functions
Conversations
About
Hash Functions
Contact owners and managers
1–30 of 34
Mark all as read
Report group
0 selected
sri vani
,
Chuck Simmons
3
4/4/18
hash in pbc
https://www.google.com/search?q=secure+hash+function&oq=secure+hash+function+&aqs=chrome..
unread,
hash in pbc
https://www.google.com/search?q=secure+hash+function&oq=secure+hash+function+&aqs=chrome..
4/4/18
pulla....@gmail.com
7/13/16
Hash function in PBC
In research paper named "Multikey searchable encryption", for ecryption hash function
unread,
Hash function in PBC
In research paper named "Multikey searchable encryption", for ecryption hash function
7/13/16
Andres Valloud
8/18/15
[Smalltalks 2015] --- Invitation
The Fundación Argentina de Smalltalk proudly invites you to one of the premier Smalltalk conferences
unread,
[Smalltalks 2015] --- Invitation
The Fundación Argentina de Smalltalk proudly invites you to one of the premier Smalltalk conferences
8/18/15
medinaro...@gmail.com
6/2/15
An iterative construction of a hash function..
Hello, I have develop an interesting form of iterative hashing, using boolean functions, to achieve a
unread,
An iterative construction of a hash function..
Hello, I have develop an interesting form of iterative hashing, using boolean functions, to achieve a
6/2/15
anas....@gmail.com
, …
Andres Valloud
7
3/31/14
Hash function
I don't think those algorithms give correct answers because you could have hash(a) = hash(c) hash
unread,
Hash function
I don't think those algorithms give correct answers because you could have hash(a) = hash(c) hash
3/31/14
Andres Valloud
9/16/11
Smalltalks 2011: Call for Submission/Participacion
Sorry for multiple copies Following you have the Spanish version of the Smalltalks 2011 Call for
unread,
Smalltalks 2011: Call for Submission/Participacion
Sorry for multiple copies Following you have the Spanish version of the Smalltalks 2011 Call for
9/16/11
Andres Valloud
12/15/10
Smalltalks 2010 slides and videos now available
Hello, the FAST foundation is happy to announce that the videos and slides from Smalltalks 2010 are
unread,
Smalltalks 2010 slides and videos now available
Hello, the FAST foundation is happy to announce that the videos and slides from Smalltalks 2010 are
12/15/10
Bob Jenkins
10/27/10
a 128-bit hash
I'm finishing a 128-bit hash, aimed at noncryptographic checksums. Code at http://burtleburtle.
unread,
a 128-bit hash
I'm finishing a 128-bit hash, aimed at noncryptographic checksums. Code at http://burtleburtle.
10/27/10
Andres Valloud
9/24/10
Smalltalks 2010 --- Registration and invitation
======== INGLES The Fundaci�n Argentina de Smalltalk (FAST) invites you to the 4th Smalltalk
unread,
Smalltalks 2010 --- Registration and invitation
======== INGLES The Fundaci�n Argentina de Smalltalk (FAST) invites you to the 4th Smalltalk
9/24/10
Andres Valloud
7/23/10
Smalltalks 2010 Research Track: Call for Papers
** PLEASE EXCUSE US IF YOU RECEIVE MULTIPLE COPIES ** CALL FOR PAPERS SMALLTALKS 2010 4th Argentinian
unread,
Smalltalks 2010 Research Track: Call for Papers
** PLEASE EXCUSE US IF YOU RECEIVE MULTIPLE COPIES ** CALL FOR PAPERS SMALLTALKS 2010 4th Argentinian
7/23/10
Andres Valloud
6/24/10
Smalltalks 2010 Research Track: Call for Papers
** WE APOLOGIZE IN ADVANCE IF YOU RECEIVE MULTIPLE COPIES ** CALL FOR PAPERS SMALLTALKS 2010 4th
unread,
Smalltalks 2010 Research Track: Call for Papers
** WE APOLOGIZE IN ADVANCE IF YOU RECEIVE MULTIPLE COPIES ** CALL FOR PAPERS SMALLTALKS 2010 4th
6/24/10
César Estébanez
,
Andres Valloud
2
5/10/10
Books on Hashing
I am glad the hash book is helpful to you. Please let me know if you have any questions or comments.
unread,
Books on Hashing
I am glad the hash book is helpful to you. Please let me know if you have any questions or comments.
5/10/10
César Estébanez
, …
Andres Valloud
6
3/19/10
Databases for testing hash functions
Thank you Cesar, let me know your thoughts about the book so I can make a better second edition
unread,
Databases for testing hash functions
Thank you Cesar, let me know your thoughts about the book so I can make a better second edition
3/19/10
Andres
, …
Chuck Simmons
4
11/14/09
Re: google group invite
[Apologies for propagating this oh so off topic thread, but, hey, we weren't talking about
unread,
Re: google group invite
[Apologies for propagating this oh so off topic thread, but, hey, we weren't talking about
11/14/09
Chris Dew
8/24/09
Recombinant Hashes Demo
http://www.reddit.com/r/programming/comments/9di6w/recombinant_hashes_demo/ There is now a demo at
unread,
Recombinant Hashes Demo
http://www.reddit.com/r/programming/comments/9di6w/recombinant_hashes_demo/ There is now a demo at
8/24/09
Chris Dew
,
Andres
6
8/23/09
Recombinant Hashes
A demo is now up and working (so long as a long-running process doesn't die). http://www.finalcog
unread,
Recombinant Hashes
A demo is now up and working (so long as a long-running process doesn't die). http://www.finalcog
8/23/09
bob_j...@burtleburtle.net
, …
aka...@gmail.com
3
10/19/08
a possible 4-way hash function test
Hi i have problem i make byte message in c# and send with sokect to server. but server abort
unread,
a possible 4-way hash function test
Hi i have problem i make byte message in c# and send with sokect to server. but server abort
10/19/08
Alex Vinokur
, …
Andres Valloud
5
4/17/08
Probably an unreachable statement in hashlttle() and hashbig()
In general, the issue is that the hash value of a null object should not be null. This is
unread,
Probably an unreachable statement in hashlttle() and hashbig()
In general, the issue is that the hash value of a null object should not be null. This is
4/17/08
Austin Appleby
,
Paolo Bonzini
4
3/14/08
MurmurHash 2.0 is over 100% faster than SuperFastHash and Lookup3
On Mar 14, 3:01 am, Austin Appleby <tanj...@gmail.com> wrote: > OneAtATime - 354.163715 mb/
unread,
MurmurHash 2.0 is over 100% faster than SuperFastHash and Lookup3
On Mar 14, 3:01 am, Austin Appleby <tanj...@gmail.com> wrote: > OneAtATime - 354.163715 mb/
3/14/08
Austin Appleby
,
Andres Valloud
7
3/11/08
MurmurHash statistical analysis done, reports posted.
Austin, The implementation of Set class>>largePrimes is below. It has the list of primes and
unread,
MurmurHash statistical analysis done, reports posted.
Austin, The implementation of Set class>>largePrimes is below. It has the list of primes and
3/11/08
Austin Appleby
2
3/7/08
Fun with hash function analysis.
Oh, FNV turned out only to be fast when inlined (1100 mb/s vs. 450 mb/ s not inlined). On Mar 7, 2:00
unread,
Fun with hash function analysis.
Oh, FNV turned out only to be fast when inlined (1100 mb/s vs. 450 mb/ s not inlined). On Mar 7, 2:00
3/7/08
Austin Appleby
, …
Andrew M.
20
3/7/08
New hash function "MurmurHash" - beats Hsieh and Jenkins.
The collision numbers you're seeing are all within reason for your dictionary size (expected # of
unread,
New hash function "MurmurHash" - beats Hsieh and Jenkins.
The collision numbers you're seeing are all within reason for your dictionary size (expected # of
3/7/08
Austin Appleby
3/5/08
Version of MurmurHash that only does aligned reads posted.
Also, a few reported glitches have been fixed. Latest sources are available here - http://murmurhash.
unread,
Version of MurmurHash that only does aligned reads posted.
Also, a few reported glitches have been fixed. Latest sources are available here - http://murmurhash.
3/5/08
Andres
2/25/08
New book on hashing available
Hello, My first published book, Hashing in Smalltalk: Theory and Practice has become available here:
unread,
New book on hashing available
Hello, My first published book, Hashing in Smalltalk: Theory and Practice has become available here:
2/25/08
mark...@jungle-monkey.com
,
Andres Valloud
4
12/1/07
Collision resistance
Mark, Thank you so much! You shall remain anonymous as you requested. Thanks again, Andres. On Dec 1,
unread,
Collision resistance
Mark, Thank you so much! You shall remain anonymous as you requested. Thanks again, Andres. On Dec 1,
12/1/07
Alex Vinokur
, …
Andres Valloud
3
11/29/07
hashlittle(), hashbig(), hashword() and endianness
If you can assume the hash function will look at only at a few bytes the value of which tends to be
unread,
hashlittle(), hashbig(), hashword() and endianness
If you can assume the hash function will look at only at a few bytes the value of which tends to be
11/29/07
C-struck
,
Blah Blah
2
11/29/07
need help in a project
4 days... ooops. adler32 is a hash function used for checksumming. It's neither a great hash
unread,
need help in a project
4 days... ooops. adler32 is a hash function used for checksumming. It's neither a great hash
11/29/07
Cesium
, …
Andres Valloud
8
11/16/07
fast hash functions
Regarding the distribution of hash values, I have observed such phenomena. However, I also think the
unread,
fast hash functions
Regarding the distribution of hash values, I have observed such phenomena. However, I also think the
11/16/07
Cesium
,
Andres Valloud
6
11/13/07
fast little hash function
Sigh... I ran into the same problems when writing the book. Other than running tests geared towards
unread,
fast little hash function
Sigh... I ran into the same problems when writing the book. Other than running tests geared towards
11/13/07
Cesium
11/2/07
denial of service attacks
An interesting blog post on denial of service attacks for hash functions exists at: http://www.
unread,
denial of service attacks
An interesting blog post on denial of service attacks for hash functions exists at: http://www.
11/2/07