Re: XOR passphrase with a constant
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: XOR passphrase with a constant

From: Andrew <anelless@gmail.com>
Date: Mon May 30 2005 - 20:49:50 CEST



Furthermore given two different passphraes P1 and P2,  a single known


constant C, H(C + P1) and H(C + P2), is finding a collision for either


made any easier than finding a collision for H(P1) or H(P2) if an


attacker knows these instead?



My guess would be that if Length(C  + P1) > Length(H(C + P1)) but


Length(P1) <= Length(H(P1)) then the task would be made easier. But to


be honest it's all a bit much for me to visualise.


Received on Thu Sep 29 21:39:13 2005