LWN.net Logo

Algorithmic compexity attacks

Algorithmic compexity attacks

Posted Jun 5, 2003 11:43 UTC (Thu) by fergal (subscriber, #602)
In reply to: Algorithmic compexity attacks by NRArnot
Parent article: Algorithmic compexity attacks

Using some random element may help but the scheme you gave as an example doesn't help. With the XOR hash, if two strings A and B hash to the same value then they'll still hash to the same value when they have the random byte appended. Using md5 instead of XOR would prevent that. So it's a good solution but it still depends on have a good algorithm.


(Log in to post comments)

Copyright © 2012, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds