Re: XOR passphrase with a constant

From: Andrew (anelless_at_gmail.com)
Date: 05/30/05

  • Next message: Anne & Lynn Wheeler: "Re: XOR passphrase with a constant" 
    Date: 30 May 2005 11:49:50 -0700

    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.

  • Next message: Anne & Lynn Wheeler: "Re: XOR passphrase with a constant"

    Relevant Pages

    • Re: HMAC -NMAC security
      ... >> attacker needs to find a collision with good probability? ... > answer to the inner function calculation, i.e. H, then I will ... > A collision in the inner hash computation will automatically translate into ... > me the answer to the HMAC computation on m, i.e. H). ...
      (sci.crypt)
    • Re: ARC4 as a hash function
      ... The attacker, with his message, should be able to find a collision with ... the attacker knows all the values in the S array and controls the PM ... if it was then no hash function would be secure. ... I agree that it is easy to make a mistake, which is why as far as ...
      (sci.crypt)
    • Re: Outrageous claims on cash collision exploits???
      ... > stream come out with any hash the attacker desires. ... > sounded like you could do fine tuned evil collisions now. ... > someone comes out with a way to pad evil stream which by no means is ... If the arbitrary_text_n induces a chaining-value collision, ...
      (sci.crypt)
    • Re: SHA-1 vs. triple-DES for password encryption?
      ... So, if its worth spending a day finding a collision, its perfectly ... attacker - hence the dependency on the application - it has to be worth ... the passwords are for, ...
      (SecProg)
    • Re: Authentication of a messages using a counter and a MAC
      ... Two nodes share a symmetric key to authenticate message with, ... I was thinking to have a MAC of size 3 byte, does it mean that i can ... Because you are taking a random walk, the odds of finding a collision ... the attacker build the data series they want ...
      (sci.crypt)