Randal Hanak's Blog

Saturday, November 10, 2012

SHA-1 Hash Collision Likelihood

Thought about using SHA-1 hash as shorter version for comparison when storing browser fingerprints. Led me to some of these articles.


http://stackoverflow.com/questions/297960/hash-collision-what-are-the-chances

http://www.suspekt.org/2008/08/17/mt_srand-and-not-so-random-numbers/

http://en.wikipedia.org/wiki/Birthday_problem
Posted by Randal Hanak at 1:17 PM
Labels: Algorithms, Security

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

About Me

Randal Hanak
View my complete profile

Blog Archive

  • ►  2014 (3)
    • ►  August (1)
    • ►  July (1)
    • ►  May (1)
  • ►  2013 (65)
    • ►  December (1)
    • ►  November (2)
    • ►  October (2)
    • ►  September (1)
    • ►  August (2)
    • ►  July (7)
    • ►  May (2)
    • ►  April (8)
    • ►  March (37)
    • ►  February (3)
  • ▼  2012 (69)
    • ►  December (53)
    • ▼  November (10)
      • SHA-1 Hash Collision Likelihood
      • B Tree Algorithms
      • Protocols of the Semantic Web
      • HTML5, JS mobile frameworks
      • Intel Haswell
      • Google Maps API Issues
      • Varnish Cache
      • Mongodb Aggregation Examples
      • Microbenchmarking on the JVM and Long vs Int
      • Lock-free replacement for java.util.Hashtable
    • ►  October (6)
  • ►  2009 (1)
    • ►  February (1)
Simple theme. Theme images by luoman. Powered by Blogger.