Groups
Groups
Sign in
Groups
Groups
Hash Functions
Conversations
About
Send feedback
Help
Group path
Hash Functions
1–30 of 34
Mark all as read
Report group
0 selected
sri vani
,
Chuck Simmons
3
04/04/2018
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..
04/04/2018
pulla....@gmail.com
13/07/2016
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
13/07/2016
Andres Valloud
18/08/2015
[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
18/08/2015
medinaro...@gmail.com
02/06/2015
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
02/06/2015
anas....@gmail.com
, …
Andres Valloud
7
31/03/2014
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
31/03/2014
Andres Valloud
16/09/2011
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
16/09/2011
Andres Valloud
15/12/2010
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
15/12/2010
Bob Jenkins
27/10/2010
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.
27/10/2010
Andres Valloud
24/09/2010
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
24/09/2010
Andres Valloud
23/07/2010
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
23/07/2010
Andres Valloud
24/06/2010
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
24/06/2010
César Estébanez
,
Andres Valloud
2
10/05/2010
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.
10/05/2010
César Estébanez
, …
Andres Valloud
6
19/03/2010
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
19/03/2010
Andres
, …
Chuck Simmons
4
14/11/2009
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
14/11/2009
Chris Dew
24/08/2009
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
24/08/2009
Chris Dew
,
Andres
6
23/08/2009
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
23/08/2009
bob_j...@burtleburtle.net
, …
aka...@gmail.com
3
19/10/2008
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
19/10/2008
Alex Vinokur
, …
Andres Valloud
5
17/04/2008
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
17/04/2008
Austin Appleby
,
Paolo Bonzini
4
14/03/2008
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/
14/03/2008
Austin Appleby
,
Andres Valloud
7
11/03/2008
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
11/03/2008
Austin Appleby
2
07/03/2008
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
07/03/2008
Austin Appleby
, …
Andrew M.
20
07/03/2008
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
07/03/2008
Austin Appleby
05/03/2008
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.
05/03/2008
Andres
25/02/2008
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:
25/02/2008
mark...@jungle-monkey.com
,
Andres Valloud
4
01/12/2007
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,
01/12/2007
Alex Vinokur
, …
Andres Valloud
3
29/11/2007
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
29/11/2007
C-struck
,
Blah Blah
2
29/11/2007
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
29/11/2007
Cesium
, …
Andres Valloud
8
16/11/2007
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
16/11/2007
Cesium
,
Andres Valloud
6
13/11/2007
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
13/11/2007
Cesium
02/11/2007
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.
02/11/2007