Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re^5: [OT] The statistics of hashing.

by flexvault (Monsignor)
on Apr 03, 2012 at 11:18 UTC ( #963217=note: print w/replies, xml ) Need Help??


in reply to Re^4: [OT] The statistics of hashing.
in thread [OT] The statistics of hashing.

BrowserUK,

I had to download your code to figure out what you were doing, but now I know your interest in uniqueness was different than mine(i.e. project).

Each of the test encrypted files was unique and we wanted an algorithm that would produce the lowest number of duplicate hashes for the different unique files. The statistics I showed was the number of duplicate hashes produced from unique files. Each hash was generated and then:

... $Dupes{$hash}++; ...
Then we just counted the total number of keys with values greater than one.

Your code was very interesting and quite a mind tester.

Thank you

"Well done is better than well said." - Benjamin Franklin

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://963217]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (2)
As of 2020-12-03 07:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How often do you use taint mode?





    Results (51 votes). Check out past polls.

    Notices?