![]() |
Available news archives:
comp.lang.tcl
-
comp.lang.python
-
comp.security.firewalls
-
sci.crypt -
comp.lang.php -
comp.lang.javascript
|
|
sci.crypt archiveRe: XOR passphrase with a constant
From: Andrew <anelless@gmail.com>
Date: Mon May 30 2005 - 20:41:59 CEST
Yes the constant is known to all 3rd parties but the basic idea is if
MD5(C1 + P) and MD5(C2+ P) it is impossible to determine from the
Each of these hashes can then be used in further steps in an algorithm
I can't explain it better than that and I'm sure it seems odd. Mostly I
Basically my question is if both MD5(C1 + P) and MD5(C2 + P) become
|