about random-generated keys and UUIDs

Alexander Sicular siculars at gmail.com
Fri Mar 11 06:48:43 EST 2011


Sven is correct. But in exactitude this is a base 62 encoding (a-zA-Z0-9).
The collision function of concern here is the erlang implementation of sha.
Oh, and ya, have a high degree of confidence in it.
On Mar 11, 2011 6:40 AM, "Sven Johansson" <johansson.sven at gmail.com> wrote:
> On Fri, Mar 11, 2011 at 11:16 AM, Antonio Rohman Fernandez <
> rohman at mahalostudio.com> wrote:
>
>> well, maybe i'm wrong, but i don't think base64 is very collision-free if
>> you have millions of entries in a same bucket... because even your
algorithm
>> include some uniqueness on it, base64 encoding it could get into some
>> collision:
>>
>> base64(superawesomeuniquestring) can be same as
>> base64(anothersuperawesomeuniquestring)
>>
>> Actually, that's not correct. Base64 is just a simple encoding algorithm,
> completely lossless and with a unique output for every unique input.
> In other words, base64(somestring) != base64(someotherstring) always holds
> true.
>
> Maybe you are confusing it with destructive cryptographic functions like
MD5
> ?
>
> Sven Johansson
> Twitter: @svjson
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.basho.com/pipermail/riak-users_lists.basho.com/attachments/20110311/e4c7ec48/attachment.html>


More information about the riak-users mailing list